Objects and Algorithms

Catalog description

An intermediate programming course that continues the development of object-oriented techniques using data structures with an emphasis on graphs, sets, maps/tables, heaps, and trees; foundational analysis and design of various algorithms that exhibit recursion, backtracking, divide and conquer, greedy strategies and dynamic programming techniques; random number generation; cryptography; introductory parallel programming techniques; includes an analysis of time and memory complexity using discrete metrics; sorting and searching techniques. The course is offered with an option for choice of programming languages (C++ or Java or Python).