This course aims to teach the concepts, implementations and applications of data structures such as arrays, linked lists, stacks, queues and trees that are important for building effi cient algorithms; It will develop your knowledge, understanding and skills about three algorithm design approaches to solve sorting problems (incremental, data structures and divide-and-conquer). It will also teach you how to select and implement appropriate searching algorithms (sequential search, binary search, search using hash tables), as part of a problem solution.
| AUs | 3.0 AUs |
| Grade Type | |
| Prerequisite | |
| Exam |
Prerequisite Graph
Required first
Data Structures & Algorithms
Available Indexes
| Mon | Tue | Wed | Thu | Fri | Sat | |
|---|---|---|---|---|---|---|
| 930 | 14540 TUT (COMP1) 0930-1150 Sat HWLAB 1 Wk1-7 | |||||
| 1000 | ||||||
| 1030 | ||||||
| 1100 | ||||||
| 1130 |
Other Relevant Mods
CT2002
Introduction To Computer Architecture & Networks
CT2003
Object Oriented Design & Programming
CT2004
Software Engineering
CT2009
Design Thinking
CT2010
Project Management (Business Needs Analysis & Risk Analysis)
CT2011
Data Analysis & Market Sensing (Business Intelligence)
CT2079
Mini Capstone (Full Stack) Project