CS 302
Main
Menu

Home Page
Syllabus
Textbook
Homework
Labs
Links
Instructor

CS 302 - Fundamental Algorithms
Spring Semester 2002, Sections 29059/29062
 

TextBook: Data Structures & Problem Solving using JAVA by Mark Allen Weiss (2nd Ed., Addison Wesley)

Prerequisites: Students must have successfully completed CS140 (Data Structures) and CS160 (Computer Organization) to register for CS302. ECE students (majoring in Computer Engineering) are not required to take CS160 prior to CS302 but should have completed CS140. CS students who have not completed CS140 and CS160 (or ECE students who have not completed CS140) prior to the first day of class, will be dropped from the roll. This course is required for both the Computer Science and Computer Engineering BS degrees.

Grades: Points are awarded throughout the term for laboratory and homework assignments (25%), two in-class exams (25% each), and the final exam (25%). Percentages denote portion of final grade attributed to each item, and point distribution is subject to change. This course is conducted according to departmental policy which is observed by all professors and graduate teaching assistants who participate in it. Please note that under no circumstances will cheating be tolerated.

Deadlines: There will be no make-up tests or labs throughout the semester. All homework/worksheet assignments are due on the specified dates. Late homework will not be accepted - no exceptions!

Week(s) Topic Covered = completed
1 JAVA Basics Covered
2 Reference Types Covered
3 Objects and Classes Covered
4,5 Inheritance Covered Exam I Review
6 Algorithm Analysis Covered
7,8 Recursion, Sorting Algorithms Covered
9 Graphs and Paths Covered
10,11 Stacks and Queues Covered
12,13 Linked Lists Covered Exam II Review
14,15 AVL Trees, Binary Search Trees Covered
16 Red-Black Trees Covered Final Exam Review