Data Structures

Fall 2018

Office Hours: Click here, Grade: Click here

Textbook:

Data Structures and Algorithms inJAVA, Robert Lafore

Topics covered

• Metrics: Algorithm complexity
• Basic collections: 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

Exams

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

Homework 

• 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. 
• 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
Recursion, Generics	Programming	Hw1
complexity	Writing	Hw2
Stack, Queue	Writing	Hw3
Stack, Queue	programming	Hw4
Sort	programming	Hw5
Tree	writing	Hw6
Tree	programming	Hw7
Graph	writing	Hw8
Graph	programming	Hw9

Grading Policy:

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

• Homework...10%
• Programming.....20%
• 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. 

Lecture Notes:

Chapter	Lecture Note	Codes
Recursion	Lec1-ds.ppt	--
Algorithm complexity	Lec2-ds.ppt	--
Generics	Lec3-ds.pptx	--
Stacks	Lec3-ds.pptx	ArrayStack
Queues	Lec5-ds.ppt	Linked-List Queue
Linked List	Lec6-ds.ppt	Single Linked-List
Linked List based Queues and Stacks	Lec7-ds.ppt	Doubly Linked-List
Iterators and List	Lec8-ds.ppt	Iterators, Stack, and ArrayList
Advanced topic in linked list	--
Linear and binary search	Lec10-ds.ppt
Midterm 1
Insertion Sort	Lec11-ds.ppt
Recursive Sort	Lec12-ds.ppt
Trees and binary trees	Lec13-ds.ppt
Tree Traversal	Lec14-ds.ppt
Sets and ordered list	Lec15-ds.ppt
Binary search tree	Lec16-ds.ppt
Midterm 2
Hash tables	Lec17-ds.ppt
Heaps	Lec18-ds.ppt
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
Final