Data Structures
Spring 2007
|
|
Data Structures |
|
Spring 2007 |
Web log: click here, Office Hours: Click here, Grade: Click here
ساختمان داده ها در زبان C++ ، الیس هورویتس، ساهنی ، مهتا ترجمه امیر علیخان زاده -- انتشارات خراسان
 |
nC++ 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 |
| Template | programming | Hw1-s07.doc |
| complexity | Writing | Hw1-s07c.doc |
| Functions | programming | Hw2-s07.doc |
| Linked List | programming | Hw3-s07.doc |
| palindrome | programming | Hw4-s07.doc |
| Maze search | programming | Hw5-s07.doc |
| Queue, stack | Writing | Hw2-s07c.doc |
| radix sort | programming | Hw6-s07.doc |
| tree | programming | Hw7-8-9-s07.doc |
| tree | Writing | Hw3-s07c.doc |
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 |
| Introduction to C++ | 0 | C++ review |
| Recursion | 1 | lecture1.ppt |
|
Algorithm complexity |
1 | lecture2.ppt |
| Templated class | 2 | lecture3.ppt |
| Linked List | 4 | lecture4.ppt |
| Linked List add-on | 4 | lecture5.ppt |
| Stacks | 3,4 | lecture6.ppt |
| Queue | 3,4 | lecture7.ppt |
| Midterm | 1,2,3,4 | Mid-ds-s07.doc |
| Sort algorithms 1 | 7 | lecture8.ppt |
| quicksort, mergsort | 7 | lecture9.ppt |
| Tree | 5 | lecture10f.ppt |
| Binary tree, Heap | 5 | lecture11f.ppt |
| Binary search tree, rank information, threaded tree | 6 | lecture12f.ppt |
| Final | 5,6,7 |