CS 202
COMPUTER SCIENCE I I - CSC 202
Click here to download full syllabus in pdf
Instructor: Steve Howard
Course Description: The course is designed to teach object oriented programming techniques using Python. The course examines data structures and algorithm analysis. It covers data structures (including stacks, queues, arrays, records, files, linked lists, and trees), abstract data types, algorithm analysis (including searching and sorting methods), and file structures. The course includes a 3 hour lab each week. Prerequisite CSC 201.
Credit Hours: 4 semester hours
Textbook: Goldwasser & Letscher, 2008, Object Oriented Programming in Python.
Software: Python 2.7.2
General Course Objectives: Upon completion of the course students will be able to:
- properly utilize object – oriented programming techniques to develop algorithms which solve programming problems.
- document all programming projects.
- utilize classes and derived classes to develop solutions to programming problems.
- utilize inheritance and polymorphism in derived classes.
- utilize file processing to read and write text and objects to files.
- understand and implement dynamic data structures including linked lists, queues and stacks to solve programming problems.
- understand and implement trees including binary search of trees.
- utilize cs1graphics.py to draw lines, rectangles, strings and images.
- Implement selected programming projects using multiple threads.
- Implement peer-to-peer and server/client programs using network communications protocols.
- Use numpy to solve mathematical models
Evaluation of student performance: Student performance will be evaluated using quizzes, lab activities, tests and programming projects. The points assigned to each activity are listed below.
Tests (2) 30%
Programming Projects 22.5%
Quizzes/lab activities 7.5%
Final Senior Project 15%
Final Exam 25%
Computer Science – TENTATIVE Weekly Class Schedule – Spring 2012
Week of Section Topic
1/9 Ch 3 Intro to cs1graphics
1/16 Ch 3 cs1graphics
1/23 Ch 7 Good Software Practices
1/30 Ch 8 Reading from and writing to files
2/6 Ch 9 Inheritance
2/13 Handouts Threads
2/21 Test 1
2/20 Handouts Linked Lists/ Queues
2/27 Handouts Stacks/Trees/Hash Table
3/5 Ch 16 Network Programming
3/12 Ch 16 peer-to-peer, client/server
3/19 Ch 16 Communication Protocols
3/26 Ch 16 “
4/3 Test 2
4/2 Handouts Numpy
4/9 Spring Break
4/16 Handouts Numpy
4/23 Exam review
4/25 Semester Exam
4/26 – 5/24 Senior Project Time


