DSPM (3rd) Dec2017

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Roll No.

Total No. of Questions: 09 Total No. of Pages: 02


B. Tech. (CSE/IT) (Sem. 3)
DATA STRUCTURES AND PROGRAMMING METHODOLOGY
Subject Code: CS-207
Paper ID: A0454

Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. Section A is COMPULSORY consisting of TEN Questions carrying TWO marks each.
2. Section B contains FIVE questions carrying FIVE marks each and students have to attempt
any FOUR questions.
3. Section C contains THREE questions carrying TEN marks each and students have to
attempt any TWO questions.

1.
SECTION A

o m
.r c
a) What are usage of pointers?
b) Relate data structures with data types?
c)
d)
Discuss double Linked List?
What are postfix expressions?

p e o m
.r c
e) Give some applications of stack?
f)
a
Difference between array and linked list?

p
g)
h)

b r
Define binary tree?
Write a short note on Hash Tables?

p e
a
i) Define a weighted graph.

rp
j) What are records?

2.
SECTION B

b
Discuss some of the common operations that can be performed on data structures by taking
suitable example?

3. Define recursion? Which data structure can be used to implement it?

4. Discuss various operations on queues? What are the advantages of circular queue?

5. Give the brief introduction to file operations in data structure?

6. Illustrate the concept of breadth-first search traversing of graph?

| M56504 Page 1 of 2
SECTION C

7. Write an algorithm to implement the Link List?

8. How a linear array is represented in memory? Explain the program which reads two matrixes?

9. What do you mean by hashing? Explain any one popular hash function?

o m
.r c m
p e o
p a .r c
b r p e
a
b rp

| M56504 Page 2 of 2

You might also like