(3 credits – TG) 3 hours lecture, 2 hours tutorial
Data structures important to computer science will be studied, including trees, graphs and hash tables. Searching and sorting techniques will be emphasized. Associated algorithms and their time and space efficiency will also be studied.
Prerequisite: Computer Science 1633 with a minimum grade of C- or higher.
Recommended Preparation: Mathematics 1271 with a minimum grade of C- or higher.