Topics Covered
. ..updated as lectures are made: COP3530 Spring 1998 A. Crummer
UNIT I Lectures 1-12
- Primitive and reference types
- Java apllications
- Arrays, Variables
- ADTs: Declare, Implement, Use
- ADTs: Advantages
- Linked structures, Nodes, traversal
- Recursion: strategies, call trees and traces
- Recursion: efficiency and Big-O(f(n))
- Order of sample reverse algorithms
- THREE famous problems: Towers, Permutations, 8-queens problem
- Modules, ADTs Packages
- REVIEW
UNIT II Lectures 13-22
- ADT: Queue and Priority Queue
- implementation strategies
- Java Packages and Directories
- Java Type casting
- Has-A and Is-A relations
- inheritance
- Java: inheritance and visibility modifiers
- Stacks
- Queues:impl as singly linked, Doublely, circular
- Using a Priority Queue to sort things
- Java: How to time a process; Big-Oh in practice
- ADT life cycle: implementing new ADTS; eg, SetADT
- Stack implementations
- applications; prefix, postfix, permutations, simulations
UNIT III Lectures 23-34
- Trees, complete, binary, sequential representation
- Heaps and Priority queues
- Binary tree traversals
- Tables and hashing: collisions, load factors, clustering
- collision resolution :Linear, double hash, chaining, buckets
- Hash table applications
- Graphs, representaions, traversal and Design decisions
- Sorting algorithms, classifications, and performance
Exam 3 will cover Unit III except for what hasnt been covered by that time
The final exam will be comprehensive