- Analyse the
performance of the algorithm and represent it using asymptotic notations.
- Solve real world
problem using appropriate data structures among arrays, linked list, stack and
- Design algorithms for various application using nonlinear data structures trees and graphs
- Compare Searching (Linear search & Binary search) and Sorting ( Bubble sort, Selection Sort, Insertion
sort, Merge sort, Quick sort and Heap sort ) Techniques.
- Compare different memory management techniques and
various hashing techniques.
- Teacher: subu surendran