ANNA UNIVERSITY, CHENNAI.

B. E./B. Tech. SCIENCE AND HUMANITIES(EEE)

CS25C04– DATA STRUCTURES AND ALGORITHMS
REGULATIONS – 2025
PROGRAMME OUTCOMES (POs)
After going through the four years of study, our engineering graduates will exhibit the
ability to:
PO #: Graduate Attribute & Programme outcome
PO 1: Engineering Knowledge
PO 2: Problem analysis
PO 3: Design/development of solutions
PO 4: Conduct investigations of complex problems
PO 5: Modern tool usage
PO 6: The engineer and society
PO 7: Environment and sustainability
PO 8: Ethics
PO 9: Individual and teamwork
PO 10: Communication
PO 11: Project management and finance
PO 12: Life-long learning

PROGRAM SPECIFIC OUTCOMES (PSOs)

On successful completion of the programme, the Graduates will have the following
Program Specific Outcomes.
PSO1: Analyze, design, and develop electrical circuits and systems for various industrial and
societal requirements.
PSO2: Utilize modern tools and techniques for solving complex problems in electrical and
electronic systems and provide sustainable solutions.
PSO3: Upskill with rapid advancements in the field of Electrical Engineering and exhibit
research aptitude, work effectively as team and uphold ethical practices.
 EPARTMENT OF SCIENCE AND HUMANITIES (EEE)
SYLLABUS
Course Code Course Name L P T C
CS25C04– DATA STRUCTURES AND ALGORITHMS 3 0 2 4

COURSE OBJECTIVES:
1. To provide the fundamentals of data organization and algorithms

UNIT – I Data Types:

Abstract Data Types (ADTs), ADTs and classes, introduction to OOP, Classes in Python,
Inheritance, Namespaces, Shallow and Deep Copying.
Practical: Implement simple ADTs as Python classes

UNIT – II Linear Structures:

List ADT, array-based implementations, linked list implementations, singly linked lists,
circularly linked lists, doubly linked lists, Stack ADT, Queue ADT, double ended queues,
applications
Practical: List ADT using Python arrays, Linked list, Stack and Queue ADTs and
Applications
UNIT – III Tree Structures:
Tree ADT, Binary Tree ADT, tree traversals, binary search trees, AVL trees, heaps, multi-
way search trees
Practical: Tree representation and traversal algorithms, Binary Search Trees, Heaps.

UNIT – IV Graph Structures:

Graph ADT, representations of graph, graph traversals, DAG, topological ordering, greedy
algorithms, dynamic programming, shortest paths, minimum spanning trees, introduction
to complexity classes and intractability
Practical: Graph representation and Traversal algorithms, Single source shortest path
algorithm, Minimum spanning tree algorithms.
UNIT – V Algorithm:
Analysis of algorithms, Asymptotic notations, Divide & Conquer, Recursion, Recursive
Algorithms
Practical: Implement recursive algorithms in Python.

UNIT – VI Sorting and Searching

Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort, Analysis of sorting
algorithms, Linear & Binary search, Hashing, Hash functions, Collision handling, Load
factors, Rehashing, and Efficiency
Practical: Sorting and searching algorithms, Hash tables.
TOTAL:45 PERIODS
OUTCOMES:
At the end of the course, the students will be able to
Description of CO PO PSO1 PSO2 PSO3
CO1 Explain fundamental concepts of data structures and ---
Algorithms.
CO2 Implement the data structures in different Applications. PO1(3)

CO3 Evaluate and compare different searching and sorting PO1(3)

algorithms PO2(1)
CO4 Demonstrate in continuous learning in interdisciplinary PO11
projects involving AI, ML, Data Science, or other
technology domains.

TEXTBOOKS:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &
Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021

REFERENCES:
1. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python”
Springer Edition 2015
2. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley
& Sons, 2011
3. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson
Education, 1983.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
“Introduction to Algorithms", Second Edition, McGraw Hill, 2002.
5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth
Edition, Pearson Education, 2014
 INDIVIDUAL FACULTY TIME TABLE
DEPARTMENT OF SCIENCE AND HUMANITIES(EEE)
TIME TABLE FOR EVEN SEM (ACADEMIC YEAR: 2025-26)

Hours 12.45
09.30 - 10.15 - 11.00- 11.15- 12.00 - 1.25 – 2.05- 2.45- 2.55- 03.35-
-
Day 10.15 11.00 11.15 12.00 12.45 2.05 2.45 2.55 3.35 04.15
1.25
Monday
Tuesday
Wednesda

LUNCH
BREAK

BREAK
y
Thursday
Friday
Saturday

Course Course No. of

Name of the Course Credit Class / Semester
Code Acronym Hrs
THEORY
CS25C04 DSA Data Structures and Algorithms 4 I/II 7
PDS Python for Data Science 4 I/II 7
ADDITIONAL RESPONSIBILITIES
Value added course - II-AI&DS 44
Value added course - III-AI&DS 36
MMH Mentor-Mentee - II/IV 1
MOM Department minutes of meeting -
Total No. of Hrs
 DEPARTMENT OF SCIENCE AND HUMANITIES (EEE)
LESSON PLAN
ACADEMIC
Degree & Branch BE & EEE 2025-2026
YEAR
REGULATIO
Year / Sem. I/II 2025
N
COURSE
Course Name Data Structures and Algorithms CS25C04
CODE
DESIGNATIO
Name of the Faculty [Link] AP/CSE
N

