NOR SIE77%

@
Total No. of Questions : 12]
ror [5873]-302
First Year M.C.A. (Engineering) 4 = 5 / 4 5
DATA STRUCTURES ANDALGORITHMS
(2020 Pattern) (Semester - I) (310902)
Time : 20 Hours] [Max. Marks : 70
Instructions to the candidates:
1) Neat diagrams must be drawn wherever necessary.
2) Figurs to the right side indicate full marks.
3) Assume suitable data if necessary.
Q1) a) Explain any one Linear & Non Linear Data structure. 0]
b) Explain the term complexity of Algorithm 0]
OR
02)a) Explain the Triplet representation of Sparce Matrix. 16]
b) Explain the term Divide and Conquer for algorithm design. 0]
03)a) Write a C program to create a simple linked list with 3 modes. 16]
b) Explain with example insertion of a node. 16]
OR
Q4)a) Explain the reverse operation of linked list. 16]
b) Write a note on implementation of Circular Linked List. 16]
05)a) Write a C program to test stack full and stack empty conditions.
[6]
b) Write a note on - Applications of Queue as a Data Structure. [EB]
OR
06) a) Explain the code for insertion and deletion from Stack. 0]
b) Write a C program to implement Circular Queue. EB]
PIO.
07) a) Can you tell how linear data structures differ from non-linear
data
structures? 16]
b) What is a tree? What are the applications of trees? 5)
OR
08) a) How to implement a tree concept in data structure using C
language?[6]
b) Write down the Applications of binary tree in details. 151
09) a) Explain the scenarios where you can use Graph concept with
suitable
example 16]
b) Differentiate depth first search and breadth first search technique in
detail.
0]
OR
©10)3) Whats spanning tree explain spanning tree in detail with example?
[6]
b) Demonstrate the use of Dikjtra’s Single source shortest path. 16]
QI1)a) Which searching technique is best in data structure? Why? 16]
b) List out the types of sorting available in Data Structures. 16]
OR
012)3) What is the purpose of quick sort and advantage? 16]
b) Write a program to implement bubble sort concept. 16]
Leow
A
[8731-302 B >
{1
O
A
=e