Data Structures (COP-3530)
Spring 2007
Announcements
- Final is on Wed Apr 25 3:30-5:30pm
- Midterm and Final are both closed books. A single double sided cheat sheet is allowed.
- No class on January 8th.
- Welcome to the COP-3530 web page!
General Info
Instructor: Vagelis Hristidis
Lecture times:
Monday/Wednesday 5:00-6:15 pm
Location: ECS 138
Office hours: Monday 4 pm- 5 pm
Grading
40% midterm
40% final
20% assignments
Statistics
|
|
assignment 1 |
assignment 2 |
midterm |
assignment 3 |
assignment 4 |
final |
|
Minimum |
39 |
30 |
40 |
|
|
|
|
Maximum |
95 |
100 |
88 |
|
|
|
|
Median |
80.5 |
80 |
71 |
|
|
|
Assignments
|
|
Given Out |
Due in class |
|
1/31/2007 |
2/7/2007 |
|
|
2/16/2007 |
2/26/2007 |
|
|
3/12/2007 |
3/28/2007 |
|
|
4/6/2007 |
4/16/2007 |
Note: Late submissions will receive
20% penalty as long as they are turned in before I return the corrected
assignments. After that, no submissions are accepted.
Topics
- Java Review
- Algorithm Analysis
- Recursion
- Linked Lists
- Binary search trees
- AVL Trees
- Shortest Paths
- Priority Queues
- Hash Tables
- Sorting
Tentative
Lectures’ Schedule
|
Monday |
Wednesday |
|
Jan 8 – No Class |
Jan 12 –
Class Intro, Java Part 1: Ch 1-3; javaintro |
|
Jan 15 – No Class – Martin Luther King |
Jan 17 – Java Part 2: Ch 1-3; Java Pointers |
|
Jan 22 - Java Part 3: Ch 4; Inheritance |
Jan 24 - Algorithmic Analysis Part 1: Ch 5: algorithms analysis |
|
Jan 29 - Algorithmic Analysis Part 2: Ch 5: algorithms analysis |
Jan 31 - Algorithmic Analysis Part 3: Ch 5: algorithms analysis |
|
Feb 5 - Recursion: Ch 7 |
Feb 7 - Divide and conquer (only first 8 slides): Ch 7 |
|
Feb 12 - Sorting and Searching Part 1: Ch 5.6, 8: Mark’s, Lowerbound |
Feb 14 – Sorting and Searching Part 2: Ch 5.6, 8 |
|
Feb 19 - Dynamic Programming, Backtracking, Greedy algorithms, Random Numbers: Ch 7.6,7.7,9.1,9.2 |
Feb 21 - Review Session |
|
Feb 26 - Midterm Exam |
Feb 28 - Abstract Data Types, the Java Collections Framework, the Collection interface. Ch 6.1, 6.3.1, 6.4 - 6.9 |
|
Mar 5 - ArrayList. Ch 6.2,15 |
Mar 7 – No class – Instructor out of town |
|
Mar 12 - Linked List. Ch 17 |
Mar 14 - Stack and Queue: Ch 11 |
|
Mar 19 - SPRING BREAK |
Mar 21 - SPRING BREAK |
|
Mar 26 - Stack and Queue: Ch 4.7, 16 |
Mar 28 - Trees. Ch 18 |
|
Apr 2 – Trees. Ch 19.1-19.3, 19.5 |
Apr 4 – Graphs. Ch 14.1 |
|
Apr 9 - Graphs - shortest path. Ch 14.3 |
Apr 11 - hashing and maps. Ch 6.8, 20 (except 20.4) |
|
Apr 16 - Review Session |
Apr 18 - No class - study for final |
|
|
Apr 25 – Final (3:30-5:30pm) |
Disclaimer: Many slides are
taken from Mike Scott from UT Austin
Textbook
Mark
Weiss. Data Structures and Problem Solving Using Java, 3/E
ISBN: 0-321-32213-4
Publisher: Addison-Wesley
Secondary textbook:
Goodrich,Tamassia: Data Structures
and Algorithms in Java, 4th Edition
ISBN:
0-471-73884-0
Publisher:
Wiley
Policies
Code of Academic Integrity:
http://www.fiu.edu/~oabp/misconductweb/2codeofacainteg.htm
University Policies: academic misconduct, sexual harassment, religious holydays, and information on services for students with disabilities.