(Note: If the Subject has 3 Credit means, the minimum Number of Periods must be 12
per unit & if the credit was 4 means, periods must be 15 per unit)
UNIT–I DATA TYPES
Hours: 12 /
15
Sl. Date Periods Book Delivery Actual
Topics to be covered
No. Planned required / Ref Method Date
1. RB6/
05.01.26 Abstract Data Types (ADTs) 1 1.1- A&B
1.4
2. RB6/
06.01.26 ADTs and classes 1 1.5- A&B
1.6
3. RB6/
08.01.26 Introduction to OOP 1 A&B
1.6
4. RB6/
09.01.26 Classes in Python 1 1.6- A&B
1.12
5. RB6/
10.01.26 Inheritance 1 1.13- A&B
1.27
6. Namespaces – Shallow and
RB6/
deep copying
12.01.26 1 1.27- A&B
Introduction to analysis of
1.51
algorithms
7. RB6/
13.01.26 Asymptotic notations 1 1.51- A&B
1.58
8. RB6/
13.01.26 Divide & conquer 1 1.59- A&B
1.62
9. 19.01.26 Recursion- Analyzing recursive 1 RB6/ A&B
 1.63-
algorithms
1.79
10. 19.01.26 Real-World Analogy of ADT 1 NPTEL
UNIT–II LINEAR STRUCTURES
Hours: 12 /
15
Sl. Date Periods Book Delivery Actual
Topics to be covered
No. Planned required / Ref Method Date
11. RB6/
20.01.26 List ADT 1 A&B
2.1
12. RB6/
20.01.26 Array-Based Implementations 1 2.2- A&B
2.5
13. RB6/
22.01.26 Linked List Implementations 1 2.6- A&B
2.7
14. RB6/
23.01.26 Singly Linked Lists 1 2.8- A&B
2.20
15. RB6/
24.01.26 Circularly Linked Lists 1 2.21- A&B
2.34
16. RB6/
27.01.26 Doubly Linked Lists 1 2.35- A&B
2.48
17. RB6/
29.01.26 Stack ADT 1 2.48- A&B
2.63
18. RB6/
30.01.26 Queue ADT 1 2.73- A&B
2.91
19. RB6/
Double Ended Queues –
30.01.26 1 2.92- A&B
Applications
2.96
20. 30.01.26 CPU Cache Optimization 1 NPTEL
UNIT–III TREE STRUCTURES
Hours: 12 /
15
Sl. Date Book Delivery Actual
Topics to be covered 1
No. Planned / Ref Method Date
21. Tree ADT RB6/
31.01.26 1 3.1- A&B
3.8
22. Binary Tree ADT RB6/
31.01.26 1 3.8- A&B
3.16
23. 02.02.26 Tree Traversals 1 RB6/ A&B
 3.16-
3.22
24. Binary Search Trees RB6/
02.02.26 1 3.22- A&B
3.28
25. 03.02.26 AVL Trees RB6/
1 3.28- A&B
3.35
26. AVL Trees Algorithm RB6/
04.02.26 1 3.35- A&B
3.39
27. Heaps RB6/
04.02.26 1 3.39- A&B
3.43
28. Heap Sort RB6/
05.02.26 1 3.43- A&B
3.49
29. Multiway Search Trees RB6/
12.02.26 1 3.49- A&B
3.72
30. 12.02.26 Merkle Trees in Blockchain 1 NPTEL
UNIT–IV GRAPH STRUCTURES
Hours: 12 /
15
Sl. Date Book Delivery Actual
Topics to be covered 1
No. Planned / Ref Method Date
31. RB6/
13.02.26 Graph ADT 1 4.1- A&B
4.4
32. RB6/
13.02.26 Representations Of Graph 1 4.5- A&B
4.15
33. RB6/
14.02.26 Graph Traversals 1 4.16- A&B
4.18
34. RB6/
14.02.26
DAG – Topological Ordering 1 4.11- A&B
4.34
35. RB6/
16.02.26 Greedy Algorithms 1 A&B
4.35
36. RB6/
16.02.26 Dynamic Programming 1 4.39- A&B
4.56
37. RB6/
17.02.26 Shortest Paths 1 4.57- A&B
4.60
38. 17.02.26 Minimum Spanning Trees 1 RB6/ A&B
 4.61-
4.79
39. RB6/
Introduction To Complexity
19.02.26 1 4.79- A&B
Classes And Intractability
4.93
40. 19.02.26 Social Networks 1 NPTEL
UNIT–V ALGORITHMS
Hours: 12 /
15
Sl. Date Book Delivery Actual
Topics to be covered 1
No. Planned / Ref Method Date
41. RB6/
20.02.26 Analysis of algorithms 1 5.1- A&B
5.10
42. RB6/
20.02.26 Analysis of algorithms 1 5.11- A&B
5.17
43. RB6/
23.02.26 Asymptotic notations 1 5.18- A&B
5.29
44. RB6/
23.02.26 Divide & Conquer 1 A&B
5.30
45. RB6/
24.02.26 Divide & Conquer 1 A&B
5.31
46. Recursion RB6/
24.02.26 1 5.31- A&B
5.33
47. Recursion RB6/
26.02.26 1 A&B
5.34
48. Recursive Algorithms RB6/
26.02.26 1 5.35- A&B
5.73
49. Recursive Algorithms RB6/
27.02.26 1 5.74- A&B
5.76
50. Mathematical Foundation of
27.02.26 Algorithm Analysis 1
NPTEL
UNIT-VI SORTING AND SEARCHING
Hours: 12 /
15
Sl. Date Book Delivery Actual
Topics to be covered 1
No. Planned / Ref Method Date
51. RB6/
28.02.26 Bubble Sort 1 6.1- A&B
6.10
52. 17.03.26 Selection Sort 1 RB6/ A&B
6.11-
 6.17
