Data Structures and Algorithm Syllabus
Data Structures and Algorithm Syllabus
Course Outcome:
After Completion of the Course, Student will able to:
N RBT Level
Course Outcomes
o
01 Differentiate primitive and non-primitive structures. R
02 Design and apply appropriate data structures for solving computing problems. A
03 Apply sorting and searching algorithms to the small and large data sets. E
Explain the major graph algorithms and their analyses. Employ graphs to model N
04
data science problems wherever appropriate.
*Revised Bloom’s Taxonomy (RBT)
1. Fundamentals of Data Structures in C++ by Sartaj Sahani Galgotia Publications Pvt. Ltd.,
2009
2. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest and Clifford Stein PHI, Second edition
3. Fundamental of Algorithms by Gills Brassard, Paul Bratley PHI
4. Fundamentals of Computer Algorithms by Horowitz, Sahni Galgotia Publications Pvt.
Ltd., 2001 ed.
5. An Introduction to Data Structures with Applications by Jean-Paul Tremblay & Paul G.
Sorenson Publisher-Tata McGraw Hill
1. Implement a program for stack that performs following operations using array.
(a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY
2. Implement a program to convert infix notation to postfix notation using stack
3. Write a program to implement QUEUE using arrays that performs following
operations (a) INSERT (b) DELETE (c) DISPLAY
4. Write a program to implement Circular Queue using arrays that performs following
operations. (a) INSERT (b) DELETE (c) DISPLAY
*******