1

CCM

CSE2002
Data Structures and Algorithms (LTP-3)
Slot: B11+B12+B13+B14
Class ID: BL2023241000792
FALL SEMESTER 2023-2024

Dr. Dheresh Soni

Assistant Professor
School of Computing Science and
Engineering
 2

Individual Time Table

 3

Contents
Sl. No Description Page

1 Program Outcome 4

2 Syllabus 5

3 CO- PO* / SO** Mapping 8

4 Course Plan 9

5 Assessment Tools and Weightage 11

6 Sessions Plan 12

7 Annexure -1 (Model Question Paper) 38

8 Lab Assignments 41

8 Attendance Report 43

 PO – Program Outcome as defined by NBA & NAAC

 SO – Student Outcome as defined by ABET

Reference: https://www.abet.org/accreditation/accreditation-criteria/criteria-for-accrediting-engineering-
programs-2020-2021/
 4

NBA Programme Outcome

Engineering Graduates will be able to:

PO1.Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and
an engineering specialization to the solution of complex engineering problems.

PO2.Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.

PO3.Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations.

PO4.Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.

PO5.Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering
and IT tools including prediction and modeling to complex engineering activities with an understanding
of the limitations.

PO6.The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.

PO7. Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.

PO8.Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.

PO9.Individual and teamwork: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings.

PO10. Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions.

PO11. Project management and finance: Demonstrate knowledge and understanding of the engineering
and management principles and apply these to one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments.

PO12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.
 5

Reference: https://www.nbaind.org/Files/ug-sar-tier-i-final-ver-1.0.pdf

Syllabus
Course Data Structures and Algorithms CT C
Code LTP 4
CSE2002
Prerequisite: Introduction to Problem Solving and Programming
Objectives:
 To understand various types of fundamental data structures (standard and user defined).
 To learn about algorithm analysis for the run time complexities and the space requirements.
 To acquire knowledge of data structures and algorithms for implementing various real-world
problems.
Expected Outcomes:
Students will be able to
 Apply the fundamental knowledge of various data structures and algorithms to analyze, design,
formulate and implement algorithm for any real time problem.
 Apply current techniques in data structures and algorithmic principles for modeling and
developing software systems.
 Choose an appropriate design paradigm that solves the given problem efficiently along with
appropriate data structures.
 Map real-world problems to algorithmic solutions.

Student Outcomes (SO): a,b,i,l,m

a. An ability to apply the knowledge of mathematics, science and computing appropriate to
the discipline.
b. An ability to analyze a problem, identify and define the computing requirements
appropriate to its solution.
i. Design and conduct experiments as well as analyze and interpret data
l. An ability to apply mathematical foundations, algorithmic principles and computer science
theory in the modelling and design of computer-based systems (CS)
m. An ability to apply design and development principles in the construction of software systems
(CS).
Unit Unit Content No. of SOs
No hours
Introduction to Algorithm and Data Structures 6 Hours a,b
Algorithm: Introduction - Algorithm Design – Complexity-
1 Asymptotic notations. Data Structures: Introduction- Classification
of Data structure - Abstract Data Type (ADT).
Sorting and Searching 8 Hours a,b,l
Brute force approach: General method -Sorting (bubble, selection,
insertion)–Searching(Sequential/Linear) Divide and Conquer
2 approach: General method - Sorting ( merge, quick) – Searching
(Binary Search).
List, Statck and Queue ADT 10 Hours a,b,l,m
Linked List: Array Vs Linked List - Singly Linked List,
3
 6

Doubly Linked Lists – Circular Linked Lists-implementation

