New: filter modules by day and time, student links, custom courses →
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 |
| Exam |
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 930 | |||||
| 1000 | |||||
| 1030 | |||||
| 1100 | |||||
| 1130 | |||||
| 1200 | |||||
| 1230 | |||||
| 1300 | |||||
| 1330 | |||||
| 1400 | |||||
| 1430 | |||||
| 1500 | |||||
| 1530 | |||||
| 1600 | |||||
| 1630 | |||||
| 1700 | |||||
| 1730 | |||||
| 1800 |
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
| Mon | Tue | Wed | Thu | Fri | ||
|---|---|---|---|---|---|---|
| 830 | COMMON LEC (CS2) 0830-0930 Tue LT2A, LT19A Wk1, Teaching Wk2-13 | COMMON LEC (CS2) 0830-0930 Tue LT2A, LT19A Wk1, Teaching Wk2-13 | 10490 LAB (SSA1) 0830-1030 Wed SWLAB3 Odd Weeks | |||
| 900 | ||||||
| 930 | ||||||
| 1000 | ||||||
| 1030 | COMMON LEC (CS2) 1030-1130 Fri LT2A | |||||
| 1100 | ||||||
