Scribd
Upload
17 views3 pages

Mid Term Exam Q. Paper

This document contains information about the mid term test for the Data Structures course at Jawaharlal Institute of Technology & Science. It lists two questions for the test, each with two sub-questions worth 5 marks each. Question 1 deals with data structures like linked lists, trees, and memory allocation. Question 2 involves tree and graph algorithms like expression conversions, traversals, shortest path, and minimal spanning trees. The test is for second year third semester BTech students in Computer Science & Engineering and will last 1 hour and 30 minutes with a maximum of 20 marks.

Uploaded by

Devendra Singh Kaushal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views3 pages

Mid Term Exam Q. Paper

This document contains information about the mid term test for the Data Structures course at Jawaharlal Institute of Technology & Science. It lists two questions for the test, each with two sub-questions worth 5 marks each. Question 1 deals with data structures like linked lists, trees, and memory allocation. Question 2 involves tree and graph algorithms like expression conversions, traversals, shortest path, and minimal spanning trees. The test is for second year third semester BTech students in Computer Science & Engineering and will last 1 hour and 30 minutes with a maximum of 20 marks.

Uploaded by

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

JAWAHARLAL INSTITUTE OF TECHNOLOGY & SCIENCE

COMPUTER SCEINCE & ENGINEERING DEPARTMENT


SESSION JULY-DEC 2023

MID TERM TEST- I

CLASS- BTECH II YEAR III SEM

CS-303 Data Structure

TIME: 1 HR 30 MIN MAX MARKS: 20

Marks
Q. No. Question Description CO BL PO
Allotted
Q.1 (A) Describe the common operation performed on
1 1 2,3 5
data structure.
(B) Discuss the algorithm for insertion at a specified
1 1 2,3 5
position in the linked list.
OR
Q.1 (A) How memory allocation done in C language?
Discuss dynamic memory allocation. 1 2 2,3 5

(B) How elements are inserted and deleted in a single


link list. Explain with diagram. 1 2 2,3 5

Q.2(A) Explain the concept of recursion with example.


2 1 2,3,4 5
(B) Convert the following infix expression to postfix
expression. Show all the steps.
1/- A $ B * C – D + E / F / ( G + H )
2 3 2,3,4 5
2/- ( ( A + B ) * C - ( D – E ) ) $ ( F + G )

OR
Q.2(A) What is stack and how it is implemented using
2 1 2,3,4 5
array?
(B) Convert the following infix expression to postfix
expression. Show all the steps.
1/- A $ B * C – D + E / F / ( G + H ) 2 3 2,3,4 5
2/- ( ( A + B ) * C - ( D – E ) ) $ ( F + G )
** ***** *** **** ****
JAWAHARLAL INSTITUTE OF TECHNOLOGY & SCIENCE
COMPUTER SCEINCE & ENGINEERING DEPARTMENT
SESSION JULY-DEC 2023

MID TERM TEST- II

CLASS- BTECH II YEAR III SEM

CS-303 Data Structure

TIME: 1 HR 30 MIN MAX MARKS: 20

Marks
Q. No. Question Description CO BL PO
Allotted
Q.1 (A) Apply Inorder, Preorder and Postorder traversals
on the given Tree.

3 3 2,3 5

(B) How would you describe the different techniques


that are used to maintain binary trees in memory?
3 2 2,3 5
Explain by giving example.

OR
Q.1 (A) Following nodes are insert in to empty tree in
order:
5,16,22,45,2,10,18,30,50,12,1
3 3 2,3 5
Construct: i) Binary Search Tree.
ii) AVL Tree.

(B) How would you compare between the following:


i) B Tree Vs B+ Tree
3 2 2,3 5
ii) Strictly Binary Tree Vs Complete Binary Tree

Q.2(A) Find the shortest path between a to f using


4 3 2,3,4 5
Dijkastra Algorithm.
(B) How would you differentiate between Depth First
Search and Breath First Search. 4 2 2,3,4 5

OR
Q.2(A) Calculate the minimal spanning tree from the
given graph with weighted edges.

4 3 2,3,4 5

(B) Write Prim’s algorithm for minimum spanning


4 3 2,3,4 5
tree with example.

** ***** *** **** ****

You might also like