application. Stack and Queue: Introduction – implementation
(static and dynamic) – application – Circular queues-
application.
TREES AND HASHING 10 Hours a,b,l,m
Linear Vs Non-Linear Data Structures -General Tree –
Terminologies -Binary Tree – Expression Tree - Traversals -
4 Binary Search Tree AVL Tree – Red block Tree – Splay Tree –
B Tree. - Hashing: Introduction – Hash Function- Methods-
Collision Resolution.
Graph ADT 9 Hours a,b,l,m
Graph: Introduction – Representations – Traversals - Topological
Sorting – Connected and Bi-Connected Components –
5 Articulation Point - Shortest- path algorithms (Dijkstra’s and
Floyd’s algorithms) - Minimum spanning tree (Prim’s and
Kruskal’s algorithms).
Guest Lecture on Contemporary Topics 2 Hours
Total Lecture: 45 Hours
Mode of Teaching and Learning: Flipped Class Room, One Lecture to be videotaped,
Digital/Computer based models to augment lecture for practice/tutorial, 2 hours lectures by
industry experts on contemporary topics
Mode of Evaluation and assessment:
The assessment and evaluation components may consist of unannounced open book
examinations, quizzes, student’s portfolio generation and assessment, and any other innovative
assessment practices followed by faculty, in addition to the Continuous Assessment Tests and
Final Examinations.
Text Books:
1. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein,
Introduction to Algorithms, 3rd Edition, MIT Press, 2009
Reference Books:
1. Mark A. Weiss,Data Structures and Algorithm Analysis in C++, 4th Edition, Pearson,
2014
2. Aaron M. Tenenbaum, Yeedidyah Langsam, Moshe J. Augenstein, ‘Data
structures using C’, Pearson Education, 2010.
3. D. E. Knuth, Art of computer programming, Volume 1: Fundamental
algorithms, Addison Wesley, 2011.

Indicative List of Experiments (All the

 7

experiments need to be done in C Language)

Description SO
1 Implementation of Sorting Algorithms (Bubble Sort, Merge sort and Quick
sort)
2 Implementation of Searching Algorithms (Linear and Binary)
3 Implementation of Single Linked List.
4 Implementation Double Linked List. a,b,i,l,m
5 Implementation Stack using Array and Linked List.
6 Implementation of Queue using Array and Linked List.
7 Implementation of Binary Tree Traversals.
8 Implementation of Binary Search Tree.
9 Implementation of BFS and DFS.
10 Implementation of Dijkstra Shortest Path Algorithms.
11 Implementation of Prims and Kruskal Algorithms.
12 Implementation Hashing Techniques.
Recommendation by the Board of Studies on 27.12.2021
Approval by Academic council on
Compiled by Dr. M. Ashwin & Dr. Sandip Mal
 8

Correlation of COs with POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4 PSO5

CO1 3 2 3 3 2 1 1 2 2 1 2 2 3 3 3 3 3

CO2 3 3 3 3 2 2 1 2 1 1 2 2 3 3 3 2 3

CO3 2 3 3 3 2 1 2 1 2 2 2 2 3 3 2 3 3

CO4 2 3 3 3 3 2 1 1 1 1 1 1 3 3 3 3 3

8
 9

Course Plan with pedagogy/Activity and Weightage

of Various Assessment tool
Session
Date CO Topic Pedagogy
Number
1 08-Aug-2023 Algorithm: Introduction Offline
10-Aug-2023 Offline
2 Algorithm Design – Complexity-
16:25-17:55
10-Aug-2023 Offline
3 Asymptotic notations.
18:00-19:30 CO1
Data Structures: Introduction- Offline
4 12-Aug-2023
Classification of Data structure
17-Aug-2023 Offline
5 Abstract Data Type (ADT).
16:25-17:55
17-Aug-2023 Offline
6 Brute force approach:
18:00-19:30
-Sorting (bubble, selection, Offline
7 19-Aug-2023
insertion)
8 22-Aug-2023 Searching(Sequential/Linear) Offline
CO2
24-Aug-2023 Offline
9 Divide and Conquer approach:
16:25-17:55
24-Aug-2023 Offline
10 Sorting ( merge, quick)
18:00-19:30
11 26-Aug-2023 Searching (Binary Search). Offline
12 29-Aug-2023 Linked List: Offline
31-Aug-2023 Offline
13 Array Vs Linked List
16:25-17:55
31-Aug-2023 Offline
14 Singly Linked List,
18:00-19:30
15 02-Sep-2023 Doubly Linked Lists Offline
CO3 Circular Linked Lists- Offline
16 05-Sep-2023
implementation application.
17 09-Sep-2023 Stack and Queue: Introduction Offline
Stack and Queue: implementation Offline
18 12-Sep-2023
(static and dynamic) – application
14-Sep-2023 Offline
19 Circular queues-application.
16:25-17:55
Linear Vs Non-Linear Data Offline
14-Sep-2023
20 Structures -General Tree –
18:00-19:30
Terminologies
21 16-Sep-2023 Binary Tree Offline
28-Sep-2023 CO4 Offline
22 Expression Tree, Tree Traversals
16:25-17:55
28-Sep-2023 Offline
23 Binary Search Tree
18:00-19:30
24 30-Sep-2023 AVL Tree Offline

