Академический Документы
Профессиональный Документы
Культура Документы
Module No. Subtitle of the Module Topics in the module No. of Lectures
for the module
Recommended Reading material: Author(s), Title, Edition, Publisher, Year of Publication etc. ( Text books,
Reference Books, Journals, Reports, Websites etc. in the IEEE format)
1 Yedidyah Langsam, Moshe J., Augenstein and Aaron M. Tenenbaum: Data Structures Using C and C++,
JIIT, Noida
2nd Edition, PHI, 2001
3 Dinesh P Mehta, Sartaj Sahani: Handbook of Data Structure and Applications, Chapman & Hall, 2004
4 Mark Allen Weiss: Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson
5 Sahni: Data Structures, Algorithms and applications in C++, Universities press, Hyderabad, 2005
6 Kruse, Tonso, Leung: Data Structures and Program Design in C, 2rd Edition, Pearson Education Asia, 2002
7 Weiss, Mark Allen: Data Structures and Algorithm Analysis in C/C++, 2nd Edition, Pearson
Education Asia, 2003
8 Cormen et al: Introduction to Computer Algorithms, 2nd edition , PHI New Delhi 2003
9 Aho, Hopcraft, Ullman: Data Structures and Algorithms, Pearson Education Asia (Adisson Wesley), New
Delhi, 2001
10 Standish: Data Structures in Java, Pearson Education Asia (Adisson Wesley), New Delhi, 2000
11 Knuth: The Art of Computer programming Vol I, Vol III, 2nd edition , Pearson Education Asia (Adisson
Wesley), New Delhi, 2002
12 Heileman: Data Structures, Algorithms and Object Oriented Programming, Tata Mc-Graw Hill, New
Delhi, 2002
13 Sorenson and Tremblay: An Introduction to Data Structures with Algorithms, 2nd Edition, Tata Mc-Graw
Hill, New Delhi, 2003
JIIT, Noida
EVEN Semester 2018
Subject: Data Structures & Algorithms Code: 15B11CI518/15B17CI578
Course Objectives:
The course aims to offer a comprehensive insight to data structures and algorithms facilitating students
to understand concepts and trends in this field.
Learning Outcome:
On successful completion of this course, the students will be able to
1) Explain the fundamental Data Structures including linked-lists, trees, binary search trees, AVL
trees, heap trees, graphs, and hash-tables.
2) Implement abstract data types (stack, queue, graph etc.) using basic data structures and their
functionalities.
3) Analyze the algorithms in terms of asymptotic time complexity
4) Evaluate different sorting algorithms - Merge Sort, Quick sort, Shell sort and Bucket Sort.
5) Develop small scale programs with data structures and algorithms in various practical problems
6) Formulate new solutions for programming problems or improve existing code using learned
algorithms and data structures
7) Develop new and efficient data structures for different kind of problems according to the
requirements.
JIIT, Noida