Syllabus

CS203 Programming with Data Structures

Spring 2006
Computer Science Department
California State University, Los Angeles


Lectures:
Monday and Wednesday 2:30pm - 4:10pm, in E&T C159
Labs: Thursday 1:40pm - 4:10pm, in E&T C159
Instructor:
Chengyu Sun
Email: csun@calstatela.edu
Office: E&T A317
Office Hours: MW 1:30-2:30pm, MW 4:10-5:10pm,  and TR 4:10-6:10pm, or by appointment, in E&T A317
Course Description:
In this course we will discuss the design, implementation, and use of elementary data structures such as lists, queues, stacks, trees, and hash tables. We will also cover common search and sort algorithms, as well as some advanced programming topics such as generics, multithreading, and network programming.
Prerequisites:
CS202
Textbook(s): Java: How to Program (Six Edition) , by Deitel and Deitel
Software Tools:
Required - Email, J2SE 1.5.x
Optional (for access online lecture notes) - Adobe Acroread and/or MS PowerPoint
Grading Policy:
Homework and projects 40%, Labs 20%, Midterm 20%, Final 20%

90 - 100
80 - 90
60 - 80
40 - 60
below 40
A
B
C
D
F
Schedule:
Week
Topics
Chapters
1 Administrative issues
I/O and recursion
Object-oriented programming concepts

13, 14, 15
8, 9, 10
2
Lists
17
3
Introduction to algorithm analysis

4
Queues and stacks
17
5
Binary search tree
Hashtables
17
6 MIDTERM
7
Search and sort
16
8
Generics
Java Collection classes
18
19
9
Multithreading and synchronization 23
10
Network programming 24
11
FINAL

Online Resources:
Academic Integrity:
Cheating will not be tolerated. Cheating on any assignment or exam will be taken seriously.  All parties involved will receive a grade of F for the course and be reported to the Academic Senate.