53. RB6/
20.03.26 Insertion Sort 1 6.18- A&B
6.29
54. RB6/
23.03.26 Merge Sort 1 A&B
6.30
55. Quick Sort – Analysis Of Sorting RB6/
23.03.26 1 A&B
Algorithms 6.31
56. RB6/
24.03.26 Linear Search 1 6.31- A&B
6.33
57. RB6/
26.03.26 Binary Search 1 A&B
6.34
58. RB6/
27.03.26 Hashing – Hash Functions 1 6.35- A&B
6.73
59. Collision Handling- Load RB6/
28.03.26 Factors, Rehashing, And 1 6.74- A&B
Efficiency 6.76
60. 30.03.26 Search Engines 1 NPTEL
Total Periods 54 / 75

TEXTBOOKS:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data
Structures & Algorithms in Python”, An Indian Adaptation, John Wiley & Sons
Inc., 2021

REFERENCES:
1. Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2021). Data structures & algorithms
in Python (Indian adaptation). John Wiley & Sons Inc.
2. Lee, K. D., & Hubbard, S. (2015). Data structures and algorithms with Python. Springer.
3. Necaise, R. D. (2011). Data structures and algorithms using Python. John Wiley & Sons.
4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2002). Introduction to
algorithms. McGraw-Hill.
5. Weiss, M. A. (2014). Data structures and algorithm analysis in C++. Pearson Education.

Content beyond the Syllabus:

Unit Topic
1. Real-World Analogy of ADT
2. CPU Cache Optimization
3. Merkle Trees in Blockchain
4. Social Networks
5. Mathematical Foundation of Algorithm Analysis
6. Search Engines
Assignment / Seminar Topics:
Unit Assignment / Seminar Topic
1. Namespaces ,Shallow and deep copying
Introduction to analysis of algorithms
2. Tree Structures

Teaching Methodology:
A. Chalk & talk B. PPT C. Seminar D. Case studies

E. Group discussion F. E-learning G. Online quiz H. YouTube

Faculty in charge HoD Principal

 DEPARTMENT OF SCIENCE AND HUMANITIES (EEE)
STUDENT NAME LIST
Year/Sem.: Batch:
Sl.
Register No. Name of the Student
No.
1. 420125105001 ABINAYA S
2. 420125105002 ADITHYAN E
3. 420125105003 AISHWARYA P
4. 420125105004 ANJELIN REENA A
5. 420125105005 ARIKRISHNAN D
6. 420125105006 ARUNA R
7. 420125105007 BOOMIKA S
8. 420125105008 DEVI B
9. 420125105009 DHANALAKSHMI K
10. 420125105010 GANGATHARAN R
11. 420125105011 GOKUL A
12. 420125105012 GOPAL J
13. 420125105013 GURUBALAN E
14. 420125105014 HEMALATHA S
15. 420125105015 ISWARYA S
16. 420125105016 JAYABHARATH J
17. 420125105017 JEYACHANDIRAN P
18. 420125105018 JOE DEEPAK P
19. 420125105019 JOHN PETER J
20. 420125105020 KALAISELVI R
21. 420125105021 KALAIVANAN E
22. 420125105022 KARTHIKEYAN E
23. 420125105023 KAVIYA A
24. 420125105024 KEERTHANA S
25. 420125105025 KEERTHIVASAN E
26. 420125105026 KUMARAVEL G
27. 420125105027 MALATHI K
28. 420125105028 MATHESWARI E
29. 420125105029 MEENAKSHI E
30. 420125105030 MINNALKODI A
31. 420125105031 MOHAMMED WASIM M
32. 420125105032 MUTHUVEL E
33. 420125105033 NARAYANAMOORTHI E
34. 420125105034 PACHATYAPPAN R
35. 420125105035 PRAVEENA E
36. 420125105036 PRIVADHARSHINI R
37. 420125105037 PRIVADHARSHINI V
38. 420125105038 PUSHPASRI M
39. 420125105039 RAJESHWARI R
40. 420125105040 RAMYA DEVIS
41. 420125105041 SACHIN S
42. 420125105042 SAKTH R
43. 420125105043 SARANYA S
44. 420125105044 SARATH K
45. 420125105045 SATHYA S
46. 420125105046 SELVENDHIRAN M
47. 420125105047 SIVARAMAKRISHNAN H
48. 420125105048 SIVASANKARI S
49. 420125105049 SOUNDHARYA S
50. 420125105050 SUBASH J
51. 420125105051 SUBASRI A
52. 420125105052 SWETHA P
53. 420125105053 TAMILSELVANG
54. 420125105054 THARUN B M
55. 420125105055 THENMOZHI R
56. 420125105056 VARALAKSMI P
57. 420125105057 VIGNESH V
58. 420125105058 VINNARASI V
59. 420125105059 VISHAL M
60. 420125105060 ZUBAIDA BEGUM A
 QUESTION BANK
ACADEMIC 2025-
Degree & Branch BE & EEE
YEAR 2026
REGULATIO
Year / Sem. I/II 2025
N
COURSE
Course Name Data Structures and Algorithms CS25C04
CODE
DESIGNATIO
Name of the Faculty Mrs. D. ELAKKIYA AP/CSE
N

UNIT – I – DATA TYPES

PART – A [Two Marks Questions with Answers] [Min-20]
AU
Q.
QUESTION CO BL Questions
No.
Year
Define Abstract Data Type (ADT). Give an example.
An Abstract Data Type (ADT) is a logical model of a data
structure that specifies operations without describing CO
1. BL1 April/May 24
implementation details. 1
Example: Stack ADT supports operations like push and
pop.
Differentiate between ADT and Data Structure.

