Scribd
Upload
58 views4 pages

DATA STRUCTURES_Lateral Entry

This document outlines the examination paper for the 3rd semester Data Structures course for various branches of engineering. It consists of two parts, with Part A containing multiple questions related to data structures, algorithms, and their applications, while Part B includes more in-depth questions requiring algorithms and evaluations. The paper assesses students' understanding of linear and non-linear data structures, sorting and searching mechanisms, and graph theory.

Uploaded by

Subhankar Sahu
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
58 views4 pages

DATA STRUCTURES_Lateral Entry

This document outlines the examination paper for the 3rd semester Data Structures course for various branches of engineering. It consists of two parts, with Part A containing multiple questions related to data structures, algorithms, and their applications, while Part B includes more in-depth questions requiring algorithms and evaluations. The paper assesses students' understanding of linear and non-linear data structures, sorting and searching mechanisms, and graph theory.

Uploaded by

Subhankar Sahu
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/ 4

Registration No.

Total number of printed pages –04 B.Tech


CSE23304/CS20131

3rd SEMESTER (REGULAR/BACK) EXAMINATION – 2021


DATA STRUCTURES
BRANCH: CSIT/CSSE/CS/CC/DS/WT/CSFE/CSE/CE/AIML
Time – 3 Hours
Full Marks – 100
Answer all Questions from Part – A and Part – B
The figures in the right-hand margin indicate marks

PART – A

1. Answer the following questions: [2 x 15]


(a) Convert the following infix expression into postfix expression: P+Q*(R+S)/(U+V).
(b) A 2D array X [50][30] and each element of matrix takes 3 bytes of memory. The base
address starts at X [0][0] and it's 4000, if the matrix X is stored in row major order,
calculate the address of X [5][4].
(c) Write the Difference between single and doubly linked list.
(d) State the purpose of push and pop.
(e) Mention the output generated by the following program for the single linked list, where
start is a pointer holds the address of node A and the list elements are
A->B->C->D->E->F->G.
void ENDSEM () {
struct node *ptr = start;
while (ptr -> next! =NULL)
{
ptr = ptr->next;
printf(“%c”, ptr -> info);
ptr = ptr->next;
}
}
(f) Represent Adjacency matrix of a graph with suitable example.
(g) List out the applications of Stack.
(h) Explain the working principle of binary search method.
(i) Write the node structure to represent nodes of a doubly and circular linked list.

1
(j) Int fun (int x, int y)
{
if (y==0)
return x;
else
return fun (y-2, x+y);
}
What does the above recursive function returns if x=3 and y=4.

(k) Differentiate between min and max heap.


(l) Define balance factor of a node in a height balanced tree. Find the balance factor of all the
nodes of the tree which is given below and check if the tree is balanced or not.

(m) what is searching? Define Linear search with a suitable example.


(n) Define the term shortest path in a graph with a real time example.
(o) Write the difference between Binary tree and Binary search tree.

PART - B
2.Answer any two: [7 x 2]
(a)Convert the given infix expression A+(B*C+(D/E^F)) into its postfix expression and
evaluate the same using stack. Here A=3, B=5, C=2, D=14, E=7, F=1.

(b) Explain about the data structure Queue. Write the algorithm to insert and delete of an
element to or from the queue.

(c)Write the steps to evaluate a prefix expression. Evaluate the following expression

written in prefix form by using stack and show the stack content for each step.

Prefix Expression: ^ / * + 8 / 6 3 2 5 4

2
3. Answer any two: [7 x 2]

(a) Write an algorithm to insert new node at the specific position and at the end of a
circular linked list.

(b) Write an algorithm to insert new node at the specific position and at the end of a
doubly linked list.

(c) Implement queue using linked list.

4. Answer any two: [7 x 2]

(a) Develop a binary search tree resulting after inserting the following integer keys 35, 46,
25, 12, 18, 55, 60, 28. (i) Determine the level of the tree (ii) Write post order and pre
order traversals.

(b) Discuss AVL tree and mention the need of rotations. Construct the AVL tree from the
given data: 15, 20, 24, 10, 13, 7, 30, 36, 25.

(c) What is a binary tree? Construct a binary tree given the pre-order traversal and inorder
traversals as follows:
Pre-Order Traversal: G B Q A C K F P D E R H
In-Order Traversal: Q B K C F A G P E D H R

5. Answer the followings: [7 x 2]

(a) Show how the Floyd Warshall algorithm works on following graphs. The source
vertices are denoted by circle.

.
3
(b) Name the data structures used for Breadth first traversal of a graph. By using Breadth
first search (BFS) algorithm, clearly discuss the steps to find the sequence in which
vertices of the following graph are traversed starting from vertex “e “.

6. Answer the followings: [7X2]

(a) You are using some sorting algorithm for the given numbers 10,80,20,40,5,15 to sort it
in ascending order. Perform Quick sort for the following elements. Explain all passes
for Quick sort.

(b) Discuss hashing mechanism with proper example. Explain collision resolution
technique in hashing with suitable example.

COs Questions Total


Mark
CO1 Analyze and design of linear data
Q1.a + Q1.b + Q1.d + Q1.g + Q1.j + Q2.a 31
structure such as Queue, Stack and Array
+ Q2.b + Q2.c = (2+2+2+2+2+7+7+7)
for solving problems

CO2 Analyze and design of linear data Q1.c + Q1.e + Q1.i + Q3.a + Q3.b + Q3.c
27
structure such as Linked List for solving = (2+2+2 +7+7+7)
problems.

CO3 Analyze and design of non-linear data Q1.l + Q1.o + Q1.h + Q4.a + Q4.b + Q4.c 27
structure such as Tree for solving = (2+2+2+7+7+7)
problems.

CO4 Analyze and design of non-linear data Q1.f +Q1.n+ Q5.a + Q5.b =(2+2+7+7) 18
structure such as Graph for solving
problems.

CO5 Use different sorting and searching Q1.k + Q1.m + Q6.a + Q6.b = (2+2+7+7) 18
mechanisms by analyzing suitability.

Course Outcome Assessment Scheme

You might also like