9
 10

25 03-Oct-2023 Red black Tree Offline

05-Oct-2023 Offline
26 Splay Tree, B Tree.
16:25-17:55
05-Oct-2023 Hashing: Introduction – Hash Offline
27
18:00-19:30 Function
28 10-Oct-2023 Collision Resolution in Hashing Offline
12-Oct-2023 Offline
29 Graph: Introduction
16:25-17:55
12-Oct-2023 Offline
30 Graph: Representations
18:00-19:30
31 14-Oct-2023 Graph: Traversals Offline
32 17-Oct-2023 Topological Sorting Offline
19-Oct-2023 Connected and Bi-Connected Offline
33
16:25-17:55 Components – Articulation Point
19-Oct-2023 CO5 Shortest- path algorithms Offline
34
18:00-19:30 (Dijkstra’s Algorithm)
Shortest- path algorithms (Floyd’s Offline
35 21-Oct-2023
Algorithm)
26-Oct-2023 Minimum spanning tree (Prim’s Offline
36
16:25-17:55 Algorithm)
26-Oct-2023 Minimum spanning tree (Kruskal’s Offline
37
18:00-19:30 Algorithm)
38 28-Oct-2023 Revision of topics Offline

10
 11

Assessment Tools and their Weightages

Sl. No. Assessment Tools Weightage %

1 Class Assessment – Tutorial 5%

2 Class Assessment - Group Activity 5%

3 Lab Assessment - Continuous Assessment 10%

4 Lab Assessment - Challenging Task 10%

5 Lab Assessment – Viva 5%

Overall Assessment:
Mid Term : 30%

Class Assessment – Tutorial

5%
Class Assessment - Group Activity
5%

11
 12

Lab Assessment - Continuous Assessment

10%
Lab Assessment - Challenging Task
10%
Lab Assessment – Viva 5%

Attendance: 5%

Term End: 30%

Course Outcome Attainment

Expected Level
COs Target in % of Attainment in
%
CO1 60 60
CO2 60 60
CO3 60 60
CO4 60 60

Session Plan

Session Number: 1 Date: 08-Aug-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Algorithm: Introduction

Venue AB-529

Course
Outcome CO1

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on computers
Assessment
Pedagogy
Offline
adopted

12
 13

Material PPT and Class notes

Exit Ticket /
Asked few random question about computer systems.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 2 Date: 10-Aug-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Algorithm Design – Complexity-

Venue AB-529

Course
Outcome CO1

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on algorithms
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

13
 14

Exit Ticket /
Asked few random question about complexity of algorithms
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 3 Date: 10-Aug-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Algorithm Design – Complexity-

Venue AB-529

Course
Outcome CO1

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on algorithms
Assessment
Pedagogy
Offline
adopted

14
 15

Material PPT and Class notes

Exit Ticket /
Asked few random question about asymptotic complexity.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Date: 12-Aug-2023 Class no: 0790

Session Number: 4 Slot: B11+B12+B13+B14

Topic Data Structures: Introduction- Classification of Data structure

Venue AB-529

Course
Outcome CO1

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on data types.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

15
 16

Exit Ticket /
Asked few random question about Classification of Data structure.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 5 Date: 17-Aug-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Abstract Data Type (ADT). &

Introduction to C Programming(Lab Exercise 1)

Venue AB-529

Course
Outcome CO1

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on C programming.
Assessment
Pedagogy
Offline
adopted

16
 17

Material PPT and Class notes

Exit Ticket /
Asked few random question about C programming exercise 1.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 6 Date: 17-Aug-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Brute force approach:

Venue AB-529

Course
Outcome CO2

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on algorithm.
Assessment
Pedagogy
Offline
adopted

17
 18

Material PPT and Class notes

Exit Ticket /
Asked few random question about types of algorithms.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 7 Date:19-Aug-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Sorting (bubble, selection, insertion)

Venue AB-529

Course
Outcome CO2

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on algorithm.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

18
 19

Exit Ticket /
Asked few random question about types of sorting.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 8 Date:22-Aug-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Searching(Sequential/Linear)

Venue AB-529

Course
Outcome CO2

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on types of sorting.
Assessment
Pedagogy
Offline
adopted

19
 20

Material PPT and Class notes

Exit Ticket /
Asked few random question about types of sorting and searching.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 9 Date:24-Aug-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Divide and Conquer approach:

& Lab Exercise 2

