|
| Course Content |
Time Allocated |
| L |
T |
P |
A |
Efficiency of Algorithms
- Asympotic notation, Average and worst case analysis
|
2 |
|
|
|
Analysis of Algorithms
- Control structures, Recursion
|
3 |
1 |
|
|
Data Structures
- Arrays, stacks, queues, records, pointers, lists, graphs, trees, heaps
|
4 |
1 |
|
|
Greedy Algorithms
- Devide and conquer, Dynamic programing, Huffman codes
|
5 |
2 |
|
|
Searching and Sorting Algorithms
- Various types of searching and sorting algorithms
|
6 |
2 |
|
|
Computational Complexity
- Polynomial and exponential times, NP-completeness
|
2 |
|
|
|
Applications
- Selected applications from Engineering and Computer Science
|
2 |
|
|
|
| Total = 24 + 6 = 30 |
24 |
6 |
|
|
| |
| Assessment |
Percentage Mark |
| Continuous Assessment |
|
100 |
| Assignment |
40 |
|
| Course work |
60 |
|
| Written Examinations |
|
|
| Mid-Semester |
|
|
| End of Semester |
|
|
|
Notation Used :
L - Lectures
T - Tutorials
P - Practical works
A - Assignments |