GOVERNMENT POLYTECHNIC, KOTDWAR

MID TERM (2023-24) Summer

Total Duration (HH:MM): 2:00

Course Name: Data Structure Using C Program Name- CSE(IV SEM)

On completion of this course student will be able to:
C403.1. Understand the concept of top down, bottom up approach of algorithm design, space and
time complexity.
C403.2. Understand basic data structures such as arrays, linked lists, stacks and queues. Properties of Recursive
algorithms/functions
C403.3. Explain Linked lists and its implementation
C403.4. Solve problem involving graphs, trees and heaps
C403.5. Apply Algorithm for solving problems like sorting, searching, insertion and deletion of data.
Attempt all questions, Each carry 1 marks. Total Marks 50
Part A Total Marks 10
Q.No Questions Marks CO BL PO Unit DL
1 What is a data structure? 1 1 1 1 1
a) A programming language
b) A collection of algorithms
c) A way to store and organize data
d) A type of computer hardware
2 Which data structure is used for implementing recursion? 1 2 1 3 1
a) Stack b) Queue c) List d) Array
3 Which of the following is not the type of queue? 1 2 1 4 1
a) Priority queue
b) Circular queue
c) Single ended queue
d) Ordinary queue
4 What is a Dequeue? 1 2 1 4 1
a) A queue implemented with both singly and doubly linked lists
b) A queue with insert/delete defined for front side of the queue
c) A queue with insert/delete defined for both front and rear ends of
the queue
d) A queue implemented with a doubly linked list
5 Which data structure is based on the Last In First Out (LIFO) 1 2 1 2 1
principle?
a) Tree
b) Linked List
c) Stack
d) Queue
6 Which of the following represents the Postorder Traversal of a 1 4 1 6 1
Binary Tree? (a)Left Right Root
(b) Left Root Right
(c) Right Left Root
(d) Right Root Left
7 Draw direct weighted graph . 1 4 1 7 1
8 The data structure required for Breadth First Search Traversal on a 1 4 1 7 1
graph is? a)
Array b) Stack c) Tree d) Queue
9 The data structure required for Depth First Search Traversal on a 1 4 1 7 1
graph is? a)
Array b) Stack c) Tree d) Queue
10 Time complexity means how much computer space is required to 1 1 1 1 1
 run an algorithm(T/F)

Part B Attempt all questions, Each carry 3 marks Total Marks 15

Q.No Questions Marks CO BL PO Unit DL
11 Differentiate Between Preemptive and Non Preemptive Data Structure 3 1 2 1 2
?
OR
Differentiate Between Top Down approach and Bottom Up approach
in Data Structure .
12 Define Advantages and Disadvantages of Recursion ? 3 2 1 3 1
Or
Define Tower Of Hanoi Problem ?
13 Solve the following tree using BFS and DFS traversal. 3 4 2 7 2

14 Differentiate Between Lined List and Sequential List? 3 3 2 5 2

15 Describe circular queue with their operation ? 3 4 1 4 1
Or
Define Dequeue and Priority Queue ?

Part C Attempt all questions, Each carry 5 marks Total Marks 25

Q.No Questions Marks CO BL PO Unit DL
16 Conversion of infix to post fix using stack 5 2 2 2 3
K+L-M*N+(O^P)*W/U/V*T+Q
17 Traverse the given tree using Inorder ,Preorder ,Postorder ? 4 3 6 3

18 Construct a binary search tree for following elements: 5 4 3 6 3

30,100,90,15,2,25,36,72,78,10 show each step of construction of BST.
19 Give adjacency list and adjacency matrix for given graph: 5 4 3 7 3

20 Sort the following number using Bubble sort or Selection sort : 6 5 3 5 5 5 8 3

18724
BL : Bloom’s Taxonomy Levels
(1- Remembering, 2- Understanding, 3 – Applying, 4 – Analyzing, 5 – Evaluating, 6 - Creating)
CO : Course Outcomes
PO : Program Outcomes
PI : Performance Indicator
DL : Difficulty level (Low-1, Medium-2, High-3)