Venue AB-529

Course
Outcome CO2

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on types of sorting/searching.
Assessment

20
 21

Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket / Asked few random question about types of sorting and searching and C
Assessment Programming.
After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 10 Date:24-Aug-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Sorting ( merge, quick)

Venue AB-529

Course
Outcome CO2

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on types of sorting/searching.
Assessment

21
 22

Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about types of sorting.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 11 Date: 26-Aug-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Searching (Binary Search).

Venue AB-529

Course
Outcome CO2

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on linear searching.
Assessment

22
 23

Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about types of searching.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 12 Date: 29-Aug-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Linked List:

Venue AB-529

Course
Outcome CO3

Before Class
Interaction of Faculty and Students
Activity

23
 24

Entry Ticket /
Random questions on pointers.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about linked list.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 13 Date: 31-Aug-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Array Vs Linked List

& Lab Exercise 3

Venue AB-529

Course
Outcome CO3

Before Class Interaction of Faculty and Students

24
 25

Activity
Entry Ticket /
Random questions on pointers.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about linked list and implementation of linked list .
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 14 Date: 31-Aug-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Singly Linked List

Venue AB-529

Course
Outcome CO3

25
 26

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on pointers.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about linked list and implementation of linked list .
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 15 Date: 02-Sep-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Doubly Linked Lists

Venue AB-529

Course
Outcome CO3

Before Class Interaction of Faculty and Students

26
 27

Activity
Entry Ticket /
Random questions on singly linked list.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about singly and doubly linked list.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 16 Date: 05-Sep-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Circular Linked Lists- implementation application.

Venue AB-529

Course
Outcome CO3

Before Class Interaction of Faculty and Students

27
 28

Activity
Entry Ticket /
Random questions on linked list.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about circular linked list.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 17 Date: 09-Sep-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Stack and Queue: Introduction

Venue AB-529

Course
Outcome CO3

Before Class Interaction of Faculty and Students

28
 29

Activity
Entry Ticket /
Random questions on data structures.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about data structures.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 18 Date:12-Sep-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Stack and Queue: implementation (static and dynamic) – application

Venue AB-529

Course
Outcome CO3

Before Class Interaction of Faculty and Students

29
 30

Activity
Entry Ticket /
Random questions on arrays and pointers.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about data structures.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 19 Date:14-Sep-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Circular queues-application.

& Lab Exercise 4

Venue AB-529

Course
Outcome CO3

30
 31

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on data structures.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about data structures and it’s implementation .
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 20 Date: 14-Sep-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Linear Vs Non-Linear Data Structures -General Tree – Terminologies

Venue AB-529

Course
Outcome CO4

Before Class Interaction of Faculty and Students

31
 32

Activity
Entry Ticket /
Random questions on linear data structures.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about types of data structures.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 21 Date: 16-Sep-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Binary Tree

Venue AB-529

Course
Outcome CO4

Before Class
Interaction of Faculty and Students
Activity

32
 33

Entry Ticket /
Random questions on non-linear data structures.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about trees.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 22 Date: 28-Sep-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Expression Tree, Tree Traversals

& Lab Exercise 5

Venue AB-529

Course
Outcome CO4

Before Class Interaction of Faculty and Students

33
 34

Activity
Entry Ticket /
Random questions on binary trees.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about binary tree traversal.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 23 Date:28-Sep-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Binary Search Tree

Venue AB-529

Course
Outcome CO4

34
 35

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on trees.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about binary search trees.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 24 Date:30-Sep-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic AVL Tree

Venue AB-529

Course
Outcome CO4

Before Class Interaction of Faculty and Students

35
 36

Activity
Entry Ticket /
Random questions on binary search trees.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about AVL Trees.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 25 Date:03-Oct-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Red black Tree

& Lab Exercise 6

AB-529
Venue

Course
Outcome CO4

Before Class Interaction of Faculty and Students

36
 37

Activity
Entry Ticket /
Random questions on binary search trees.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about trees and programming.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 26 Date:05-Oct-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Splay Tree, B Tree.

Venue AB-529

Course
Outcome CO4

37
 38

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on search trees.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about search trees.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 27 Date:05-Oct-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Hashing: Introduction – Hash Function

Venue AB-529

Course
Outcome CO4

Before Class Interaction of Faculty and Students

38
 39

Activity
Entry Ticket /
Random questions on searching.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about hashing.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 28 Date:10-Oct-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Collision Resolution in Hashing

