CSC 365

CSC 365 Course Syllabus (3 credit hours)

Instructor: E. Wenderholm
Office: 435 Shineman Center
email: e l a i n e . w e n d e r h o l m "a t " o s w e g o . e d u
Office Hours: here.
Course Materials: http://www.cs.oswego.edu/~wender/Classes/365/
Course Registrar Information: here.
Prerequisites: CSC 241

Topics

Java Collections Framework
Trees, continued. (binary, binary search, splay)
Balanced trees (2-3-4, red-black, B-Trees)
persistent B-Trees
hashing
heaps; heap-based priority queue
I/O APIs
Algorithms on persistent data
Graphs Algorithms: traversal, connectivity, paths, spanning trees, flow
Applications
Big-O and combinatorial problems

Learning Objectives

Upon successful completion of this course you will be able to:

Demonstrate an understanding of some of the most advanced data structures in computer science.
Demonstrate an understanding of the concept of external files.
Perform mathematical and empirical studies on algorithms.
Develop external sort algorithms.
Survey some of the most important algorithms in computer science.
Use advanced programming concepts and techniques of Java for
1. event-driven programming
2. GUI design
3. external file structure

Grading

Subject to minor change:

One final exam (15%).
test(s) and/or several (up to ten) unannounced 10-minute quizzes (20%).
Programming assignments (65%). Programs may not be submitted unless they run correctly - you must demo your program to me before you submit it. You also must demonstrate an understanding of your program. This is accomplished by answering programming and design questions about your code during your demo. Ten percent credit is taken off per day late. (Weekends are no exception.)
You must have passing grades on all programming assignments in order to receive a passing grade for the course.
There will be a test Thanksgiving week.

Letter Grades: 90+ A | 80-89 B | 70-79 C | 66-69 C- | 60-65 D | below 60 E

Additional Information

This course does not use Blackboard.
No NetBeans. No IDEs.
If you want to use your Windows machine, download cygwin. It is free. It works great.
If you want to use a Mac you are in luck. All the utilities available on unix machines are also available on a Mac.
Don't forget you have CS accounts and access to the CS labs.
Disability Services.
Intellectual Integrity.
Computer Science Department Cheating Policy.
You must cite all sources for any information that you use to solve programming and/or homework assignments.

Evidence that you have have not cited sources, or that another or others have contributed significantly to your work, or both, will result in failure in the course, or worse.

You may use any classes in the Java API unless I specify otherwise. You may use any code that I give you. You may use no other code.
There are no makeup tests or quizzes. Requests to make up quizzes/tests or hand in assignments late rarely will be permitted unless accompanied by a written medical excuse. If missing a quiz/test is unavoidable, you must notify me sufficiently beforehand. (An hour before class usually is not sufficient.) Excuses such as sleeping late, my dog ate my homework, and other such reasons will not be considered.

Text

There is no text for the course. Assigned reading will be from on-line resources and handouts.
Java's online tutorials are excellent references.
Cormen, Leiserson, Rivest and Stein. Introduction to Algorithms. (any edition) Be forewarned: it is difficult reading.

Web resource links are available on the course web page. http://www.cs.oswego.edu/~wender/Classes/365/