Professor: John
Noga (john.noga@csun.edu) (x6480)
WebCT: http://webteach.csun.edu/
Lectures: EA2215 - M/W 15:30-16:45
Labs: EA 2215 - M/W 17:00-18:15
Office Hours Noga:
EA 4429 - M 18:30-19:30 & R 17:00-19:00
Text: Data
Structures and Algorithms in Java - Goodrich & Tamassia
Course Objectives: Understanding data structures and their role in
the larger area of software development. Structures covered include
arrays, vectors, linked lists, stacks, queues, hash tables, and trees.
Sorthing and searching techniques will be studied. The course also
introduces the analysis techniques necessary to understand the impact
the choice of structure has on execution time and storage space.
Various Java programming items are covered as needed to support
programming projects.
Class Web Page: http://www.csun.edu/~jnoga/comp182/
Tentative Schedule: (P) indicates a project due that week,
(LE) indicates a lab exam date
| Monday |
Wednesday |
| Jan 29 Syllabus/Review |
Jan 31 Review/List ADT (P0) |
| Feb 5 Linked Lists |
Feb 7 Linked Lists |
| Feb 12 Linked
Lists |
Feb 14 Algorithm
Efficiency (P1) |
| Feb 19 Algorithm Analysis |
Feb 21 Recursion |
| Feb 26 Recursion (LE) |
Feb
28 Recursion |
| Mar 5 CatchUp & Review | Mar 7 Midterm 1 (P2) |
| Mar 12 Sorting |
Mar 14 Sorting |
| Mar 19 Sorting | Mar 21 Sorting (P3) |
| Mar 26 Java
Items/APIs |
Mar 28 Hash
Tables |
| Apr 2 Spring Break |
Apr 4 Spring Break |
| Apr 9 Hash Tables |
Apr 11 Stacks/Queues
(LE) (P4) |
| Apr 16 CatchUp & Review |
Apr 18 Midterm 2 |
| Apr 23 Trees Intro |
Apr 25 Java Items |
| April 30 Binary
Search Trees |
May 2 Recursion (P5) |
| May 7 Binary Search Trees |
May 9 Heaps/HeapSort |
| May 14 DynProg
(LE) |
May 16 CatchUp & Review (P6) |
|
|
May 23 Final 15:00-17:00 |
| A 92% |
A- 90% |
|
| B+ 88% |
B 82% |
B- 80% |
| C+ 78% |
C 72% |
C- 70% |
| D+ 68% |
D 62% |
D- 60% |
| F 0% |