& Lab Exercise 7

Venue AB-529

Course
Outcome CO4

Before Class
Interaction of Faculty and Students
Activity

39
 40

Entry Ticket /
Random questions on searching and trees.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about hashing.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 29 Date: 12-Oct-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Graph: Introduction

Venue AB-529

Course
Outcome CO5

Before Class Interaction of Faculty and Students

40
 41

Activity
Entry Ticket /
Random questions on non-linear data structures.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about graphs.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 30 Date: 13-Oct-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Graph: Representations

& Lab Exercise 8

Venue AB-529

Course
Outcome CO5

41
 42

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on graphs.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about graphs and its implementation.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 31 Date: 14-Oct-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Graph: Traversals

Venue AB-529

Course
Outcome CO5

Before Class Interaction of Faculty and Students

42
 43

Activity
Entry Ticket /
Random questions on graphs.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about graphs traversals.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 32 Date: 17-Oct-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Topological Sorting

Venue AB-529

Course
Outcome CO5

Before Class Interaction of Faculty and Students

43
 44

Activity
Entry Ticket /
Random questions on graph traversals.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about topological sorting.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 33 Date: 17-Oct-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Connected and Bi-Connected Components – Articulation Point

Venue AB-529

Course
Outcome CO5

44
 45

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on graph.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about graph types.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 34 Date: 19-Oct-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Shortest- path algorithms (Dijkstra’s Algorithm)

& Lab Exercise 9

Venue AB-529

Course
Outcome CO5

Before Class Interaction of Faculty and Students

45
 46

Activity
Entry Ticket /
Random questions on minimum spanning tree.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about MST’s and it’s implementation.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 35 Date: 21-Oct-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Shortest- path algorithms (Floyd’s Algorithm)

Venue AB-529

Course
Outcome CO5

Before Class
Interaction of Faculty and Students
Activity

46
 47

Entry Ticket /
Random questions on minimum spanning tree.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about Floyd’s Algorithm.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 36 Date: 26-Oct-2023 Class no: 0790

16:25-17:55 Slot: B11+B12+B13+B14

Topic Minimum spanning tree (Prim’s Algorithm)

Venue AB-529

Course
Outcome CO5

Before Class Interaction of Faculty and Students

47
 48

Activity
Entry Ticket /
Random questions on minimum spanning tree.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about Prim’s Algorithm.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 37 Date: 26-Oct-2023 Class no: 0790

18:00-19:30 Slot: B11+B12+B13+B14

Topic Minimum spanning tree (Kruskal’s Algorithm)

Venue AB-529

Course
Outcome CO5

48
 49

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket /
Random questions on minimum spanning tree.
Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about Kruskal’s Algorithm.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Session Number: 38 Date: 28-Oct-2023 Class no: 0790

Slot: B11+B12+B13+B14

Topic Revision of topics

Venue AB-529

Course
Outcome CO5

Before Class
Interaction of Faculty and Students
Activity
Entry Ticket / Recall of previous topics

49
 50

Assessment
Pedagogy
Offline
adopted

Material PPT and Class notes

Exit Ticket /
Asked few random question about overall data structures.
Assessment

After Class
Discussion/ to ask anything related to topic
Activity

Annexure -1 (Model Question Paper)

Reg. No.:
Name :

TERM END EXAMINATIONS (TEE) – October - November 2023

Programme : B.Tech. Semester : Fall 2023-24
Course Title : Data Structures and Algorithms Course Code : CSE2002
Faculty Name : Dr. Dheresh Soni Slot : B11+B12+B13+B14
Time : 3 Hrs. Max. Marks : 100

50
 51

Answer ALL the Questions

Module RBT
Q. No. Question Description Marks
No. Level
CO

PART A – (60 Marks)

1 (a) What is an Abstract Data Type (ADT). Discuss the tree ADT with an 4+8 1 KL1 CO1
example?

OR
(b) What is computational complexity? Derive the recurrence relation and 12 1 KL2 CO1
evaluate the computational complexity of evaluating the factorial of a
number using recursion?

2 (a) Describe the individual passes to sort the given inputs: 12 2 KL3 CO2
10, 52, 45, 64, 25, 45, 36, 12, 90, 81, 78 using insertion sort algorithm?

OR
(b) Derive the best case, worst case, and average case time complexities of 12 2 KL4 CO2
searching a number using linear search?

