Roll No.
ARASU ENGINEERING COLLEGE, KUMBAKONAM-612 501
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Model Examination
Year/Sem./Branch : II/III/CSE Max. Marks : 100
Sub. Code & Name : CS3301& Data Structures Duration : 3 hours
Date & Session:
The Model Examination is used to assess the course outcomes CO1 to CO5, Lower Order Thinking
(LOT) and Higher Order Thinking (HOT) of the course.
K1 – Remembering K2 – Understanding. K3 – Applying
K4 – Analyzing. K5 – Evaluating. K6 – Creating
COURSE
COURSE OUTCOMES (COs)
CODE
C203.1 Understand and implement Linked List ADT
C203.2 Design and implement the operations of Stack & Queue
C203.3 Understand, implement and apply Tree Data Structure
C203.4 Design, implement and apply Graph Data Structure
C203.5 Analyze, design and implement various Searching, Sorting and Hashing techniques
Answer all the questions
Part – A (10 X 2 = 20 Marks)
1. Compare linear and nonlinear data structures with an example. [CO1,LOT,K2]
2. List the advantages of doubly linked list. [CO1,LOT,K1]
3. Give the syntax for underflow and overflow conditions in stack. [CO2,LOT,K2]
4. Convert the infix expression (a+b)*(c-d) to prefix expression. [CO2,LOT,K3]
5. What is heap? Outline the properties of heap. [CO3,LOT,K1]
6. List the types of rotations performed on AVL tree. [CO3,LOT,K1]
7. Compare B tree and B+ tree. [CO4,LOT,K2]
8. State the use of topological sort. [CO4,LOT,K1]
9. What is a hash function? [CO5,LOT,K1]
10. Compare searching and sorting. [CO5,LOT,K2]
. Answer any 5 questions
Part – B (5 X 13 = 65 Marks)
11.a Explain how list operations can be implemented using arrays.
[CO1, HOT,K4]
(Or)
b. How can a polynomial be represented as a linked list? Outline the
algorithm for addition of two polynomials using linked lists with an [CO1, HOT,K4]
example.
12. a Develop an algorithm for insertion and deletion operations on stack
[CO2, HOT,K4]
using linked list.
(Or)
b. Explain the addition and deletion operations performed on a circular
[CO2, HOT,K4]
queue with an example.
13. a. Construct a binary search tree for the following input [CO3, HOT,K5]
14,15,4,9,7,18,3,5,16,4,20,17.Write the routines for insertion.
(Or)
b. Explain the tree traversal techniques with an example. [CO3, HOT,K4]
14.a. Explain about B+ trees with algorithms to insert a node into a B+ tree.
[CO4, HOT,K4]
(Or)
b. Discuss the breadth first traversal and depth first search traversal of a
[CO4, HOT,K4]
graph with an example.
15.a Develop an algorithm to implement bubble sort with suitable example.
[CO5, HOT,K5]
(Or)
b. Explain the common collision resolution strategies used in hashing
system. [CO5, HOT,K4]
Part – C (1 X 15 = 15 Marks)
16. a Apply kruskal’s algorithm to find a minimum spanning tree for the
following graph.
[CO4, HOT,K6]
(Or)
b. Outline the steps in the insertion sort algorithm and apply the algorithm
for the numbers given below [CO5, HOT,K6]
12,06,14,02,01,04,03
