Shri Vaishnav Vidyapeeth Vishwavidyalaya

Shri Vaishnav Institute Of Information Technology

Choice Based Credit System (CBCS) in the light of NEP-2020
B.Tech/B.Tech+MBA(CSE) and B.Tech+M.Tech(CSE/CSE-CC/CSE-CF/CSE-BDA)
SEMESTER-II (2021-2025)
TEACHING & EVALUATION SCHEME

CREDITS
THEORY PRACTICAL

Assessment

Assessment
END SEM

END SEM
University
University

Two Term

Teachers

Teachers
COURSE CODE CATEGORY COURSE NAME L T P

Exam

Exam
Exam

*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.

Course Educational Objectives (CEOs):

1. To understand efficient storage mechanisms of data for an easy access.
2. To design and implementation of various basic and advanced data structures.
3. To introduce various techniques for representation of the data in the real world.
4. To develop application using data structures.
5. To understand the concept of protection and management of data.

Course Outcomes (COs):

After completion of this course the students are expected to be able to demonstrate following
knowledge, skills and attitudes.
The students will be able to
1. Get a good understanding of applications of Data Structures.
2. Develop application using data structures.
3. Handle operations like searching, insertion, deletion, traversing mechanism etc.on
various data structures.
4. Decide the appropriate data type and data structure for a given problem.
5. Select the best algorithm to solve a problem by considering various problem
characteristics, such as the data size, the type of operations, etc.

Syllabus:

UNIT I 10HRS
Introduction: Overview of Data structures, Types of data structures, Primitive and Non
Primitive data structures and Operations, Introduction to Algorithms & complexity
notations. Characteristic of Array, One Dimensional Array, Operation with Array, Two
Dimensional Arrays, Three or Multi-Dimensional Arrays, Sparse matrix, Drawbacks of
linear arrays. Strings, Array of Structures, Pointer and one dimensional Arrays, Pointers and
Two Dimensional Arrays, Pointers and Strings, Pointer and Structure.

Chairperson Chairperson Controller of Examination Joint Registrar

Board of Studies Faculty of Studies Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth
Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore Vishwavidyalaya, Indore
Vishwavidyalaya, Indore Vishwavidyalaya, Indore
 Shri Vaishnav Vidyapeeth Vishwavidyalaya
Shri Vaishnav Institute Of Information Technology
Choice Based Credit System (CBCS) in the light of NEP-2020
B.Tech/B.Tech+MBA(CSE) and B.Tech+M.Tech(CSE/CSE-CC/CSE-CF/CSE-BDA)
SEMESTER-II (2021-2025)

TEACHING & EVALUATION SCHEME

CREDITS
THEORY PRACTICAL

Assessment

Assessment
END SEM

END SEM
University

University
Two Term

Teachers

Teachers
COURSE CODE CATEGORY COURSE NAME L T P

Exam

Exam
Exam

*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.

UNIT II 9HRS
Linked List: Linked List as an ADT, Linked List Vs. Arrays, Dynamic Memory Allocation &
De-allocation for a Linked List, Types of Linked List: Circular & Doubly Linked List. Linked

List operations: All possible insertions and deletion operations on all types of Linked list
Reverse a Single Linked List; Divide a singly linked list into two equal halves, Application of
Linked List.

UNIT III 8HRS

Stack: The Stack as an ADT, Stack operation, Array Representation of Stack, Link
Representation of Stack, Application of stack – Recursion, Polish Notation . Types of
Recursion, problem based on Recursion: Tower of Hanoi
The Queue :The Queue as an ADT, Queue operation, Array Representation of Queue, Linked
Representation of Queue, Types of Queue :Circular Queue & Dequeue, Introduction of
Priority Queue, Application of Queues.

UNIT IV 7HRS
Tree: Definitions and Concepts of Binary trees, Types of Binary Tree, Representation of
Binary tree: Array & Linked List. General tree, forest, Expression Tree. Forest and general
tree to binary tree conversion. Binary Search Tree Creation, Operations on Binary Search
Trees: insertion, deletion & Search an element, Traversals on Binary SEARCH TREE and
algorithms. Height balanced Tree: AVL, B-Tree, 2-3 Tree, B+Tree: Creation, Insertion &
Deletion.
Graph: Definitions and Concepts Graph Representations: Adjacency MATRIX, Incidence
matrix, Graph TRAVERSAL (DFS & BFS), Spanning Tree and Minimum Cost Spanning
Tree: Prim‟s & Kruskal‟s Algorithm.

