Data Structures (COP-3530) – Section U2
Fall 2008
Announcements
- Midterm and Final are both closed books. A single double sided cheat sheet is allowed.
- Welcome to the COP-3530 web page!
General Info
Instructor: Vagelis Hristidis
Lecture times:
Tuesday/Thursday 5:00-6:15 pm
Location: ECS 145
Office hours: Tuesday 4 pm- 5 pm
Grading
40% midterm
40% final
20% assignments
Statistics
|
|
assignment
1 |
assignment
2 |
midterm |
assignment
3 |
final |
|
Minimum |
46 |
18 |
21 |
|
|
|
Maximum |
95 |
92 |
82 |
|
|
|
Median |
86 |
73.5 |
68 |
|
|
Assignments
|
|
Given Out |
Due in class |
|
10/2/2008 |
10/9/2008 |
|
|
10/21/2008 |
10/28/2008 |
|
|
11/5/2008 |
11/25/2008 |
|
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
Other material you should study, not included in the
below schedule:
· Java Part 1: Ch 1-3; javaintro
·
Java
Part 3: Ch 4; Inheritance
·
Abstract Data
Types, the Java Collections Framework, the Collection interface. Ch 6.1,
6.3.1, 6.4 - 6.9
|
Tuesday |
Thursday |
|
9/25 – Java Part 2: Ch 1-3; Java Pointers |
|
|
9/30- Algorithmic Analysis Part 1:
Ch 5: algorithms analysis |
10/2 - Algorithmic Analysis Part 2:
Ch 5: algorithms analysis |
|
10/7 - Algorithmic Analysis Part 3: Ch 5: algorithms analysis |
10/9 - Recursion, Divide and conquer (only first 8 slides): Ch 7 (The Master Theorem shows a general way to solve a recursive formula. You could use it in the Midterm if you want, although it is not necessary. A simplified version of the Master Theorem is Theorem 7.5 of the book.) |
|
10/14 – No class- Instructor out of town |
10/16 - Sorting and Searching Part 1: Ch 5.6, 8: Mark’s, Lowerbound |
|
10/21 - Sorting and Searching Part 2: Ch 5.6, 8 |
10/23 - Dynamic Programming, Backtracking, Greedy algorithms, Random Numbers: Ch 7.6,7.7,9.1,9.2 |
|
10/28 - Review Session |
10/30 – Midterm Exam |
|
11/4 - ArrayList. Ch 6.2,15, Linked List. Ch 17 |
11/6 - Stack and Queue: Ch 11, Ch 4.7, 16 |
|
11/11 – Holiday, no class |
11/13 – Stack and Queue (cont’d); Trees. Ch 18 |
|
11/18 - Trees. Ch 19.1-19.3, 19.5 |
11/20 – Graphs, Graphs - shortest path. Ch 14.1, 14.3 |
|
11/25 - hashing and maps. Ch 6.8, 20 (except 20.4) |
11/27 – No class- Thanksgiving |
|
12/2 - Review Session |
12/4 – No class - study for final |
|
12/9 – FINAL, 5pm-7pm, same room |
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.