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 | |
| Not Available To Programme | |
| Not Available To All Programme With | |
| Not Available As BDE/UE To Programme | |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | SC1007 |
| Not Offered As BDE | |
| Not Offered As Unrestricted Elective | |
| Exam |
Available Indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
Other offerings
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