IT200

Course Name: 

Data Structures and Algorithms(IT200)

Programme: 

B.Tech (IT)

Semester: 

Third

Category: 

Programme Core (PC)

Credits (L-T-P): 

(3-1-0) 4

Content: 

Simple Data types and data structures, Concepts of complexity analyses, worst, best and amortized analyses, Linked lists, stacks, queues, arrays; Concepts of Priority Queues, Hash Tables, Sorting, Search Trees, Graphs; Algorithms design concepts like Divide & Conquer, Dynamic Programming and Greedy.

References: 

Aho, Ullman and Hopcroft – Data Structures and Algorithms, Addison Wesley
Mark Allen Weiss, Algorithms, Data Structures and Problem solving with C++, Addison Wesley
T.H Cormen, C.E. leiserson and R.L Rivest - Introduction to Algorithms – The MIT Press, Cambridge, Massachusetts, USA, 1990.

Department: 

Information Technology
 

Contact us

G. Ram Mohana Reddy

Professor and Head,
Department of Information Technology, NITK, Surathkal,
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.
Ph.:    +91-824-2474056
Email:  infotech[AT]nitk[DOT]ac[DOT]in
            infotech[AT]nitk[DOT]edu[DOT]in

Sowmya Kamath S (Web Admin)

Connect with us

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