o ADT defines the behavior of data.

o Data structure defines the CO
BL1 Nov/Dec 21
2. implementation. 1
o Example: Stack is an ADT, while array or
linked list can implement it.

What is Object-Oriented Programming (OOP)? Mention

its features.
OOP is a programming approach based on objects and
classes.
Features include:
CO1 BL1 Nov/Dec 23
3. o Encapsulation
o Inheritance
o Polymorphism
o Abstraction

4. 2. Explain class and object in Python. CO1 BL1 Nov/Dec 21

A class is a blueprint for creating objects.
 An object is an instance of a class containing
actual data.
Example: Car is a class, and car1 is an object.

Write a simple Python class example.

class Student:
5. def __init__(self, name): CO1 BL1 April/May-24
[Link] = name

s1 = Student("Ravi")
print([Link])
3. What is inheritance? State its advantages.
Inheritance is the process where one class
acquires properties of another class.
Advantages:
6. o Code reusability
CO1 BL1 April/May-24
o Easy maintenance
o Supports hierarchical classification

4. Explain single inheritance with example.

Single inheritance involves one parent and
one child class.

7. class A: CO1 BL1 -

def show(self):
print("Parent")

class B(A):
pass
What are namespaces in Python?
Namespaces are containers used to organize names of
variables and functions.
Types:

Local namespace CO1

8. o BL1 -

 Global namespace

o Built-in namespace

9. Differentiate local and global namespace.

 Local namespace exists inside functions.

 Global namespace exists throughout the
program.
 Local variables cannot be accessed outside the
function.
 What is encapsulation in Python?
Encapsulation is wrapping data and methods together
into a single unit (class).
10. It helps in data hiding and security.

Explain polymorphism in OOP.

Polymorphism allows the same method name to perform
different tasks.
11. Example: Method overriding in inheritance.

What is constructor in Python?

A constructor is a special method __init__()
automatically called when an object is created.
12. It initializes object attributes.

Explain method overriding.

Method overriding occurs when a subclass defines a
method with the same name as in the parent class.
13. The child class method replaces the parent method
behavior.

What is shallow copying?

Shallow copy creates a new object but shares references
of nested objects.
14. Changes in nested objects affect both copies.

What is deep copying?

Deep copy creates a completely independent copy
including nested objects.
15. Changes in one object do not affect the other.

Differentiate shallow copy and deep copy.

16.  Shallow copy shares nested object references.

 Deep copy creates separate copies of all
 objects.
 Deep copy is slower but safer.

Write a Python example for shallow copy.

import copy
17. a = [1, [2, 3]]
b = [Link](a)

Write a Python example for deep copy.

import copy
18. a = [1, [2, 3]]
b = [Link](a)

What are the advantages of OOP?

 Code reusability
 Better security
19.  Easy debugging
 Modularity
 Easy maintenance

Explain the use of self in Python classes.

self refers to the current object of the class.
It is used to access instance variables and methods inside
20. the class.

PART – B & C [Min-10]

 AU
Q.
QUESTION CO BL Marks Questions
No.
Year
Explain Abstract Data Types (ADTs) and discuss
April/May
1. their features, advantages, and applications with CO1 BL1 6
24
suitable examples.
Differentiate between Abstract Data Types and
2. Data Structures with examples and detailed CO1 BL1 8 May/june 12
explanation.
Explain the concepts of Object-Oriented
Programming (OOP) and discuss its important
3. CO1 BL1 13 Nov/Dec 21
features such as encapsulation, inheritance,
polymorphism, and abstraction.
Describe classes and objects in Python with
4. suitable examples. Explain the use of CO1 BL1 8 May/June 12
constructors and instance variables.
Explain inheritance in Python. Discuss different
5. CO1 BL1 12 Nov/Dec 13
types of inheritance with suitable examples.
Discuss namespaces in Python. Explain local,
6. CO1 BL1 13 -
global, and built-in namespaces with examples.
Explain shallow copying and deep copying in
7. Python with examples. Compare their advantages CO1 BL1 13 -
and disadvantages.
Write a detailed note on classes in Python.
8. Explain class variables, instance variables, CO1 BL1 13 -
methods, and constructors with examples.
Explain method overriding and polymorphism in
9. CO1 BL1 13 -
Python with suitable examples.
Discuss the advantages and limitations of Object-
10. Oriented Programming in Python with real-time CO1 BL1 13 -
applications.
 UNIT – II – Linear structures
PART – A [Two Marks Questions with Answers] [Min-20]
AU
Q.
QUESTION CO BL Questions
No.
Year
What is an Abstract Data Type (ADT)? ADT is a logical
CO
21. description of a data structure that specifies data and BL1 April/May 24
1
operations without implementation details.
Define List ADT. List ADT is a linear collection of elements
CO
arranged sequentially with operations like insertion, BL1 Nov/Dec 21
22. 1
deletion, and traversal.
What is an array-based implementation of list? It stores
list elements in contiguous memory locations using CO1 BL1 Nov/Dec 23
23.
arrays.
State one advantage of linked list over arrays. Linked
24. lists support dynamic memory allocation and easy CO1 BL1 Nov/Dec 21
insertion/deletion.
Define singly linked list. A singly linked
list is a collection of nodes where each
25. node contains data and a pointer to the CO1 BL1 April/May-24
next node.
What is a circular linked list? In a circular linked list, the
last node points back to the first node.

