CS 146: Data Structures and Algorithms
1600-1715 TTh, MH 223
and 1730-1845, MH 222
Jeff Smith, MH 415, 924-5153
Tentative office hours:
1330-1430 MW and 1600-1730 TTh, or by appointment.
Text:
Weiss, Data Structures and Algorithm Analysis in Java. Other references will be available in the library's course reserves.
Grading system:
50% on class assigments
30% on 3 in-class tests
20% on the final exam
See the separate sheets on Assignments and Documentation for specific requirements in these areas. These, together with other useful documents, will be available on the class web page at
http://www.mathcs.sjsu.edu/faculty/smithj/classes/146
Note that this is accessible from my home page.
All tests will be open book and open notes.
Topics:
The major topics of the course will be advanced tree structures (including heaps), graphs, advanced searching and sorting techniques, and introductory algorithmic analysis and design. Before covering these topics, we will review algorithm analysis and O-notation, and elementary data types and the corresponding classes in the Java collections library. Most of the course time will be spent on Chapters 4 and 6-10 of the text.
Class Attendance:
Class attendance is not required, but is strongly recommended. Beginning one week after the first exam, only documentable compelling reasons will be considered for withdrawal requests.
Collaboration:
The work you turn in should be your own. Do not share your work with anyone else. Please become familiar with the official university policy on academic dishonesty, as stated in the 2000-2002 catalog, pp. 430-431, or at
http://info.sjsu.edu/web-dbgen/catnarr/policies/n30.html.