ELIGIBILITY
All students
PRE/CO-REQUISITES
CSC405
This course examines classic data structures: lists, queues, stacks, binary trees and graphs, and hash tables. Standard algorithms for sorting and searching will be studied, and complexity analysis performed using big-oh notation. Students also develop a deeper understanding of software engineering principles as the course emphasizes reuse and generic programming.
This course examines classic data structures: lists, queues, stacks, binary trees and graphs, and hash tables. Standard algorithms for sorting and searching will be studied, and complexity analysis performed using big-oh notation. Students also develop a deeper understanding of software engineering principles as the course emphasizes reuse and generic programming.
Powered by