Data Structures for Advanced Applications

Course Name: 

Data Structures for Advanced Applications(CS314)

Programme: 

B.Tech (CSE)

Semester: 

Sixth

Category: 

Programme Specific Electives (PSE)

Credits (L-T-P): 

04(3-1-0)

Content: 

Introduction to Advanced Data structures, Introduction to Applications, Applications of Trees, Heaps, Advanced
graph algorithms and applications, Internet Algorithms and its applications,
Compression algorithms, Advanced Search engine Applications, Spiders and crawlers, Integer and polynomial
arithmetic, Modular arithmetic, NP-Completeness and approximation algorithms.

References: 

Thomas Cormen, Charles E Leiserson and Ronald D River, Introduction to Algorithms, PHI, 2001.
Mark Allen Weiss, Algorithms, Data Structures and Problem Solving with C++, Addison Wesley, 2002.
Fundamentals of data structures in C++, by E. Horowitz, S. Sahni, and D. Mehta, Second Edition, Silicon Press, 2007
 

Contact us

Dr. Manu Basavaraju
Head of the Department
Department of CSE, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.
Hot line: +91-0824-2474053
Email: hodcse[AT]nitk[DOT]ac[DOT]in
            hodcse[AT]nitk[DOT]edu[DOT]in

                      

Connect with us

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