Data Structures & Algorithms (MCA605)

Course Name: 

Data Structures & Algorithms






Programme Core (PC)

Credits (L-T-P): 

(4-0-0) 4


Introduction to analysis of algorithms: asymptotic notations, big-oh, big-omega, theta, small-oh, small-omega notations, worst-case and average-case analysis, solving recurrences. Abstract data types, Linear Data Structures and their sequential storage representation: stacks, queues, priority queues, and their applications. Pointers and linked storage representation: singly linked list, circular linked list, doubly linked lists and their application, skip lists. Nonlinear data structures: trees, storage representations of binary trees, operations on binary trees: tree traversals, insertion, deletion, searching, trees, applications of trees, AVL trees. Graphs: representations of graphs, breadth first search and depth first search, shortest paths problem, minimum cost spanning trees, applications of graphs. Sorting: selection sort, bubble sort, insertion sort, merge sort, heap sort, quick sort, radix sort. Searching: sequential search, binary search, search trees, hash tables


T.H. Cormen, C.E. Leiserson, R.L. Riverst, C.Stein, Introduction to Algorithms, Prentice -Hall of India, 2003
A.V. Aho, J.E. Hopcraft and J.D. Ullman, Data Structures and Algoriths, Pearson Education, 2003
J.P. Tremblay and P.G. Sorenson, An Introduction to Data Structures with Application. Tata McGraw-Hill 1991.


Mathematical and Computational Sciences

Contact us

B R Shankar, Associate Professor and Head
Department of MACS, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.

  • Hot line: +91-0824-2474048

Connect with us

We're on Social Networks. Follow us & get in touch.