COMP 182/L: Data Structures and Program Design and Lab

---

Lesson 1: Lecture (Ch 1,2,3,6)
– Introduction
– Principles of problem solving and software engineering
– Recursion
Lab
– Class diagram
– Recursion
Lesson 2: Lecture (Ch 4,5,9)
– Recursion and UML class diagram (review)
– ADTs: Data abstractions, Procedural abstractions
– ADT List and ADT Sorted List: Specify ADTs, Design ADTs, Implement ADTs
Lab
– Recursion
– ADTs
– ADT List
Lesson 3: Lecture (Ch 5)
– Object reference
– Referenced-based ADT List
– Java Collection Framework(JCF)
Lab
– Specify, design, and implementing referenced-based ADT List
– Programming assignment
Lesson 4: Lecture/Lab (Ch 7,8)
– Stack
– Queue
Lesson 5: Lecture/Lab (Ch 10)
– Algorithm efficiency, searching, and sorting
Lesson 6: Lecture (Ch 11)
– Tree Terminology
– ADT Binary Tree
– Traversals of a Binary Tree!