4018-02 Printed Pages: 8|

MCA(2 Ycars) (Sem.-1) Examination, 2021

(Session : 2020-22 )
DATA STRUCTURE AND
ALGORITHMS WITH 'C'
Subject Code: PPU-MCA-CC-2 |
Time:Three Hours] Maximum Marks: 70
Note Candidates are
required to
m
give their answers in their own
co
words as far as
practicable. Section A is
cormpulsory
b.

consisting of ten
questions carrying 02 marks each
hu

Section-B contains six questions

ia

carrying 05 marks each

ed

and students have to

attempt any four questions.
Section-C contains five questions
m

carrying 10 marks each

am

and students have

to attempt any three questions.
ex

Section-A
Note Multiple choice questions [2x10-20]
) The size of both Stack and heap remains the
same
during run time :

True
4018-02/520 (1) PT.O.]
 for th
Array in preferrad over tinked lis
mplementaftion of
( No And

Radix S o
None of theee (a)

Insertion Sort
i8 an exampie of non-inear (b)
WhHth of the folowng

ate t v Binary Search

Polynomial Evaluation

m
(d)

node is
The number of edges from the root to the

co
Array ()
called of the tree

.
Linked LIst

ub
(a) Height
Queue
( Depth

ah
Which of the following is an example of static
(c) Length
memory aliocation ?
i
ed
(d) Width
Tree
m

vi) What is full binary tree?

Array
am

Each node has exactly zero or twvo

(c) Linked List
children
ex

(d) All of the above

(b) Each node has exactly two children

018-02/520 2
4018-02/520 (3 [PT.O.]
 are at the same level
All the leaves (a) (n*(n+1))/2

Each node has exactly one or two children

(d) (b) (n*(n-1))/2

case time complexity for

(Vii) What is the average (c) n

finding the height ofthe Binary tree?

(d) Insufficient information

(a) h=O(log log n)

(x) A connected planar graph having 6 vertices, 7

(b) h=O(n log n) edges contains . . regions.

om
h=O(n) (a) 15

c
h=O(log n) 3

b.
In a full Binary tree if number of internal nodes is (c) 1
(vii)

hu
1, then number. of leaves L are?
(d) 11

ia
(a) L =2*/
Section-B
ed
L =I+1
Note: Answer any four
questions of the following I4x5=20]
m

(c) L = /-1|
Define Stack with simple operation.p
am

(d) L =2*]-1
3 What is queue? Write a
algorithm to insert an element in
ex

(ix) What is the number of edges present in a complex simple queue. Tls
vertices?
graph having n
4. Discuss Dynamic memory allocation with suitable
example.
-02/520 (4) 4018-02/520 (5) [P.T.O.]
 Quick Sort
5 Write the different between structure and union

(d) B Tree
?
Write algorithm to insert an
What is doubly tinked list a

element in doubly linked list from begin (e) AVL Tree

Write difference between malloc() and Caloc) ( Radix Sort

Section-C

m
Note Answer any three questions of the following 13x10-30]

co
What is Recursion ? Write an algorithm for Binary search

b.
and Linear search using Recursion.

u
ah
What is circuiar queue? Write a function in 'C' language
to insert an element in circular queue
i
ed
What is Binary Tree ? Discuss with suitable example
m

and write a functions for traversal in Binary Tree

m

11 What is Graph ? Discuss DFS and BFS with suitable

a

exampie
ex

12 Write shorts notes on any

four of the following
insertion Sort

(b Heap Sort

7
4018-02/520 (6) 4018-02/520
 *
TBIMe tetwnar nalhee) and Caliot()
Boetinn C

Artwerarny threenstirvie ntthe fotieing 31030

what ie e r a i r r 7 MNrite an algorithrn fet Biriary search

n e a r enarch ueing Pecursion

WYat it cireuiar (queue 7 Write a functiorn in'C' lariguage-

to ineert an alemernt in circuiar (queue

Discuss with suitable example

What is Binary Tree ?

m
for traversal in Binary Tree
and wr itee a functions

co
suitable
BFS with
11 What is Graph 7 b.Discuss DFS and
hu
example
ia

of the following
o n any four
shorts notes
ed

12 Write
m

Insertion Sort
a
am

Heap Sort
ex

(6)
4018-02/520