Pandian Saraswathi Yadav Engineering College

DEPARTMENT OF COMPUTER SCIENCE

COURSE PLAN
Regulation –2021

Course/Branch : B.E / ECE Total no. of hours given in syllabus:45

Subject Code : CS 3351 Lecture : 3
Subject Title : DATA STRUCTURES Tutorials : 0
Year/Semester : II/III Practical : 0
Faculty Name : P ANUSHA DEVI TOTAL : 3

COURSE OBJECTIVE:
1.To understand the concepts of ADTs.
2. To Learn linear data structures – lists, stacks, and queues.
3. To understand non-linear data structures – trees and graphs.
4.To understand Multiway Search Trees and Graphs.
5. To apply Tree and Graph structures.
Text/ Teaching
S. No. of
Topic Reference Page Nos. Methodology
No. Hours
Books

UNIT I : LISTS
Objective: To impart the knowledge on the concepts of ADTs.
1 Abstract Data Types (ADTs) 1 R1 2.1 BB
2 List ADT 1 R1 2.1 BB

3 Array-based implementation 1 R1 2.2 BB

4 Linked list implementation 1 R1 2.2 BB

5 Singly linked lists 1 R1 2.2 BB

6 Circularly linked lists 1 R1 2.11 BB

7 Doubly-linked lists 1 R1 2.8 BB

8 Applications of lists , PolynomialADT 1 R1 2.12 BB

BB
9 Radix Sort ,Multilists. 1 R1 2.16-2.17
Subtotal Hours:9

Unit Outcome: Understand the basic concepts of ADTs.

 UNIT II : STACKS AND QUEUES

Objective: To impart the knowledge on the concepts of linear data structures – lists, stacks, and queues.

1 Stack ADT 1 R1 2.21 BB

2 Operations ,Applications 1 R1 2.22 BB

3 Balancing Symbols – 1 R1 2.32 BB

4 Evaluating arithmetic expressions- 1 R1 2.28 BB

5 Infix to Postfix conversion 1 R1 2.28 BB

6 Function Calls 1 R1 2.37 BB

7 Queue ADT,Operations 1 R1 2.37-2.38 BB

8 Circular Queue 1 R1 2.44 BB

9 DeQueue,Applications of Queues. 1 R1 2.43-2.46 BB

Subtotal Hours: 9
Unit Outcome: Understand the basic of linear data structures – lists, stacks, and queues.

Unit – III : TREES

Objective: To impart the knowledge on non-linear data structures – trees and graphs.
Tree ADT BB
1 1 R1 3.1

2 Tree Traversals 1 R1 3.23 BB

3 Binary Tree ADT 1 R1 3.2 BB,LCD

BB,LCD
4 Expression trees 1 R1 3.8

5 Binary Search Tree ADT 1 R1 3.10 BB,LCD

6 AVLTrees 1 R1 3.30 BB,LCD

7 Priority Queue(Heaps) 1 R1 3.65 BB,LCD

8 Priority Queue(Heaps) 1 R1 3.65 BB,LCD

9 Binary Heap. 1 R1 3.69 BB,LCD

Sub Total Hours:9
Unit Outcome: Gain knowledge on trees and graphs.
 Unit – IV : MULTIWAY SEARCH TREES AND GRAPHS
Objective: To impart the knowledge on Multiway Search Trees and Graph.
1 B-Tree 1 R1 3.58 BB,LCD

2 B+ Tree 1 R1 WR1 BB,LCD

Graph Definition ,Representation of BB,LCD
3 1 R1 7.1-7.4
Graphs
4 Types of Graph 1 R1 7.1 BB,LCD
Breadth-first BB, LCD
5 1 R1 7.10-WR2
traversal ,Depth-first traversal
6 Bi-connectivity –,Euler circuits 1 R1 7.45-7.50 BB, LCD

7 Topological Sort 1 R1 7.6 BB

