BMI203

Data Structure

L-T-P3-1-0 Credits4 Session2024-25 TypeTheory
Appears in 1 semester

MCA Integrated · Sem 2 (Core)

Syllabus

5 units · 40 lecture hours
Unit1

Unit 1: Introduction

8 hrs

Basic Terminology, Elementary Data Organization, Data Structure operations, Algorithm Complexity and Time-Space trade-off Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, Character String in C, Character string operation, Ordered List, Sparse Matrices, and Vectors. Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Applications of stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using stack. Recursion: Recursive definition and processes, Tower of Hanoi Problem, tail recursion, removal of recursion.

Unit2

Unit 2: Queues

8 hrs

Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty. Circular queue, Deque, and Priority Queue, Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists, Insertion and deletion Algorithms, doubly linked list, Linked List in Array, Polynomial representation and addition, Generalized linked list.

Unit3

Unit 3: Trees

8 hrs

Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree. Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees. Traversing Threaded Binary trees, Huffman algorithm. Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.

Unit4

Unit 4: Sorting

8 hrs

Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on Different Keys. Binary Search Tree (BST): Introduction, Insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, AVL Trees, B-trees.

Unit5

Unit 5: Graphs

8 hrs

Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees. File Structures: Physical Storage Media File Organization, Organization of records into Blocks, Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, Indexing and Hashing Comparisons.

Course Outcomes (COs)5 outcomes

After completion of the course student will be able to:

  1. CO1Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by the algorithms and their common applications.K1, K2
  2. CO2Discuss the computational efficiency of the sorting and searching algorithms.K2
  3. CO3Implementation of Trees and Graphs and perform various operations on these data structure.K3
  4. CO4Understanding the concept of recursion, application of recursion and its implementation and removal of recursion.K4
  5. CO5Identify the alternative implementations of data structures with respect to its performance to solve a real world problem.K5, K6

Suggested Readings

  1. Langsam Y., Augenstin M. and Tannenbaum A., “Data Structures using C and C++”, Pearson Education Asia.
  2. Horowitz E., Sahni S. and Mehta D., “Fundamentals of Data Structures in C++”, Golgotha Book Source, New Delhi.
  3. Lipchitz S., “Data Structures”, Mc-Graw Hill International.
  4. Goyal K. K., Sharma Sandeep & Gupta Atul, “Data Structures and Analysis of Algorithms”, HP Hamilton.
  5. Tremblay J.P., Sores P.G., “An Introduction to Data Structures with Applications”, Tata Mc-Graw Hill International.
  6. Salaria R.S., “Data Structures”, Khanna Publishing House
  7. Berman A.M., “Data structures via C++”, Oxford University Press.
  8. Weiss W., “Data Structures and Algorithm Analysis in C++”, Pearson Education.
  9. Patel R.B., “Expert Data Structures with C”, Khanna Publishing House.

Official AKTU syllabus

This subject is on page 13, 14 of the original AKTU PDF.

Official AKTU syllabus PDF ↗