Subject Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total

Code Name Hrs Hrs Hrs Credit Credit Credits Credits

Data
FYC202 Structures 03 - - 03 03

Examination Scheme
Term Practical
Theory Marks Oral Total
Subject Work & Oral
Subject Name In-Sem Evaluations
Code End
Avg. Mid Sem
IA1 IA2 of 2 Sem
Exam
IAs Exam
Data
FYC202 20 20 20 20 60 -- -- -- 100
Structures

Course Objectives:

1. To design and implement various data structures.

2. To introduce various techniques for representation of data in the real world.
3. To teach various searching and hashing techniques.
4. To solve problems using linear and nonlinear data structures.

Course Outcomes: At the end of the course learner will able to

1. Differentiate primitive and non-primitive structures.
2. Handle operations like insertion, deletion, searching and traversing on various linear
data structures.
3. Handle operations like insertion, deletion, searching and traversing on various non-
linear data structures.
4. Apply learned concepts in various domains like DBMS, Compiler Construction
5. Demonstrate knowledge of various searching techniques.
6. Apply appropriate data structure for solving real world problem.

Prerequisites:
Programming in C
 CO
Sr. No. Module Detailed Content Hours
Mapping

Introduction to Introduction, Classification of Data Structures,

1 Operations on Data Structures, Concept of ADT, 02 CO1
Data Structures
Arrays, Recursion

Stack and Stack: ADT, Representation, Operations, Applications CO2,

of Stack. ADT of Queue, Representation of Queue,
2 Queues 06 CO4,
Operations on Queue, Circular Queue, Priority Queue,
CO6
Applications of Queue.

Linked List ADT of Linked List, Representation of Linked List, CO2,

3 Linked List v/s Array, Circular Linked List, Doubly 07 CO4,
Linked List Applications of Linked List. CO6
Introduction, Binary Tree, Representation of Binary
Trees CO3,
Trees, Types of Binary Tree, Binary Tree Traversals,
4 10 CO4,
Binary Search Tree, Applications – Expression Tree,
CO6
Huffman Encoding. B/B+ Tree, AVL Tree,

Graphs Introduction, Representation of Graph, Graph CO3,

5 Traversals – Depth First Search (DFS) and Breadth 07 CO4,
First Search (BFS), Applications- social networking CO6
Searching Linear Search, Binary Search, Hashing – Hash Tables,
6 07 CO5
techniques Hash Functions, Collision Resolution.

Text Books: -
1. Data Structures using C, Reema Thareja, Oxford
2. Data Structures Using C, Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein,
Pearson

Reference Books:
1. Data Structures and Program Design by Kruse et. al., PHI
2. Data Structure Using C, Balagurusamy.

Evaluation Scheme:
1 In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.
2 End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
Subject Subject Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Code Name Hrs Hrs Hrs Credit Credit Credits Credits
Data
structures
FYL202 02 -- -- 01 -- 01
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Work & Oral
Subject Subject
In-Sem Evaluations
Code Name End
Avg. Mid
Sem Sem
IA1 IA2 of 2
Exa Exam
IAs
m
Data
FYL202 structures -- -- -- -- 25 25 -- 50
--
Lab

Course Objectives:

1. To implement linear and non-linear data structures.

2. To solve problem involving stacks, queues, linked list, graphs and trees
3. To implement various sorting and searching techniques
4. To use appropriate data structures for real world applications.

Course Outcomes: At the end of the course learner will able to

1. To differentiate primitive and non-primitive structures.

2. To implement operations like insertion, deletion, searching and traversing on various
linear data structures.
3. To implement operations like insertion, deletion, searching and traversing on various
non- linear data structures.
4. To apply learned concepts in various domains like DBMS, Compiler Construction etc.
5. To demonstrate knowledge of various sorting and searching techniques.
6. To apply appropriate data structure for solving real world problem.

Prerequisites:
Programming in C

Suggested Experiments:
 Experiment Experiments Name CO Mapping
No.
1 Implementation of recursion function to solve tower CO1
of Hanoi Puzzle
2 Implementation of Stack using arrays CO2
3 Implementation of INFIX to POSTFIX CO4
transformation
4 Evaluation of Postfix Expression CO4
5 Implementation of Queue using arrays CO2
6 Implementation of Circular Queue CO2
7 Implementation of Priority Queue CO2
8 Implementation of Singly Linked List CO2
9 Implementation of Doubly Linked List CO2
10 Implementation of Binary Search Tree CO3
11 Implementation of Breadth First Search/Depth First CO3
Search
12 Implementation of Binary Search Technique CO5
13 Case Study-Identify best suited data structures for CO6
solving real world problem.

Text Books:

1. Data Structures using C, Reema Thareja, Oxford

1. Data Structures Using C, Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein,
Pearson

Reference Books:

1. Data Structures and Program Design by Kruse et. al., PHI

2. Data Structure Using C, Balagurusamy.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical examination along with oral evaluation based on
the laboratory work and the corresponding theory syllabus.