Scribd
Upload
4 views2 pages

DS (2nd) May2013

This document is an examination paper for the MCA (Sem-2) course on Data Structures, consisting of 9 questions divided into 5 sections. Students must attempt one question from each of the first four sections and answer all questions in the compulsory fifth section. The paper covers various topics including stacks, algorithms, trees, graphs, sorting, searching, and data structures.

Uploaded by

kpk064681
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
4 views2 pages

DS (2nd) May2013

This document is an examination paper for the MCA (Sem-2) course on Data Structures, consisting of 9 questions divided into 5 sections. Students must attempt one question from each of the first four sections and answer all questions in the compulsory fifth section. The paper covers various topics including stacks, algorithms, trees, graphs, sorting, searching, and data structures.

Uploaded by

kpk064681
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/ 2

Roll No. Total No.

of Pages : 2
Total No. of Questions : 09

MCA (Sem.–2 nd )
DATA STRUCTURES

om
Subject Code : MCA-203 (2012 Batch)
Paper ID : [B0135]

.c
Time : 3 Hrs. er Max. Marks :100
INSTRUCTION TO CANDIDATES :
ap
1. SECTIONS-A, B, C & D contains TW O questions each carrying

om
TWENTY marks each and students has to attempt any ONE question
rp

from each SECTION.


2. SECTION-E is COMPULSORY carrying TWENTY marks in all.

.c
.b

3. Use of non-programmable scientific calculator is allowed.

er
w

SECTION-A
ap
w

l. What is Stack? What are its applications? Explain how stack is implemented
w

rp
using linked list.
.b

2. What is Algorithm Complexity? How it is measured? Discuss the time


space trade off by taking suitable example.
w
w

SECTION-B
w

3. What is Tree? What are its different types? Explain how tree is represented
in memory?

4. Explain the followings :

(a) B+ Tree and its applications

(b) Traversal of Tree.

SECTION-C

5. Write and explain Dijkastra's algorithm for finding shortest path in a


graph.

6. Define graph. How it is different from a tree? Explain how graph is


represented in memory.

[N- 16-811 ]
SECTION-D

7. What is Selection Sort? Write and explain the working of selection sort
for sorting the following list of numbers:

om
44, 22, 76, 12, 52, 115, 35, 6, 98, 62

8. What is Searching? Write and explain an algorithm to search an item from

.c
an array using linear search. Discuss its complexity.
er
SECTION-E
ap

om
9. Write briefly :
rp

a) Define data structure.

.c
.b

b) What is recursion? What are its limitations?

er
w

c) What is doubly linked list?


ap
w

d) Define priority queue. What are its uses?


w

rp
e) Write an algorithm to delete a node from singly linked list.
.b

f) Define the terms Path Matrix and Strongly connected components in


w

graph.
w

g) Explain how stack is different from queue.


w

h) Write the complexity of bubble sort, quick sort and insertions sort
algorithms.

i) What is Dequeue? How it is different from queue?

j) Define Hashing. What are its applications?

[N- 16-811 ]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy