COMP2247 - Algorithms and Data Structures

Section 71 Monday and Wednesday 4:00 - 5:50 PM

Synchronous online class. It requires computer, Internet, video, and microphone capabilities. Classes will be held via Zoom meetings at the times listed on the schedule, the ability to meet at the scheduled times online is a requirement. Tests are In-Person.

This course covers the principles of complexity of algorithms and problem solving techniques with data structures. Topics include analysis of algorithm, array lists, linked lists, stacks, queues, binary search trees, sorting searching, and recursive algorithms. In-depth study of object-oriented programming concepts is covered. Additional topics may include iterators, heaps and priority queues, balanced binary search trees, dictionary, hashing and graph algorithms.

Weekly Schedule

Course Contents

- Review of COMP 2243 Materials
- ArrayLists
- OOP - Aggregation
- OOP - Inheritance
- OOP - Polymorphism
- OOP - Abstract Method / CLass
- Interface
- Exception Handling
- Recursion
- Sorting and Searching Algorithms
- Algorithm Analysis
- Generics
- Java Collections
- Linked Lists
- Stacks
- Queues
- Binary Trees
- Heaps and Priority Queues