DATE: 29.08.

24
ANNAPOORANA ENGINEERING COLLEGE,SALEM
(An AUTONOMOUS Institution)

B.E./B.Tech, M.E.- DEGREE INTERNAL EXAMINATION - I, NOV./DEC.- 2024

Semester III
INFORMATION TECHNOLOGY
22IT301- Data Structures And Algorithms
Regulations - 2022
Time : 1.30 Hours Maximum : 50 Marks
PART – A (8 x 1 = 8 Marks) Multiple Choice Questions
Q.No. CO BTL
Answer All Questions
1. The data structure required to check whether an expression contains a balanced CO1
parenthesis is?
a) Queue b) Stack c) Tree d) Array
2. If a class inheriting an abstract class does not define all of its functions then it is CO1
known as?
a) Abstract b) A simple class c) Static class d) None of the mentioned
3. CHOOSE the worst case time complexity inserting n elements in to empty CO1
linked list,if the linked list nodes are arranged in sorted order.
a)ϴ(n) b) ϴ(n log n) c) ϴ(n2) d) ϴ(1)
4. Which of the following is the application of data structures? CO1
a) Image processing b) Decision making
c) Blockchain d) All of the above
5. Which of the following applications can be efficiently implemented using a CO2
stack?
a)Reversing a string b) Level-order traversal of a tree
c) Sorting a list d) Searching in an array

6. Which of the following is not the type of queue? CO2

a)Priority queue b)Single-ended queue c)Circular queue d)Ordinaryqueue
7. A queue is also called a _______________Syatem CO2
a)FIFO b)LIFO c)FILO d)LILO
8. Process of inserting an element in stack is called ____________ CO2
a) Create b) Push c) Evaluation d) Pop

Q.No. PART- B (4×3 = 12 Marks)

CO BTL
Answer All Questions
9. List the area of applications of Data Structure. CO1 K1
10. Discuss Asymptotic Notation. CO1 K1
11. State the properties of LIST abstract datatype with suitable example CO2 K1
12. Write the stack overflow condition. CO2 K3
PART – C (2 X 15 = 30 Marks)
Q.No. Answer All Questions (Marks split up may be 15 / 10+5 / 8 + Marks CO BTL
7 )
Illustrate with examples how ADTs can be implemented
13. (a) (i) 8 CO1 K4
using classes in Python.
Discuss the concept of inheritance in Object-Oriented
(ii) 7 CO1 K2
Programming
(Or)
Provide detailed examples to demonstrate how asymbolic
(b) (i) notations are used to analyze and compare the time 8 CO1 K3
complexity of algorithms.
(ii) Demonstrate Divide and Conquer Algorithm 7 CO1 K2
Illustrate the concept with a Python example, where you
14. (a) (i) 8 CO2 K4
implement a basic List ADT using an array
 Compare the efficiency of linked lists with other data
(ii) 7 CO2 K2
structures
(or)
Define the Queue ADT and describe its key operations
(b) (i) 8 CO2 K1
(enqueue, dequeue, front/peek, is Empty).
Explain how deques can be implemented using arrays and
(ii) 7 CO2 K5
doubly linked lists
Table of Specification

LOTS HOTS
Blooms Remembering Understanding Applying Analyzing Evaluating Create Total
(K1) (K2) (K3) (K4) (K5) (K6)
Marks
%

Prepared by HoD