3 (a) Describe the principle and usage of a Queue? Explain the significance of 4+8 3 KL4 CO3
using circular queues over a linear queues with appropriate example?

OR
(b) Write an algorithm/pseudocode to count the number of nodes in a Singly 6+6 3 KL3 CO3
Linked List?

Derive the postfix expression for the given expression: A+B*C+D-F

using a stack

4 (a) Explain the principle and properties of a Binary tree? 6+6 4 KL1 CO4

Describe the different rotations in an AVL tree?

OR
(b) Explain how Hashing is useful for searching a key value as compared to 6+6 4 KL1 CO4
other searching techniques?

Describe the different collision resolution techniques used in Hashing?

5 (a) State the differences between a graph and a tree? 6+6 5 KL2 CO5

Explain how trees can be represented on a computer with an example?

OR
(b) Derive the Minimum Spanning Tree (MST) and the cost of the MST 12 5 KL5 CO5
obtained by applying the Kruskal’s Algorithm on the weighted graph G
given below:

51
 52

PART B – (40 Marks)

6 Write an algorithm to find the maximum and minimum value in an array 8 1 KL2 CO1
of 10 numbers.

7 Using binary search, search the number 12 from the list of numbers: 8 2 KL3 CO2
1,10,12,14,18,19,23,24,29,30,31,32 and give the steps to search the
number.

8 Given a linked list: 10,20,50,70,80,90,95, generalize the steps and write a 8 3 KL2 CO3
routine to insert a node at the beginning of the linked list and to display
the list.

9 Create a B-tree of order 5 for the given input sequence: 8 4 KL5 CO4
45, 62, 25, 34, 12, 15, 75, 42, 26, 56, 6, 8, 17

10 Derive the BFS and DFS sequence for the graph G given below: 8 5 KL3 CO5



52
 53

Lab Assignments:
Lab Activity 1
Answer the questions and submit it within the time frame. Create a pdf file with
the question, snapshot of the code and output.
Q1. Write a C program to add two matrix.
Q2. Write a C program to print the address of a variable.
Q3. Write a C Program to multiply two matrix.
Q4. Write a C Program to swap two numbers using pointers.

Lab Activity 2
Q1. Write a C program to implement structures ?
Q2. Write a C program to implement dynamic arrays?
Q3. Write a C program to implement Linear Search?
Q4. Write a C program to implement Binary Search?

53
 54

Lab Activity 3
Q1. Write a C program to implement Bubble Sort?
Q2. Write a C program to implement Insertion Sort?
Q3. Write a C program to implement Selection Sort?
Q4. Write a C program to implement Merge Sort?
Q5. Write a C program to implement Quick Sort?

Lab Activity 4
Q1: Write a menu driven program in C language to perform the following
operations on a linked list:
a) Create a Linked List.
b) Insert an element at the front of a Linked List.
c) Insert an element at the end of a Linked List.
d) Insert an element at any position of a Linked List.
e) Search an element in the Linked List.
f) Delete an element from the front of the linked list.
g) Delete an element from the end of the linked list.
h) Delete an element from any position of the linked list.
i) Display the linked list.
j) Reverse the linked list.

Lab Activity 5
Q1: Write a menu driven program in C language to perform the following
operations on a doubly linked list:
a) Create a Doubly Linked List.
b) Insert an element at the front of a Doubly Linked List.
c) Insert an element at the end of a Doubly Linked List.
d) Insert an element at any position of a Doubly Linked List.
e) Search an element in the Doubly Linked List.
f) Delete an element from the front of the Doubly linked list.
g) Delete an element from the end of the Doubly linked list.
h) Delete an element from any position of the Doubly linked list.
i) Display the Doubly linked list.
j) Reverse the Doubly linked list.

Q2: Write a menu driven program in C language to perform the following

operations on a circular linked list: (Operations same as above a,b,c,d,e,f,g,h,i,j)

Lab Activity 6
Q1. Implement Stack using arrays, implement the following functions(Push, Pop,
Peek, Display).
Q2. Implement Stack using linked lists, implement the following functions(Push,

54
 55

Pop, Peek, Display).

Lab Activity 7
Q1. Implement a linear Queue using Array?
Q2. Implement a linear Queue using linked list?
Q3. Implement a Circular Queue using Array?
Q4. Implement a Circular Queue using Linked list?

Lab Activity 8
Q1. Write a C Program to represent a Binary Tree?
Q2. Implement the different tree traversals in a binary tree?
Q3. Write a C program to implement Binary Search Tree?

