CO322 Data Structures and Algorithms
Course Code
CO322
Course Title
Data Structures and Algorithms
Credits
3
Course Type
CORE
Prerequisites
Textbooks and References
- Cormen, Rivest, Introduction to Algorithms
- Aho, Hopcroft and Ullman, Data structures and algorithms
- Sedgewick and Wayne, Algorithms
- CO322 Syllabus; https://drive.google.com/open?id=195_ITaRnKvyU_tFimv8xo4gH-gwonesi
| Topic | Time Allocated / hours | |||
|---|---|---|---|---|
| L | T | P | A | |
|
Running time and time complexity |
- | - | - | - |
|
Divide and conquer |
- | - | - | - |
|
Linear abstract data types |
- | - | - | - |
|
Hashing and the set ADT |
- | - | - | - |
|
Trees |
- | - | - | - |
|
Graphs |
- | - | - | - |
|
Greedy algorithms |
- | - | - | - |
|
Dynamic programming |
- | - | - | - |
|
Total (hours) |
30 | - | 18 | 12 |
L = Lectures, T = Tutorial classes, P = Practical classes, A = Homework Assignments
| Assessment | Percentage Marks |
|---|---|
| Practicals | 20 |
| Assignments | 20 |
| Mid-Exam | 20 |
| End-Exam | 40 |
Last Update: 03/02/2024
|
Edit this page