|
Data Structures |
|
|
Fall 2012 |
Web log: click here, Office Hours: Click here, Grade: Click here
Data Structures and Algorithms in JAVA, Robert Lafore
 |
nJava and Object programming overview |
|
|
Stacks |
|
|
Queues |
|
|
Arrays |
|
|
Linked List |
|
|
Trees |
|
|
Binary trees, heaps, search trees, |
|
|
Graphs |
|
|
Spanning tree, minimum spanning tree, shortest path tree, |
|
|
Sorting |
|
|
Quick sort, Insertion sort, heap sort, merge sort |
|
|
Hashing |
|
|
There will be 1 exam during the semester and a final exam at the end of the semester. |
|
|
Assignments are due seven days from the initial day of the assignment. |
|
|
Late homework will be docked 50% per class period late, unless approved arrangements are made in advance. |
|
|
All coursework must be clear, legible, and have the name, course, and assignment number in the upper right hand corner of the page. |
|
|
Cooperative group study on the homework is encouraged, but simply copying someone else's work is unethical and will leave you unprepared for exams. |
| Topic | Type | Word File |
| complexity | Writing | Hw1-f12.docx |
| Stack, Queue | programming | Hw2-f12.docx |
| Stack | programming | Hw3-f12.docx |
| Stack, Queue, Sort | writing | Hw4-f12.docx |
| Linked List, Sort | programming | Hw5-f12.docx |
| Trees | Writing | Hw6-f12.docx |
| Trees, Heaps, Graphs | Programming | Hw7-f12.docx |
Final grades in the course will be based on the following weighting distribution.
|
|
Homework……15% |
|
|
Programming.....15% |
|
|
Midterm 1…… 35% |
|
|
Final Exam…..35% |
Students are responsible for their own learning, through reading and studying the text, reviewing the lectures,
and working out the homework problems. I strongly advise that you read the upcoming material before it appears in lecture;
the material will make much more sense that way.
| Topic | Chapter | Lecture Note | Codes |
| Recursion | 1 | Lec1-ds.ppt | Allen Weiis |
|
Algorithm complexity |
1 | Lec2-ds.ppt | -- |
| Generics | 2 | Lec3-ds.ppt | -- |
| Stacks | Page 115-132 | Lec4-ds.ppt | stack-code.zip |
| Queues | Page 132-143 | Lec5-ds.ppt | ArrayQueuePT.rar |
| Linked List | Page 179-202 | Lec6-ds.ppt | ListNode.rar |
| Linked List based Queues and Stacks | Page 202-231 | Lec7-ds.ppt | doublyLinked.rar |
| Iterators and List | Lec8-ds.ppt | ||
| Advanced topic in linked list | Lec9-ds.ppt | Advanced Linked List.rar | |
| Linear and binary search | Lec10-ds.ppt | ||
| Insertion Sort | Lec11-ds.ppt | ||
| Recursive Sort | Lec12-ds.ppt | ||
| Midterm review | midterm-review.pptx | ||
| Trees and binary trees | Lec13-ds.ppt | tree.rar | |
| Tree Traversal | Lec14-ds.ppt | ||
| Sets and ordered list | Lec15-ds.ppt | ||
| Binary search tree | Lec16-ds.ppt | ||
| Hash tables | Lec17-ds.ppt | ||
| Heaps | Lec18-ds.ppt | heap.rar | |
| Graphs | Lec19-ds.ppt | ||
| Graph iteration | Lec20-ds.ppt | ||
| Shortest path algorithm | Lec21-ds.ppt | ||
| Minimum spanning tree | Lec22-ds.ppt | ||
| Compression | Lec23-ds.pptx |