26. CO1 BL1 April/May-24

Define doubly linked list. A doubly linked

list contains pointers to both previous and
next nodes.

27. CO1 BL1 -

Mention one application of linked lists. Polynomial

manipulation and dynamic memory management are
applications of linked lists.
CO1
28. BL1 -
 What is a stack? Stack is a linear data structure that
follows LIFO (Last In First Out) principle.

29.

Name the basic operations of stack. Push, Pop,

Peek/Top, and IsEmpty are stack operations.

30.

What is stack overflow? Stack overflow occurs when

insertion is attempted in a full stack.

31.

What is stack underflow? Stack underflow occurs when

deletion is attempted from an empty stack.

32.

Mention one application of stack. Expression evaluation

and function calls use stacks.

33.

Define queue ADT. Queue is a linear data structure that

follows FIFO (First In First Out) principle.

34.
 Name the basic operations of queue. Enqueue, Dequeue,
Front, and Rear are queue operations.

35.

What is a circular queue? A circular queue connects the

last position to the first position to utilize memory
efficiently.
36.

Define Deque. Deque (Double Ended Queue) allows

insertion and deletion at both ends.

37.

Differentiate stack and queue. Stack follows LIFO,

whereas queue follows FIFO principle.

38.

What is the time complexity of insertion at beginning in

linked list? The time complexity is O(1).

39.

Mention one application of queue. CPU scheduling and

printer scheduling use queues.

40.
 PART – B & C [Min-10]
AU
Q. Mark
QUESTION CO BL Questions
No. s
Year
Explain List ADT in detail and discuss array-based
CO BL April/May
1. implementation of lists with suitable examples. 6
1 1 24
Describe singly linked list with memory
representation and explain insertion and CO BL
2. 8 May/june 12
deletion operations with algorithms. 1 1
Explain circular linked list and doubly linked list
with suitable diagrams and applications. CO BL
3. 13 Nov/Dec 21
1 1
Compare array implementation and linked list
CO BL May/June
4. implementation of List ADT with advantages and 8
1 1 12
disadvantages.
Explain Stack ADT and discuss stack operations CO BL
5. 12 Nov/Dec 13
using array implementation with algorithms. 1 1
Explain linked list implementation of stack with CO BL
6. 13 -
push and pop operations and suitable examples. 1 1
Describe Queue ADT and explain queue
CO BL
7. operations using arrays with algorithms and 13 -
1 1
examples.
Explain circular queue with suitable example and CO BL
8 13 -
discuss its advantages over linear queue. 1 1
What is a Deque? Explain types of deque and CO BL
9. 13 -
operations performed on deque with examples. 1 1
1 Discuss various applications of linked lists, CO BL
13 -
0. stacks, queues, and deque in real-time systems. 1 1
 UNIT – III – Tree Structures
PART – A [Two Marks Questions with Answers] [Min-20]

AU
Q.
QUESTION CO BL Questions
No.
Year
What is a Tree ADT? Tree ADT is a hierarchical data
CO
41. structure consisting of nodes connected by edges with a BL1 April/May 24
1
root node at the top.
Define Binary Tree. A binary tree is a tree in which each
CO
node has at most two children called left child and right BL1 Nov/Dec 21
42. 1
child.
What is a leaf node? A node with no children is called a
CO1 BL1 Nov/Dec 23
43. leaf node.
What is meant by tree traversal? Tree traversal is the
44. CO1 BL1 Nov/Dec 21
process of visiting all nodes of a tree exactly once.
Name the types of tree traversals. Preorder, Inorder,
45. Postorder, and Level order traversals are the types of tree CO1 BL1 April/May-24
traversals.
What is preorder traversal? In preorder traversal, nodes
46. are visited in the order Root–Left–Right. CO1 BL1 April/May-24
What is inorder traversal? In inorder traversal, nodes are
47. visited in the order Left–Root–Right. CO1 BL1 -

What is postorder traversal? In postorder traversal, CO1

48. nodes are visited in the order Left–Right–Root. BL1 -

Define Binary Search Tree (BST). A BST is a binary tree in

49. which left subtree values are smaller and right subtree
values are greater than the root node.
What is the advantage of Binary Search Tree? BST allows
50. efficient searching, insertion, and deletion operations.
What is an AVL tree? AVL tree is a self-balancing binary
51. search tree where the height difference between left and
right subtrees is at most 1.

What is a balance factor in AVL tree? Balance factor is

52. the difference between the heights of left and right
subtrees of a node.
What are AVL rotations? AVL rotations are operations
53. used to balance an AVL tree after insertion or deletion.
 Define Heap. Heap is a complete binary tree that satisfies
54. heap property.

What is a Max Heap? In Max Heap, the parent node value

55. is greater than or equal to its child nodes.
What is a Min Heap? In Min Heap, the parent node value
56. is smaller than or equal to its child nodes.
Mention one application of heap. Heap is used in priority
57.
queues and heap sort algorithms.
What is a multi-way search tree? A multi-way search tree
58. is a tree where each node can have more than two
children.
State one advantage of multi-way search trees. Multi-
59. way search trees reduce tree height and improve
searching efficiency.

What is a Tree ADT? Tree ADT is a hierarchical data

60. structure consisting of nodes connected by edges with a
root node at the top.

PART – B & C [Min-10]

