CSC365 - Data Structures & Algorithms

Section 800--MWF 9:10-10:05

Room 106 Snygg

http://www.cs.oswego.edu/~mohammad/365

Rameen Mohammadi

Office Hours: MWF (10:20-11:45), Th (10:45:-11:45), and by appointment.

Office: 145 Snygg
Phone: 315-312-2689 (office), 315-564-5911 (home)
Fax: 315-312-5424
Email: mohammad@oswego.edu
URL: http://www.cs.oswego.edu/~mohammad

Objectives:

To become exposed to file design and management concepts.

To further your understanding of data structures and algorithms analysis using topics in trees and graphs.

To learn about data persistence using files and database systems on external storage devices.

To learn more problem solving techniques with recursion.

To further your knowledge of programming and design with java.

Text:

Data Structures & Algorithms, 2ed (2003), Robert Lafore, SAMS ISBN: 0-672-32453-9

If you already have a good data structures book that may be comparable to the book listed here; you don’t have to buy this book. Let me take a look at what you have and tell you if you would be better off purchasing this one.

Computer Facilities:

SUN servers. For the most part, you will use the SUN workstations in Snygg (rooms 103 and 104).

Grading:

Exams 1,2............................. 30%

Final Exam............................ 20%

Class Participation................... 5%

Home Work............................. 5%

Programs 0-4.......................... 40%

Notes:

• Assignments will be available on the web as well as other useful information. However, I don't expect that I will have the notes on the web; but, I will journal our course activities at the course site with links to examples presented in class. The site address will be www.cs.oswego.edu/~mohammad/365
• You will turn in your assignments by email, they are due by midnight on the date due. Work turned in by midnight of next class after the due date will be penalized five percent, after that, you will lose ten percent for each week late. Don't fall behind in this course!
• Programs dated two calendar days early will be given a five percent extra credit.
• There will be a few short homework assignments as well; they must be turned in at the beginning of the class when they are due.
• You must work on your labs and assignments individually. Using another person's program in writing your own is illegal. Giving your programs to another person is also illegal. You will receive an E for the course in either case. Take responsibility in protecting your work that must remain confidential.
• READ THE COMPUTER SCIENCE POLICY ON CHEATING.

OUTLINE	Classes
I. Review OOD in Java	#1, #3
II. Introduce Swing	#4 - #6
III. Introduce container interfaces Map and Set and their implementations	#7, #8
IV. Overview of file processing	#9
V. External storage devices	#10
VI. Basic File System, Sequential and Random Access Methods and their Java implementations	#11 - #17
VII. Advanced data structures, topics in trees and graphs (AVL, red-black trees, 2-3-4 trees, Btree, Shortest Path and MaxFlow Graph Algorithms)	#18 - #36
VIII. Introduction to relational database and relevant external data structures; such as, External Btrees, Inverted and MultiList files; as well as, external sorting techniques.	#37 - #39