Data Structures and Algorithms(CMA701)

Course Name: 

Data Structures and Algorithms

Programme: 

M.Tech (CMA)

Semester: 

First

Category: 

Programme Core (PC)

Credits (L-T-P): 

(3-0-2)4

Content: 

Abstract data structures and their implementations: arrays, list, stack, queue. Tree data structures: Binary trees, Height balanced trees, priority queues, Tree traversal algorithms. Dynamic Data structures: 2-3 trees, Red-black trees, binary heaps, binomial and Fibonacci heaps, Skip lists, universal hashing. Graphs and algorithms: Breadth first search and Depth First Search, Shortest paths, minimum spanning trees. Introduction to analysis of algorithms: Big Oh, Omega and Theta notations. Basic algorithm design techniques: Dynamic programming and divide-and- conquer, Sorting algorithms with analysis

References: 

T.H Cormen, C.E Leiserson, R.L. Rivest, C. Stein, Introduction to algorithms, Third edition, PHI, 2009.
Algorithm Design, Michael T. Goodrich, Robert Tamassia, John Wiley& Sons, 2006
Ellis Horowitz, Sartaz Sahni, S. Rajasekaran, Fundamentals of computer Algorithms, Second edition, University Press (India) Limited, 2008.

Department: 

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.