Lab Activity 9
Q1. Write a C program to implement BFS and DFS algorithm?
Q2. Write a C program to implement Dijkstra Shortest Path Algorithms?
Q3. Write a C program to implement Prims and Kruskal Algorithms.?
Q4. Write a C program to implement Hashing?

Attendance Report
ATTENDANCE
Sl. No.
REG. NO. STUDENT NAME PERCENTAGE
1 22BCE10010 PRINCE PRADHAN
2 22BCE10017 KETAK
3 22BCE10112 YASH
4 22BCE10130 ANANY CHATURVEDI
5 22BCE10171 MANVI ARORA
6 22BCE10226 ANSHU KUMAR
7 22BCE10238 SHIVANGI KUMARI
8 22BCE10240 KHYATI TIWARI
9 22BCE10256 MAHAVEERPRASAD TIWARI
10 22BCE10257 BHOOMI CHOWKSEY
11 22BCE10285 AVIRAL JAIN
12 22BCE10311 NAVNEET TIWARI
13 22BCE10324 KARTIK JOSHI

55
 56

14 22BCE10390 ARYAN SINGH

15 22BCE10444 FALGUNI JAIN
16 22BCE10449 ADITI SINGH
17 22BCE10458 HARSHIT KHURANA
18 22BCE10468 GUPTA HIMANSHU RAJESH
19 22BCE10486 RIDDHIKA TRIPATHI
20 22BCE10513 GUL BHATNAGAR
21 22BCE10548 KUMAR SNEHANSHU
22 22BCE10550 TRUSHA ANAND
23 22BCE10575 ANANT SINGHAL
24 22BCE10593 PRAJEET DUBEY
25 22BCE10599 ABHINAV PRASAD
26 22BCE10704 UTKARSH VATS
27 22BCE10753 ADARSH KUMAR
28 22BCE10757 RISHIRAJ SINGH
29 22BCE10767 RISHABH MUNJAL
30 22BCE10828 MADHURAM KULSHRESTHA
31 22BCE10833 ABHIK GOSWAMI
32 22BCE10911 ANSHIKA GARG
33 22BCE10918 ANWESHA CHATTERJEE
34 22BCE10933 UTKARSHA AHERRAO
35 22BCE10972 Monika kumari
36 22BCE11037 PRIYANSHI MAHAJAN
37 22BCE11072 TASWI SHAHPAR
38 22BCE11107 VINAYAK DEV MISHRA
39 22BCE11128 MUDIT AGARWAL
40 22BCE11157 AINESH SRIDHAR
41 22BCE11240 SOURABH SRIVASTAVA
42 22BCE11246 MAHARSHI HARESH PATEL
43 22BCE11309 NAVEEN RAMESH
44 22BCE11329 DHRUV BHATT
45 22BCE11397 SHIVAM MIRJA MAJHI
46 22BCE11418 ARCHISHA SINGH
47 22BCE11453 CHOLLANGI CHAITANYA
48 22BCE11495 MADHAVAN RAMANUJ
49 22BCE11532 UTKARSH ANIL WAGH
50 22BCE11606 HANSHIKA ARORA
51 22BCE11684 SIDDHANT KOCHHAR
52 22BCG10033 HARSH JAIN
53 22BEY10031
54 22BEY10081 Aarth Srivastava
55 22BEY10082 HARSH RAJ
56 22BEY10141 Vineet Yadav
57 22MIM10023 KUSHAL ZANZARI
58 22MIM10076 TARUN NICHWANI
59 22MIM10082 ABHYUDAY SINGH

56
 57

60 22MIM10109 SHIVAM PARMAR

61 22MIM10120 NIKHIL SAHU
62 22MIP10005 MAHAK DWIVEDI
63 22MIP10012 PIYUSH PANDEY
64 22MIP10020 HARSH RAJ MAURYA
65 22MIP10029 KHUSHI GUPTA
66 22MIP10043 ANSH PATWA
67 22MIP10045 SANVI KULKARNI
68 22MIP10076 ANSHUL VERMA
69 22MIP10077 NISHITA JAIN
70 22MIP10078 DHVANI HARINKHERE
71 22MIP10080 HARSHVARDHAN SHARMA
72 22MIP10082 VIVEK JAISWAL
73 22MIP10031 Nitij Taneja
74 22MIP10091 VIVEK THAKUR

57