Scribd
Upload
74 views

Data Structure

1. The document is a question paper for the course "Data Structures" with 5 sections containing 15 questions in total. 2. The questions cover a range of topics related to data structures including linked lists, trees, graphs, sorting, and algorithms. 3. The questions are mapped to the course outcomes and Bloom's taxonomy levels to assess different cognitive skills.

Uploaded by

ranaashutosh698
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views

Data Structure

1. The document is a question paper for the course "Data Structures" with 5 sections containing 15 questions in total. 2. The questions cover a range of topics related to data structures including linked lists, trees, graphs, sorting, and algorithms. 3. The questions are mapped to the course outcomes and Bloom's taxonomy levels to assess different cognitive skills.

Uploaded by

ranaashutosh698
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CourseName:Data Structures

CourseOutcomes(CO):
1. Discuss the C language features and analyze the differences between recursive and
iterative programming structures
2. Analyze the role of data structures in structuring and manipulating data and
implement them using array or list representation
3. Discuss the properties, operations, applications, strengths and weaknesses of the
different data structures and their effect on algorithms
4. Implement abstract data type for Tree non-List linear data structure and apply them to
problem solutions.
5. Discuss the file structures and storage management for efficient access of data

Question Paper
Total Duration (H:M): 3:00
Course: Data Structures
Maximum Marks: 100

Note:Attempt all questions.

Q. No Questions Marks CO BL

1a) When doubly Linked list can be represented as a Circular linked list? 4 CO3 L2

1b) Difference between Linear data Structure and non-linear data structure?
6 CO4 L4

1c) Write all the steps to convert a general tree into a binary tree with neat 10 CO4 L2
labeled flow diagram.

2a) You are given an unsorted array A = A [1 ...n] containing n distinct 4 CO2 L5
integers. Design an
algorithm that outputs the smallest k elements in the array A. The running
time of your algorithm
should be O (n + k log n). Give pseudocode and discuss running time.

2b) What are enqueue and dequeue operations? 6 CO3 L2

2c) Given Infix Expression: ( ( H * ( ( ( ( A + ( ( B + C ) * D ) ) * F ) * G ) * E 10 CO1 L5


) ) + J ) ; convert it into post fix and prefix notation?
3a) Prove that the maximum number of edges that a graph with n Vertices is 4 CO4 L4
n*(n-1)/2.

3b) How the queue is implemented by linked list and discuss all the steps and 6 CO3 L2
algorithms for insert and delete from the queue is implemented by linked
list.
3c) a. List out the steps involved in deleting a node from a binary search tree. 10 CO2 L3
b. Write the advantages of threaded binary trees.

4a) Define a heap. How can it be used to represent a priority queue? 4 CO5 L2

4b) Define sorting and what do you mean by internal and external sorting? 6 CO5 L2

4c) How is the insertion sort done with the array and also write a pseudocode 10 CO1 L2
for insertion sort?

5a) Disadvantages of Array over Linked List and also mention disadvantages 4 CO2 L5
of linked list over array?

5b) Difference between Stack queue and linked list and explain how do you 6 CO2 L5
test for an empty stack?

5c) Given the following AVL Tree: 10 CO4 L2

(a) Draw the resulting BST after 5 is removed, but before any rebalancing
takes place. Label each node in the resulting tree with its balance factor.
Replace a node with both children using an appropriate value from the
node's left child.

(b) Now rebalance the tree that results from (a). Draw a new tree for each
rotation that occurs when rebalancing the AVL Tree (you only need to
draw one tree that results from an RL or LR rotation). You do not need to
label these trees with balance factors.
BLOOM'S LEVEL WISE COURSE OUTCOMEWISE
MARKS DISTRIBUTION MARKS DISTRIBUTION
35 30
30
24
25 20
20 16
24%
15 10
10% 56% 10
10% 5
0
CO1 CO2 CO3 CO4 CO5

Level 2 Level 3 Level 4 Level 5 Marks

BL–Bloom’sTaxonomyLevels(1-Remembering,2-Understanding,3 –Applying,4–
Analyzing,5 –Evaluating,6-Creating)
CO–CourseOutcomes

You might also like