AU
Q. Mark
QUESTION CO BL Questions
No. s
Year
Explain Tree ADT with suitable examples and
CO BL April/May
1. discuss the properties and applications of trees. 6
1 1 24
Explain Binary Tree ADT and discuss different
types of binary trees with suitable diagrams. CO BL
2. 8 May/june 12
1 1
Describe tree traversal techniques namely
preorder, inorder, postorder, and level order CO BL
3. 13 Nov/Dec 21
traversals with examples. 1 1
Explain Binary Search Tree (BST) and discuss
CO BL May/June
4. insertion, deletion, and searching operations 8
1 1 12
with suitable examples.
Construct a Binary Search Tree for the given set
CO BL
5. of elements and explain inorder, preorder, and 12 Nov/Dec 13
1 1
postorder traversals.
Explain AVL trees in detail and discuss AVL CO BL
6. 13 -
rotations with suitable examples. 1 1
Describe single rotation and double rotation CO BL
7. 13 -
techniques used in AVL trees with neat diagrams. 1 1
Explain heap data structure and discuss Max CO BL
8 13 -
Heap and Min Heap with suitable examples. 1 1
 Explain heap operations such as insertion, CO BL
9. 13 -
deletion, and heapify process with algorithms. 1 1
Discuss multi-way search trees and explain their
1 CO BL
advantages and applications in database indexing 13 -
0. 1 1
and file systems.

UNIT – IV – XXXXXXXXXXXXXXXXX
PART – A [Two Marks Questions with Answers] [Min-20]
AU
Q.
QUESTION CO BL Questions
No.
Year
CO
Define Rayleigh scattering BL1 April/May 24
1
CO
1. What is Rayleigh scattering? BL1 April/May 24
1
What factors cause Rayleigh scattering in optical CO
BL1 May/June 12
fibers? 1
What are the causes for attenuation in optical fiber?
CO
Also, recall the expression for determining BL1 April/May 24
1
attenuation.
Plot attenuation versus wavelength for typical glass CO
BL1 Nov/Dec 22
fiber showing major attenuation windows. 1
2. CO
Define attenuation. BL1 Nov/Dec 17
1
CO
What are the causes of absorption? BL1 Nov/Dec 16
1
CO
Define attenuation coefficient of the fiber BL1 Nov/Dec 11
1
Define dispersion in multimode fibers. What is its CO
BL1 Nov/Dec 21
effect? 1
Define dispersion. Why intermodal dispersion is not CO
BL1 Nov/Dec 21
found in single mode fiber? 1
Distinguish between intermodal and intermodal CO
BL1 Nov/Dec 21
dispersion 1
Why graded index is less affected by dispersion that CO
BL1 Nov/Dec 21
3. step index multimode optical fiber? 1
Distinguish between intermodal and intermodal CO
BL1 Nov/Dec 18
dispersion 1
CO
What is intra modal dispersion? BL1 April/May 17
1
CO
Define group delay BL1 April/May 17
1
What are the two reasons for chromatic dispersion? CO BL1 Nov/Dec 12
 1
Define dispersion in multimode fibers. What is its CO
BL1 Nov/Dec 13
effect? 1
Differentiate between stimulated Brillouin scattering CO
BL1 April/May 24
and stimulated Raman scattering 1
4.
What are the most important nonlinear effects of CO
BL1 Nov/Dec 12
optical fiber communications? 1
A continuous 12 kms long optical fiber link has a loss
of 1.5 dB/km. what is the minimum optical power CO
BL1 Nov/Dec 21
that must be launched into the fiber to maintain an 1
optical power level of 0.3µW at the receiving end?
5.
A continuous 12 kms long optical fiber link has a loss
of 1.5 dB/km. what is the minimum optical power
CO1 BL1 Nov/Dec 13
that must be launched into the fiber to maintain an
optical power level of 0.3µW at the receiving end?
6. How silica fibers made? CO1 BL1 Nov/Dec 23
7. What is Inter symbol interference? CO1 BL1 Nov/Dec 23
8. State two characteristics of single mode fibers CO1 BL1 Nov/Dec 23
Differentiate dispersion shifted and dispersion
9. CO1 BL1 Nov/Dec 23
flattened fibers
150µW optical power is launched at the input of a 10
km long optical fiber link operating at850nm. The
output power available is 5µW. estimate the total
10. CO1 BL1 Nov/Dec 21
attenuation in dB over the link length neglecting all
connector and spice losses. What is the average
attenuation per km?
A 30km long optical fiber has an attenuation of
11. 0.8db/km. -7dBmof optical power is launched into the CO1 BL1 May/June 12
fiber; determine the output optical power in dBm.
12. What are the limitations of freedom of expression? CO1 BL1 April/May-24
13. What are the limitations of freedom of expression? CO1 BL1 April/May-24
14. What are the limitations of freedom of expression? CO1 BL1 April/May-24
15. What are the limitations of freedom of expression? CO1 BL1 -
16. What are the limitations of freedom of expression? CO1 BL1 -
17. What are the limitations of freedom of expression? CO1 BL1 -
18. What are the limitations of freedom of expression? CO1 BL1 -
19. What are the limitations of freedom of expression? CO1 BL1 -
20. What are the limitations of freedom of expression? CO1 BL1 -

PART – B & C [Min-10]

 AU
