Model Question Paper
Code: 23CS2T01 R23
SWARNANDHRA COLLEGE OF ENGINEERING & TECHNOLOGY
[AUTONOMOUS]
Seetharampuram, NARSAPUR-534 280
B. Tech II Semester Regular Examinations
DATA STRUCTURES
(Common for all CSE, IT, AIML, DS, BS, CS & AIDS Branches)
---------------------------------------------------------------------------------------------------------------------
Note: 1. The question paper consists of two parts (Part-A and Part-B)
2. Answer all questions from Part-A
3. Answer all questions from Part-B with either or choice
Duration: 3 Hours Max Marks: 70
PART-A (5x2=10M)
S No Question Cognitive CO Mark
Level s
1 a Define Data Structure and list out types. K1 1 2
b Differentiate Double and Circular linked lists. K2 2 2
c List out the applications of stack. K3 3 2
d Define Deques K1 4 2
e Differentiate binary tree and binary search tree K2 5 2
PART – B (5X12 = 60 M)
Cognitive Mark
S. No Question CO
Level s
Explain algorithm of quick sort and sort the following values using
a K3 1 6
2 quick sort. 23,3,5,45,6 ,78,11,13,1
b Write a C program for binary search and explain with example K3 1 6
OR
a Write a C Program for Merge Sort. Explain with example. K2 1 6
3 What is abstract data type (ADT) ? Explain how ADT can be
b implemented as different Data Structure. K2 1 6
Write a C program to implement creation and display of single
a K3 2 8
linked list.
4 Differentiate singly linked list, Doubly linked list, Circular linked
b list. K2 2 4
OR
Write a C program to implement Insertion operation on Double
a K3 2 8
5 linked list.
b Explain about Circular Linked lists and its Applications. K2 2 4
Write a C program to implement stacks using arrays which should
a K3 3 6
support the following operations: i. PUSH ii. POP iii. DISPLAY
6 Evaluate the following postfix expression using stack.
b 734+-245/+*6/7+ K3 3 6
OR
Convert the following infix expression to postfix expression using
a K3 3 6
7 stack. A+ B*C-(D/E^F)*G
b Discuss algorithm to convert infix to postfix. K3 3 6
8 a Explain Queue? Develop Queue using arrays. K4 4 6
b Implement of queues using linked list? K2 4 6
OR
9 a What is the Queue and advantages of circular queues K2 4 6
b List types of queues and explain circular queues K2 4 6
10 a What is a Binary Tree? How to represent binary tree? Explain. K2 5 6
Explain binary search tree properties and implement for following
b K3 5 6
values {13,3,4,12,14,10,5,1,8,2,7,9,11,6,18}
OR
a Discuss in detail about Collision Resolution Techniques. K2 5 6
11
b Explain about Graph Traversals. K2 5 6