1. http://nptel.ac.

in/courses/106106094/

COURSE
DATA STRUCTURES CREDITS 4
TITLE

COURSE ECS51004 COURSE

PC L-T-P-S 3- 0- 2- 2
CODE CATEGORY

APPROVAL LEARNING
VERSION 1.0 BTL-3
DETAILS LEVEL

ASSESSMENT SCHEME

CIA ESE

Observation /
lab records as
First Second approved by
Periodical Periodical Practical the
Attendance* Theory Practical
Assessment Assessment Assessments Department
(Theory) (Theory) Examination
Committee
“DEC”

15% 15% 10% 5% 5% 25% 25%

This is a course suitable for B. Tech students. It deals with basic data structures, arrays, heaps etc. This
Course
course develops the knowledge in the graphs, algorithm, creation, deletion, insertion. Also gives an
Description
idea about developing the projects in the data structures.

1. To develop the knowledge in the basic designing of algorithms

2. To apply the concept of algorithms for the creation, insertion, deletion, searching, and sorting of
Course each data structure.
Objective 3. To learn the concept of Sort, arrays, linked lists etc.
4. To define the idea of graphs and its traversal.
5. To develop the implementation knowledge in the projects.

Upon completion of this course, the students will be able to

1. Compute and analyse the algorithms for efficiency using Asymptotic Notations.
2. Develop knowledge of basic data structures such as arrays, linked lists, binary trees, heaps, and
Course hash tables for storage and retrieval of ordered or unordered data.
Outcome 3. Solve problems by applying suitable data structures with the algorithms for the creation, insertion,
deletion, searching, and sorting of each data structure.
4. Define graphs and illustrate graph traversals.
5. Design and develop projects requiring the implementation of the data structures.

Prerequisites: C Programming Language

CO, PO AND PSO MAPPING

 PO - PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
CO PSO-1 PSO-2 PSO-3
1 2 3 4 5 6 7 8 9 10 11 12

CO-1 3 3 1 - 2 - - - 3 2 - 2 1 1 1

CO-2 3 3 1 - 2 - - - 3 2 - 2 1 1 1

CO-3 3 3 1 - 2 - - - 3 2 - 2 1 1 1

CO-4 3 3 1 - 2 - - - 3 2 - 2 1 1 1

CO-5 3 3 1 - 2 - - - 3 2 - 2 1 1 1

1: Weakly related, 2: Moderately related and 3: Strongly related

MODULE 1: LINEAR DATA STRUCTURES (9L+3P=12)

Introduction to Data Structures – Fundamental Elements – Asymptotic Notations: Big-

Oh, Omega and Theta – Best, Worst and Average case Analysis: Definition and an
example -Arrays and its representations – Stacks and Queues – Linked lists - Singly
Linked List - Doubly linked list - Linked list-based implementation of Stacks and Queues
– Evaluation of Expressions.

Lab Experiment: CO-1

1. Write a c program to implement the various operations of stack using BTL-2
Pointer/Array
2. Implement the functions of Queue
3. Develop the source code to implement the linked list operations
4. Write a c program to convert the infix expression to postfix expression
Software Required: GCC

MODULE 2: NON-LINEAR DATA STRUCTURES (9L+3P=12)

Trees: Introduction to Trees – Basic concepts - Binary Trees – Binary tree

representations (Array and list) and Traversals Techniques (Preorder, Inorder,
Postorder) – Binary Search Trees – AVL Trees – Splay Trees-Priority Queues – Heaps
implementations – Binary Heap.
CO-2
Lab Experiment:
BTL-2
1. Write a program to traverse the tree in inorder, preorder and post order.
2. Implement the Binary Search Tree to perform the various operations.
3. Write a Program to simulate the functions of Min heap/Max heap

Software Required: GCC

MODULE 3: GRAPHS (9L+3P=12)

Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation Of

Graphs, Elementary Graph operations, Traversal methods: Breadth First Search and
Depth First Search-Topological sort – Shortest path problems-Spanning Tree,
CO-3
Connected Components.
BTL-3
Lab Experiment:

1. Implement the BFS Traversing

2. Write a program to implement the DFS Traversing
 3. Develop the source code to find the shortest path in the given Graph

Software Required: GCC

MODULE 4: SORTING AND SEARCHING (9L+3P=12)

Sorting Algorithms: Basic concepts - Bubble Sort - Insertion Sort - Selection Sort -
Quick Sort – Shell sort - Heap Sort - Merge Sort - External Sorting.

Searching: Linear Search, Binary Search.

CO-4
Lab Experiment:
BTL-3
1. Write a program to implement the Bubble sort and Quick Sort
2. Implement Linear Search and Binary Search algorithms
Software Required: GCC
MODULE 5: INDEXING AND DISJOINT SETS (9L+3P=12)

Indexing: Hashing - Hash Functions – Separate Chaining – Open Addressing: Linear

Probing- Quadratic Probing- Double Hashing- Rehashing – Extendible Hashing.

Disjoint Sets: Basic data structure - Smart Union Algorithms - Path Compression.
CO-5
Lab Experiment:
BTL-3
1.Hash table implementation in c using arrays
2.Implement the various operations of Set

Software Required: GCC

TEXT BOOKS
1. Ellis Horowitz, S. Sahni, Freed. (2015). Fundamentals of Data Structures in C, 2nd edition.

2. D.S.Kushwaha and A.K.Misra(2022),”Data structures A Programming Approach with C”, PHI.

3. Puntambekar, A. A., and Dr. M. Sambath. Data Structures. First Edition: May 2023, Technical Publications.

REFERENCE BOOKS
Langsam, Y., Augenstein, M. J. And Tanenbaum A. M. (2004). Data Structures using C, Pearson Education
1.
Asia.
R.F.GilbergAndB.A.Forouzan (2022),”Data structures: A Pseudo code Approach with C”, 2nd edition,,
2
Cengage Learning.
3 M.A.Weiss(2022),”Data structures and Algorithm Analysis in C”, 2nd edition,, Pearson.
E BOOKS

1. https://www.cs.bham.ac.uk/~jxb/DSA/dsa.pdf

2. https://courses.csail.mit.edu/6.851/spring12/scribe/lec12.pdf
3. http://lib.mdp.ac.id/ebook/Karya%20Umum/Dsa.pdf
MOOC
1. https://www.mooc-list.com/tags/data-structures
2. https://nptel.ac.in/courses/106102064/
3. https://www.udemy.com/algorithm/