Q.
QUESTION CO BL Marks Questions
No.
Year
Describe how Mie scattering has impact on
April/May
transmission in optical fiber than Rayleigh CO1 BL1 6
24
scattering
What are nonlinear scattering losses in optical
CO1 BL1 13 Nov/Dec 23
fiber? explain
Explain about various scattering losses that
CO1 BL1 13 Nov/Dec 22
occur when light propagates through the fiber.
Discuss about nonlinear scattering process
that is associated with the generation of
acoustic phonon and compare it with similar CO1 BL1 13 Nov/Dec 21
1. process that generates high frequency optical
phonon.
Explain in detail about the scattering losses
April/May
that occur in an optical fiber with relevant CO1 BL1 4
18
diagrams and expression.
In detail, explain linear scattering losses. CO1 BL1 16 Nov/Dec 17
Describe linear and nonlinear scattering
CO1 BL1 8 Nov/Dec 12
losses in optical fibers.
Explain nonlinear scattering loss in optical
CO1 BL1 8 May/June 12
fiber
Explain in detail about the bending losses that
April/May
occur in an optical fiber with relevant CO1 BL1 4
2. 18
diagrams and expression.
Explain bending loss CO1 BL1 8 May/june 12
Explain how intersymbol interference affects April/May
CO1 BL1 13
the bandwidth in optical fiber communication. 24
3.
Explain how intersymbol interference affects
CO1 BL1 13 Nov/Dec 21
the bandwidth in optical fiber communication.
Write brief notes on: Material dispersion CO1 BL1 13 Nov/Dec 23
Discuss material and waveguide dispersions
April/May
mechanisms with necessary mathematical CO1 BL1 8
18
4. expressions.
With necessary expressions, write short note
CO1 BL1 13 Nov/Dec 22
on: [Link] dispersion
Explain material dispersion in optical fiber CO1 BL1 8 May/June 12
5. A 50 km long optical fiber link operating at CO1 BL3 13 April/May
850nm offers an average attenuation of 0.5 24
dB/km. an optical power of 100µW is
launched into the fiber at the input. What is
the value of the output at a distance of 30km
from the input? Also express the power in the
 µW and in dBm. What is the output power at
the end of the link?
Outline the characteristics of silica glass fiber April/May
CO1 BL1 7
with material absorption losses. 24
Explain the various attenuation mechanisms
CO1 BL1 13 Nov/Dec 23
in an optical fiber.
Describe the attenuation mechanisms in an
CO1 BL1 13 Nov/Dec 21
optical fiber.
Discuss about the absorption losses in optical
fibers and compare and contrast the intrinsic CO1 BL1 13 Nov/Dec 19
and extrinsic absorption mechanisms.
Describe the attenuation mechanisms in an
CO1 BL1 9 Nov/Dec 18
optical fiber
What are the causes of signal attenuation in April/May
CO1 BL1 16
optical fiber? Explain about it detail. 17
Discuss the attenuation encountered in optical
fiber communication due to: bending, CO1 BL1 12 Nov/Dec 13
scattering and absorption.
What are the limitations of freedom of
6. CO1 BL1 13 -
expression?
What are the limitations of freedom of
7. CO1 BL1 13 -
expression?
What are the limitations of freedom of
8. CO1 BL1 13 -
expression?
What are the limitations of freedom of
9. CO1 BL1 13 -
expression?
What are the limitations of freedom of
10. CO1 BL1 13 -
expression?
 UNIT – V – XXXXXXXXXXXXXXXXX
PART – A [Two Marks Questions with Answers] [Min-20]
AU
Q.
QUESTION CO BL Questions
No.
Year
CO
Define Rayleigh scattering BL1 April/May 24
1
CO
1. What is Rayleigh scattering? BL1 April/May 24
1
What factors cause Rayleigh scattering in optical CO
BL1 May/June 12
fibers? 1
What are the causes for attenuation in optical fiber?
CO
Also, recall the expression for determining BL1 April/May 24
1
attenuation.
Plot attenuation versus wavelength for typical glass CO
BL1 Nov/Dec 22
fiber showing major attenuation windows. 1
2. CO
Define attenuation. BL1 Nov/Dec 17
1
CO
What are the causes of absorption? BL1 Nov/Dec 16
1
CO
Define attenuation coefficient of the fiber BL1 Nov/Dec 11
1
Define dispersion in multimode fibers. What is its CO
BL1 Nov/Dec 21
effect? 1
Define dispersion. Why intermodal dispersion is not CO
BL1 Nov/Dec 21
found in single mode fiber? 1
3. Distinguish between intermodal and intermodal CO
BL1 Nov/Dec 21
dispersion 1
Why graded index is less affected by dispersion that CO
BL1 Nov/Dec 21
step index multimode optical fiber? 1
Distinguish between intermodal and intermodal CO BL1 Nov/Dec 18
 dispersion 1
CO
What is intra modal dispersion? BL1 April/May 17
1
CO
Define group delay BL1 April/May 17
1
CO
What are the two reasons for chromatic dispersion? BL1 Nov/Dec 12
1
Define dispersion in multimode fibers. What is its CO
BL1 Nov/Dec 13
effect? 1
Differentiate between stimulated Brillouin scattering CO
BL1 April/May 24
and stimulated Raman scattering 1
4.
What are the most important nonlinear effects of CO
BL1 Nov/Dec 12
optical fiber communications? 1
A continuous 12 kms long optical fiber link has a loss
of 1.5 dB/km. what is the minimum optical power CO
BL1 Nov/Dec 21
that must be launched into the fiber to maintain an 1
optical power level of 0.3µW at the receiving end?
5.
A continuous 12 kms long optical fiber link has a loss
of 1.5 dB/km. what is the minimum optical power
CO1 BL1 Nov/Dec 13
that must be launched into the fiber to maintain an
optical power level of 0.3µW at the receiving end?
6. How silica fibers made? CO1 BL1 Nov/Dec 23
7. What is Inter symbol interference? CO1 BL1 Nov/Dec 23
8. State two characteristics of single mode fibers CO1 BL1 Nov/Dec 23
Differentiate dispersion shifted and dispersion
9. CO1 BL1 Nov/Dec 23
flattened fibers
150µW optical power is launched at the input of a 10
km long optical fiber link operating at850nm. The
output power available is 5µW. estimate the total
10. CO1 BL1 Nov/Dec 21
attenuation in dB over the link length neglecting all
connector and spice losses. What is the average
attenuation per km?
A 30km long optical fiber has an attenuation of
11. 0.8db/km. -7dBmof optical power is launched into the CO1 BL1 May/June 12
fiber; determine the output optical power in dBm.
12. What are the limitations of freedom of expression? CO1 BL1 April/May-24
13. What are the limitations of freedom of expression? CO1 BL1 April/May-24
14. What are the limitations of freedom of expression? CO1 BL1 April/May-24
15. What are the limitations of freedom of expression? CO1 BL1 -
16. What are the limitations of freedom of expression? CO1 BL1 -
17. What are the limitations of freedom of expression? CO1 BL1 -
18. What are the limitations of freedom of expression? CO1 BL1 -
19. What are the limitations of freedom of expression? CO1 BL1 -
20. What are the limitations of freedom of expression? CO1 BL1 -

