Data Structures and Algorithms
Course Name:
Data Structures and Algorithms (CS202)
Programme:
B.Tech (CSE)
Semester:
Third
Category:
Engineering Science Core (ESC)
Credits (L-T-P):
04 (3-1-0)
Content:
Introduction to basic data structures and algorithms, Dynamic memory allocation, Algorithm analysis and design techniques. Classical Searching & Sorting Algorithms, Linked List and its applications, Stacks and Queues. Recursion and evaluation of arithmetic expressions. Introduction to Tree: Tree Traversals, Binary Search Trees, AVL Tree, Priority queues and Binary Heaps, Introduction to Graphs: Graph representations, Graph Traversals, Shortest path algorithms, Topological sort, Minimum spanning Trees, Graph applications, Hashing.
References:
Alfred V Aho, John E Hoperoft, Jeffrey D Ullman, “Data Structures and Algorithms”, Addison Wesley, 2003.
Horowitz and Sahni, “Fundamentals of Data Structures and Algorithms in C++”, Universities Press, 2007
Clifford A Shaffer, A Practical Introduction to Data Structures and Algorithms, Prentice Hall International, 1997.
Willam K Pratt, Digital Image Processing, Wiley-Interscience Publication, Third Edition, 2001
Mark Allen Weiss, Algorithms Datastructures and problem solving with C++, Addison Wesley,
1996 J Kleinberg, E Tardos, “Algorithm Design”, Addison-Wesley, 2005.
Jean Paul Trembley and Paul G Sorenson, "An Introduction to Data Structures with Applications", Tata McGraw
Hill, 2001.
Department:
Computer Science and Engineering