CS 2322: Computer Science II, Fall 2017

Instructor: François Neville Website:

Office: 360 Hagg Sauer Hall

Email:

Phone Number: 755-2840

Office hours: 1:00PM –2:00PMMW, 11:00AM – 2:00PM TH, and by drop in or appointment.

Class Times and Location: Class meets MWF from 12:00 – 12:50PM in HS229, and in Lab 2:00 – 3:30PM W

Required Textbook: Miller & Ranum, Problem-solving with Algorithms and Data Structures using Python (2nd ed.) Publ: Franklin, Beedle & Assoc. ISBN: 978-1-59028-257-1

Course Description: This course is a continuedapprenticeshipinto Computer Science, using the Python language. Topics covered will typically include: common data structures, sorting algorithms, linked-lists, classes, collections and basic object-oriented design.

Evaluation Procedures and Criteria:

Homework Assignments & Quizzes60%

Final Exam30%

Attendance, Participation10%

Grades: A: 100-89 B: 88-79 C: 78-69 D: 68-59

Makeups: Makeup exams will be given only if they are arranged in advance and there are extenuating circumstances.

Homework: I expect that everyone is familiar with MS Word or some other full-featured word processor. Accordingly, I expect all assignments handed in to me to be typed, rather than hand-written. Please also restate the question you are answering first, in bold, in addition to your response. Font-size no smaller than 10, no larger than 12. Lengthy responses to essay questions or papers should have a line-spacing of 1.5 or 2 (double-spaced). Figures, graphs, etc may be hand-drawn (in pen), and may be included inline in your document if you wish, but can also be appended to the end of your document so long as they are referenced in the appropriate places in your text. Figures must always be labeled and captioned. Graph paper is fine; if you must use lined paper, do trim the ragged edges. Always staple multiple sheets together; no paper-clips or folding.

Late policy: Assignments are due by a specified date and time. In general, assignments turned in late will lose at least 10% per week for tardiness. No work will be accepted after two weeks beyond its due-date.

Attendance:You are strongly encouraged to attend classes and labs. If you miss one you are responsible for material covered in it. There may be occasional changes to dates or policies mentioned in class.

Disability Services: Upon request this document can be made available in alternate formats. If you have a documented disability and need accommodations for this course please contact the Disability Services Office in 202 Sanford Hall (phone: 218-755-3883), Bemidji State University. Any other questions about this course should be directed to the instructor.

Academic Responsibility Policy: I strongly encourage you all to help each other out in the course of doing your assignments, etc. However all work handed in must be your own, and must be completed in a manner consistent with BSU University Senate Policy.

Tentative Schedule:

Week 1 (8/21-8/25):Introduction, Data Structures, Objects review

Week 2 (8/28-9/1):CH2: Big-O, Algorithm Analysis

Week 3 (9/6-9/8):No class Mon 9/4

Week 4 (9/11-9/15):CH3: Stacks, Queues

Week 5 (9/18-9/22):

Week 6 (9/25-9/29):CH4: Recursion

Week 7 (10/2-10/6):

Week 8 (10/9-10/13):CH5: Searching, Hashing

Week 9 (10/16-10/20):Sorting

Week 10 (10/23-10/27):

Week 11 (10/30-11/3):

Week 12 (11/6-11/8):GroupProject; No class Fri 11/10

Week 13 (11/13):CH6: Trees; No class Wed-Fri 11/15-17

Week 14 (11/20-11/24):Thanksgiving Break

Week 15 (11/27-12/1):

Week 16 (12/4):Review; Final Exams Begin 12/7

Final Exam TuesDec12, 10:30AM