PART – B & C [Min-10]

AU
Q.
QUESTION CO BL Marks Questions
No.
Year
Describe how Mie scattering has impact on
April/May
transmission in optical fiber than Rayleigh CO1 BL1 6
24
scattering
What are nonlinear scattering losses in optical
CO1 BL1 13 Nov/Dec 23
fiber? explain
Explain about various scattering losses that
CO1 BL1 13 Nov/Dec 22
occur when light propagates through the fiber.
Discuss about nonlinear scattering process
that is associated with the generation of
acoustic phonon and compare it with similar CO1 BL1 13 Nov/Dec 21
1.
process that generates high frequency optical
phonon.
Explain in detail about the scattering losses
April/May
that occur in an optical fiber with relevant CO1 BL1 4
18
diagrams and expression.
In detail, explain linear scattering losses. CO1 BL1 16 Nov/Dec 17
Describe linear and nonlinear scattering
CO1 BL1 8 Nov/Dec 12
losses in optical fibers.
Explain nonlinear scattering loss in optical CO1 BL1 8 May/June 12
 fiber
Explain in detail about the bending losses that
April/May
occur in an optical fiber with relevant CO1 BL1 4
2. 18
diagrams and expression.
Explain bending loss CO1 BL1 8 May/june 12
Explain how intersymbol interference affects April/May
CO1 BL1 13
the bandwidth in optical fiber communication. 24
3.
Explain how intersymbol interference affects
CO1 BL1 13 Nov/Dec 21
the bandwidth in optical fiber communication.
Write brief notes on: Material dispersion CO1 BL1 13 Nov/Dec 23
Discuss material and waveguide dispersions
April/May
mechanisms with necessary mathematical CO1 BL1 8
18
4. expressions.
With necessary expressions, write short note
CO1 BL1 13 Nov/Dec 22
on: [Link] dispersion
Explain material dispersion in optical fiber CO1 BL1 8 May/June 12
A 50 km long optical fiber link operating at
850nm offers an average attenuation of 0.5
dB/km. an optical power of 100µW is
launched into the fiber at the input. What is April/May
CO1 BL3 13
the value of the output at a distance of 30km 24
from the input? Also express the power in the
µW and in dBm. What is the output power at
the end of the link?
Outline the characteristics of silica glass fiber April/May
CO1 BL1 7
with material absorption losses. 24
Explain the various attenuation mechanisms
CO1 BL1 13 Nov/Dec 23
in an optical fiber.
5.
Describe the attenuation mechanisms in an
CO1 BL1 13 Nov/Dec 21
optical fiber.
Discuss about the absorption losses in optical
fibers and compare and contrast the intrinsic CO1 BL1 13 Nov/Dec 19
and extrinsic absorption mechanisms.
Describe the attenuation mechanisms in an
CO1 BL1 9 Nov/Dec 18
optical fiber
What are the causes of signal attenuation in April/May
CO1 BL1 16
optical fiber? Explain about it detail. 17
Discuss the attenuation encountered in optical
fiber communication due to: bending, CO1 BL1 12 Nov/Dec 13
scattering and absorption.
What are the limitations of freedom of
6. CO1 BL1 13 -
expression?
What are the limitations of freedom of
7. CO1 BL1 13 -
expression?
8. What are the limitations of freedom of CO1 BL1 13 -
 expression?
What are the limitations of freedom of
9. CO1 BL1 13 -
expression?
What are the limitations of freedom of
10. CO1 BL1 13 -
expression?

MINIMUM PASS MATERIALS

(Care Must be taken while Preparing)
Degree & Branch Academic Year
Year / Sem. Regulation
Course Name Course Code
Name of the Faculty Designation

UNIT – I – XXXXXXXXXXXXXXXXX
(Short – Key notes for the slow learners – Preferably Answers for Part – B Questions from
the Question Bank)
UNIT – II – XXXXXXXXXXXXXXXXX
(Short – Key notes for the slow learners – Preferably Answers for Part – B Questions from
the Question Bank)
UNIT – III – XXXXXXXXXXXXXXXXX
(Short – Key notes for the slow learners – Preferably Answers for Part – B Questions from
the Question Bank)
 UNIT – IV – XXXXXXXXXXXXXXXXX
(Short – Key notes for the slow learners – Preferably Answers for Part – B Questions from
the Question Bank)
UNIT – V – XXXXXXXXXXXXXXXXX
(Short – Key notes for the slow learners – Preferably Answers for Part – B Questions from
the Question Bank)