Dijkstra's BB
8 1 R1 7.20-7.27
algorithm ,Minimum Spanning Tree
9 Prim's algorithm , Kruskal's algorithm 1 R1 7.28-7.36 BB,LCD

Subtotal Hours: 9
Unit Outcome: Gain knowledge on Trees and Graph.

Unit – V : SEARCHING, SORTING AND HASHING TECHNIQUES

Objective: To impart basic knowledge on Searching,Sorting and Hashing Technique

1 Searching 1 R1 WR3 BB

2 Linear Search, Binary Search 1 R1 WR3 BB

3 Sorting -Bubble sort 1 R1 6.1-WR4 BB

Selection sort ,Insertion BB,LCD
4 1 R1 WR4
sort
5 Shell sort ,Merge Sort 1 R1 6.3-6.17 BB,LCD

6 Hashing -Hash Functions 1 R1 4.1 BB

Separate Chaining , Open BB,LCD
7 1 R1 4.2-4.5
Addressing
8 Rehashing 1 R1 4.7 BB,LCD

9 Extendible Hashing. 1 R1 4.9 BB

Subtotal Hours : 9
Unit Outcome: Understand the basic concept of Searching,Sorting and Hashing Techniques.
Total Hours : 45

TEXT BOOKS:

1.Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson
Education, 2005.
2.Kam thane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007.
REFERENCES:

1. P.Revathy,S.Poonkuzhali,Dta Structures Revised Edition,Charulatha Publications,2011.

2. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition,
Pearson Education, 2015.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein,Introduction
to Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
4. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft,Data
Structures and Algorithms, 1st edition, Pearson, 2002.
5. Kruse, Data Structures and Program Design in C, 2nd Edition,
Pearson Education, 2006.
WEB REFERENCE:
1.https://www.sci.unich.it/~acciaro/bpiutrees.pdf
2.https://www.csc.lsu.edu/~kundu/dstr/2-depthFirst.pdf
3.https://www.srividyaengg.ac.in/coursematerial/ECE/106325.pdf
4.https://www.srividyaengg.ac.in/coursematerial/ECE/106325.pdf
Content beyond the Syllabus:
S.No TOPIC
1 To learn about the concepts of ADTs.
2 To learn about linear data structures – lists, stacks, and queues.
3 To learn about non-linear data structures – trees and graphs.
4 To learn about Multiway Search Trees and Graphs.
5 To learn about Tree and Graph structures.
Assignments:
S.No TOPIC
1 Types of linked list.
2 Stack ADT Operations.
3 Binary Search Tree ADT.
4 Types of Graph.
5 Sorting Techniques.
ICT Based Teaching
●NPTEL material for understanding basic concept.
●Animation for working of ADT,stacks,Queues,Trees and Sorting techniques.
●Video animation for types of Sorting techniques.

Pedagogical Initiatives

1 Understand the basic concept of List ADT.

2 Understand the Stack and Queue concepts.
3 Gain knowledge on Tree Structures.
4 Gain knowledge on Search Trees and Graphs.
5 Understand the basic concept of Hashing techniques.

PROGRAMME EDUCATIONAL OBJECTIVES

●Our graduates will have fundamental technical knowledge and develop core competency in
diversified areas of Automobile Engineering such as thermal, design, production and
maintenance with a view to expanding the knowledge horizon and inculcating lifelong
learning among students.

●Our graduates will pursue advanced studies, research and industrial product development in
the field of Automobile Engineering by developing partnerships with industrial and research
agencies thereby serving the needs of the industry, government, society and scientific
community.

●Our graduates will be capable of building their own careers upon a solid foundation of
knowledge and a strong sense of responsibility to serve their profession and society
ethically.Our graduates will have effective communication, leadership, teaming, problem
solving and decision making skills by understanding contemporary issues thereby
contributing to their overall personality and career development.

Prepared by: P Anusha Devi

HOD PRINCIPAL