Time :3 Hours 

Paper Name: Data Structures & Algorithms 

Each question is of five marks 

S.No 

1 

2. 

3 

4. 

5. 

6. 

7. 

S.No 

1) 

Question 

Department of Computer Science & Engineering 

School of Engineering Sciences & Technology 

New Delhi-110062 

JAMIA HAMDARD 

Section A 

How can we implement stack using Queue? 

All Questions are Compulsory in this section 

What is binary search of an element? Write a Program to 
find an element in an array using binary search. 

What is mergesort algorithm. Explain 
What are multidimensional arrays? Consider a 20x10 2D 
array which has its base address = 100 and the size of an 
element =3. Now compute the address of the element, A 
[10][4]. Assume that elements are stored in row major order. 

Explain heap as a data structure. Build a Max Heap by 
investing the following data arriving as a sequential set 

Question 

23, 7, 92, 6, 12 14, 40, 44, 20, 21. Show the heap 
after deleting 2 elements. 

Each question is of 10 Marks 

What is a linked list? Explain its types and creation. 

Explain ADT of a queue with an examnple. Implement queue 5 
using C. Also Explain Applications of a queue. 

Section B 

Paper Code: MCA 202 

Maximum Marks: 75 

Attempt any four 

(a) Convert the following infix expression to postfix expression: 
A+ (B*C- (D/E^F) *G) *H 

(b) Evaluate the following postfix expression: 

Marks 

5 

5 

5 

7*5-35 Marks 

CO 

ks 

CO2 

10 

C04 

CO4 

CO1 

CO2 

CO3 

4*10=40 marks 

CO4 

BL 

L2 

L1 

L3 

L5 

L6 

L4 

Mar CO BL. 

L3 

C02 LS 



3) 

What is searching? Write a C program to perform searching 
2) operations using lincar and binary search 

4) 

5) 

6) 

623+-382/+*2^3+ 

(NOTE: Write intermediate steps of conversion) 

You are given a set ofn types of rectangular 3-D boxes, where the ith 
box has height h(i),width w(i) and depth d(i) (all real numbers). You 
want to create a stack of boxes which is as tall as possible, but you 
can only stack a box on top of another box, If the dimensions of the 
2-D base of the lower box are each strictly larger than those of the 2 

D base of the higher box. Of course, you can rotate a bOx so that any 
side functions as its base. It is also allowable to use multiple instances 
of the same type of box. 

Explain how shortest path is calculated using Dijkstra's algorithm. 

Define M-way trees. Build a B-tree of order 4 by inserting data in the 
sequence given below: 92, 24, 6, 7, 11, 8, 22, 4, 5, 16, 19, 20, 78 

B 

3 

2 

10 

What is a minimum spanning tree? Give Kruskal's algorithm to find a 
minimum spanning tree. Determine the minimum spanning tree of the 10 
following graph: 

H 

10 

10 

10 

BL-Bloom's Taxonomy Levels (1-Remembering, 2- Understanding, 3-Applying, 4 -
Analysing, 5- Evaluating, 6- Creating) 

C04 L6 

C02 L6 

COS L4 

CO3 L2 

CO3 L4 



{ "type": "Document", "isBackSide": false }


{ "type": "Document", "isBackSide": false }