Gandhinagar Institute of Technology
B.Tech CE/IT/CSE/CS/AI
Semester 3
Subject Code: 10050301 Subject Title: Data Structures
Pre-requisite: Programming for Problem Solving
Course Objective:
1. To impart the basic concepts of data structures and algorithms
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and graphs
4. To understanding about writing algorithms and step by step approach in solving problems with the
help of fundamental data structures
5. Ability to sensibly select appropriate data structures and algorithms for problems and to justify that
choice.
Teaching Scheme (Hours per week) Evaluation Scheme (Marks)
Theory Practical
Lecture Tutorial Practical Credit University Continuous University Continuous Total
Assessment Assessment Assessment Assessment
3 0 2 4 70 30 30 20 150
Subject Contents
Total Weight
Sr. No Topic
Hours (%)
Introduction to Data Structure: Data Management concepts, Data types
– primitive and non-primitive, Performance Analysis and Measurement
1 (Time and space analysis of algorithms-Average, best and worst case 04 10
analysis), Types of Data Structures- Linear & Non Linear Data Structures.
NPTEL CH-1 RB-1 & TB-1
Linear Data Structures:
Array: Representation of arrays, Applications of arrays, sparse matrix and
its representation.
Stack: Stack-Definitions & Concepts, Operations On Stacks, Applications
2 of Stacks, Polish Expression, Reverse Polish Expression And Their 13 30
Compilation, Recursion, Tower of Hanoi.
Queue: Representation Of Queue, Operations On Queue, Circular Queue,
Priority Queue, Array representation of Priority Queue, Double Ended
Queue, Applications of Queue.
Linked List: Singly Linked List, Doubly Linked list, Circular linked list,
Linked implementation of Stack, Linked implementation of Queue,
Applications of linked list. NPTEL CH-4,5,6 RB-1 & TB-1
Nonlinear Data Structures :
Tree: Definitions and Concepts, Representation of binary tree, Binary tree
traversal (Inorder, postorder, preorder), Threaded binary tree, Binary
search trees, Conversion of General Trees To Binary Trees, Applications
3 Of Trees Some balanced tree mechanism, eg. AVL trees, 2-3 trees, Height 13 30
Balanced, Weight Balance.
Graph: Matrix Representation Of Graphs, Elementary Graph
operations,(Breadth First Search, Depth First Search, Spanning Trees,
Shortest path, Minimal spanning tree ). NPTEL CH-7,8 RB-1 & TB-1
Hashing and File Structure :
Hashing: The symbol table, Hashing Functions, Collision Resolution
Techniques,
4 File Structure: Concepts of fields, records and files, Sequential, Indexed 06 15
and Relative/Random File Organization, Indexing structure for index files,
hashing for direct files, Multi-Key file organization and access methods.
NPTEL CH-9 RB-1 & TB-1
Sorting and Searching: Bubble Sort, Selection Sort, Quick Sort, Merge
5 Sort, Heap Sort, Sequential Search, Binary Search. NPTEL CH-9 RB-1 & 06 15
TB-1
Course Outcome (COs):
1. Define and classify various data structures, storage structures and common operations on them.
2. Create various linear data structures with their representation and perform different operations on
them.
3. Create various nonlinear data structures with their representation and perform different operations
on them.
4. Apply various searching sorting techniques on data set.
5. Solve the given a problem using an appropriate data structure to achieve optimal performance and
compare its performance with other possible data structures
List of Text Books:
1. An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul G. Sorenson
Publisher-Tata McGraw Hill,6th Edition
List of Reference Books:
1. Data Structures using C & C++ 5th Edition -By Ten Baum Publisher – Prenctice-Hall International.
2. Fundamentals of Computer Algorithms 4th Edition by Horowitz, Sahni,Galgotiass
3. Data Structures: A Pseudo-code approach with C,4th Edition -By Gilberg & Forouzan
PublisherThomson Learning.
Open e-Resource:
1. https://nptel.ac.in/courses/106102064
2. https://www.tutorialspoint.com/data_structures_algorithms/index.htm
List of Suggested Experiments:
At least 10 practical should be performed by students using programming language.
1. Introduction to pointers. Call by Value and Call by reference.
2. Introduction to Dynamic Memory Allocation. DMA functions malloc(), calloc(), free() etc.
3. Implement a program for stack that performs following operations using array:
(a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY
4. Implement a program to convert infix notation to postfix notation using stack.
5. Write a program to implement QUEUE using arrays that performs following operations:
(a) INSERT (b) DELETE (c) DISPLAY
6. Write a program to implement Circular Queue using arrays that performs following operations:
(a) INSERT (b) DELETE (c) DISPLAY
7. Write a menu driven program to implement following operations on the singly linked list.
(a) Insert a node at the front of the linked list.
(b)Insert a node at the end of the linked list.
(c) Insert a node such that linked list is in ascending order.(according to info. Field)
(d)Delete a first node of the linked list.
(e) Delete a node before specified position.
(f) Delete a node after specified position.
8. Write a program to implement stack using linked list.
9. Write a program to implement a queue using linked list.
10.Write a program to implement following operations on the doubly linked list.
(a) Insert a node at the front of the linked list.
(b)Insert a node at the end of the linked list.
(c) Delete a last node of the linked list.
(d)Delete a node before specified position.
11.Write a program to implement following operations on the circular linked list.
(a) Insert a node at the end of the linked list.
(b)Insert a node before specified position.
(c) Delete a first node of the linked list.
(d)Delete a node after specified position.
12.Write a program which create binary search tree.
13.Implement recursive and non-recursive tree traversing methods inorder, preorder and postorder
traversal.
14.Write a program to implement Quick Sort, Merge Sort, Bubble Sort.
15.Write a program to implement Binary Search.
