Data Structures

Fall 2006

 

Instructor:  Dr. M. Bag-Mohammadi

Email: mozafarb@ece.ut.ac.ir

Web log: click here

Office Hours: Click here

Grade: Click here

Textbook:

ساختمان داده ها در زبان C++ نوشته الیس هورویتس، ساهنی ، مهتا ترجمه امیر علیخان زاده -- انتشارات خراسان

 

Topics covered
bullet

nC++ and Object programming overview

bullet

Stacks

bullet

Queues

bullet

Arrays

bullet

Linked List

bullet

Trees

bullet

Binary trees, heaps, search trees,

bullet

Graphs

bullet

Spanning tree, minimum spanning tree, shortest path tree,

bullet

Sorting

bullet

Quick sort, Insertion sort, heap sort, merge sort

bullet

Hashing

Exams

bullet

There will be 1 exam during the semester and a final exam at the end of the semester. 

 

Homework 
bullet

Assignments are due seven days from the initial day of the assignment.   

bullet

Late homework will be docked 50% per class period late, unless approved arrangements are made in advance. 

bullet

All coursework must be clear, legible, and have the name, course, and assignment number in the upper right hand corner of the page. 

bullet

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 Solutions Word File
complexity hw1.doc Hw1-f06.doc
Queue, stack hw2.doc Hw2-f06.doc
tree, hw3.doc Hw3-f06.doc
 
Grading Policy:

Final grades in the course will be based on the following weighting distribution.

 

bullet

Homework……15%

bullet

Midterm 1…… 35%

bullet

Final Exam…..50%

 

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. 

Lecture Notes:
Topic Chapter Lecture Note
Introduction to C++ 0 lecture1.ppt

Algorithm complexity

1 lecture2-to-7.ppt
Templated class 2 lecture8-to-9.ppt
Linked List 4 lecture10-to-11.ppt
Linked List add-on 4 lecture12-to-13.ppt
Stacks 3,4 lecture14-to-15.ppt
Queue 3,4 lecture16-to17.ppt
midterm 1,2,3,4 Mid-ds-f06.doc
Sort algorithms 7 lecture21-22.ppt
Tree 5 lecture23-to-24.ppt
Binary tree, Heap 5 lecture25-to-26.ppt
Binary search tree, rank information, threaded tree 5 lecture27-to-30.ppt
graphs 6 lecture32-to-33.ppt
Final 5,6,7 Final-f06.doc

horizontal rule