MA615 Programming and Data Structures [3-0-2-8] Prerequisite: Nil
Programming and Data Structures and Algorithms Flowcharts, C Programming: basic features, arrays and pointers, recursion, records (structures), memory management, files, input/output, Asymptotic complexity, heap sort, quick sort, sorting in linear time, elementary data structures, hash tables, binary search trees, Red-Black trees.
Texts/References: