Algorithm Analysis: growth of functions, Big-oh notation, basic recurrences. Elementary sorting methods: Insertion, Selection, Heapsort, Quicksort, Radix Sort, Mergesort. Searching techniques: Elementary searching methods: Binary search, Hashing. Graph algorithms: Traversal algorithms, Greedy algorithms for Shortest Path & Minimum Spanning tress. Backtracking algorithms: N-Queens, Maze search. String matching algorithms. Dynamic programming. Introduction to NP-Completeness.
| AUs | 4.0 AUs |
| Grade Type | |
| Prerequisite | CSC105, CSC106, MAS111, MAS214, MTH111, MTH116 |
| Not Available To Programme | |
| Not Available To All Programme With | (Admyr 2011-onwards) |
| Not Available As BDE/UE To Programme | ACBS, ACC, ADM, AERO, ASEC, BCE, BEEC, BIE, BMS, BS, BUS, CBE, CBEC, CE, CEE, CEEC, CHEM, CHIN, CS, CSEC, CVEC, ECON, EEE, EEEC, ELH, ENE, ENEC, ENG, IEEC, IEM, LMS, MAT, MATH, ME, ME(DES), ME(MEC), MEEC, MS, MTEC, PHSC, PHY, PSY, SOC |
| Not Available As Core To Programme | |
| Not Available As PE To Programme | |
| Mutually Exclusive With | CE2001, CZ2001, SC203 |
| Not Offered As BDE | Yes |
| 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 Relevant Mods
CS0201
Foundations Of Communication Studies
CS0204
Basic Media Writing
CS0900
Communication Strategies For Sustainability & Social Change
CS2005
Speech And Argumentation
CS2006
Visual Literacy And Communication
CS2007
Communication History And Theories
CS2021
News Reporting And Writing
CS2023
Print & Digital Publications
CS2024
Web Design And Technologies