UNIT V 8HRS
Sortings: Sorting Concept and types of Sorting, Stable & Unstable sorting. Concept of
Insertion Sort, Selection sort, Bubble sort, Quick Sort, Merge Sort, Heap & Heap Sort, Shell
Sort & Radix sort. Algorithms and performance of Insertion, selection, bubble, Quick sort
& Merge sort.

Chairperson Chairperson Controller of Examination Joint Registrar

Board of Studies Faculty of Studies Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth
Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore Vishwavidyalaya, Indore
Vishwavidyalaya, Indore Vishwavidyalaya, Indore
 Shri Vaishnav Vidyapeeth Vishwavidyalaya
Shri Vaishnav Institute Of Information Technology
Choice Based Credit System (CBCS) in the light of NEP-2020
B.Tech/B.Tech+MBA(CSE) and B.Tech+M.Tech(CSE/CSE-CC/CSE-CF/CSE-BDA)
SEMESTER-II (2021-2025)
TEACHING & EVALUATION SCHEME

CREDITS
THEORY PRACTICAL

Assessment

Assessment
END SEM

END SEM
University

University
Two Term

Teachers

Teachers
COURSE CODE CATEGORY COURSE NAME L T P

Exam

Exam
Exam

*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.

Text Books:
1. Ashok N. Kamthane, “Introduction to Data structures”, 2nd Edition, Pearson Education
India, 2011.
2. Tremblay & Sorenson, “Introduction to Data- Structure with applications”, 8th Edition, Tata
McGrawHill, 2011.
3. Bhagat Singh & Thomas Naps, “Introduction to Data structure”, 2nd Edition, Tata Mc-
GrawHill 2009.
4. Robert Kruse, “Data Structures and Program Design”, 2nd Edition, PHI, 1997.
5. Lipschutz Seymour,”Data structures with C” ,1st Edition ,Mc- GrawHill,2017.

References:
1. Rajesh K. Shukla, Data Structures Using C & C++, Wiley-India 2016.
2. ISRD Group, Data Structures Using C, TataMcGraw-Hill 2015.
3. E. Balagurusamy,”Data Structure Using C”, Tata McGraw-Hill 2017.
4. Prof. P.S. Deshpande, Prof. O.G. Kakde, C & Data Structures, Charles River Media 2015.
5. Gav Pai, Data Structures, Tata McGraw-Hill, 2015.

List of Practical:
1. To develop a program to find an average of an array using AVG function.
2. To implement a program that can insert, delete and edit an element in array.
3. To implement an algorithm for insert and delete operations of circular queue and
implement the same using array.
4. Write a menu driven program to implement the push, pop and display option of the stack
with the help of static memory allocation.
5. Write a menu driven program to implement the push, pop and display option of the stack
with the help of dynamic memory allocation.
6. Write a menu driven program to implementing the various operations on a linear queue
with the help of static memory allocation.
7. Write a menu driven program to implementing the various operations on a linear queue
with the help of dynamic memory allocation.
8. Write a menu driven program to implement various operations on a linear linked list.
9. Write a menu driven program to implement various operations on a circular linked list
10. Write a program for implementation of Bubble sort
11. Write a program for Insertion sort

Chairperson Chairperson Controller of Examination Joint Registrar

Board of Studies Faculty of Studies Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth
Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore Vishwavidyalaya, Indore
Vishwavidyalaya, Indore Vishwavidyalaya, Indore
 Shri Vaishnav Vidyapeeth Vishwavidyalaya
Shri Vaishnav Institute Of Information Technology
Choice Based Credit System (CBCS) in the light of NEP-2020
B.Tech/B.Tech+MBA(CSE) and B.Tech+M.Tech(CSE/CSE-CC/CSE-CF/CSE-BDA)
SEMESTER-II (2021-2025)
TEACHING & EVALUATION SCHEME

CREDITS
THEORY PRACTICAL

Assessment

Assessment
END SEM

END SEM
University

University
Two Term

Teachers

Teachers
COURSE CODE CATEGORY COURSE NAME L T P

Exam

Exam
Exam

*
Data Structure
BTCS201N DCC 60 20 20 30 20
and Algorithms 3 1 2 5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.

12. Write a program for Merge Sort

13. Write a program to implement Heap sort
14. Write a program to implement Quick sort
15. Write a program to Construct a Binary Search Tree and perform deletion, inorder
traversal on it
16. Write a program to develop an algorithm for binary tree operations and implement the
same.
17. Write a program to design an algorithm for sequential search, implement and test it.
18. Write a program to develop an algorithm for binary search and perform the same.

Chairperson Chairperson Controller of Examination Joint Registrar

Board of Studies Faculty of Studies Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth
Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore Vishwavidyalaya, Indore
Vishwavidyalaya, Indore Vishwavidyalaya, Indore