Scribd
Upload
47 views

Data Structures and Programming Methodology

This document contains instructions and questions for a data structures and programming methodology exam. It has three sections - Section A with 10 short questions worth 2 marks each, Section B with 5 questions worth 5 marks each requiring students to attempt 4, and Section C with 3 questions worth 10 marks each requiring students to attempt 2. The questions cover topics like binary search, adjacency lists, stacks, DFS vs BFS, sorting algorithms, graph applications, recursion, binary tree representations, algorithm efficiency, and linked lists.

Uploaded by

Vijay Pal
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
47 views

Data Structures and Programming Methodology

This document contains instructions and questions for a data structures and programming methodology exam. It has three sections - Section A with 10 short questions worth 2 marks each, Section B with 5 questions worth 5 marks each requiring students to attempt 4, and Section C with 3 questions worth 10 marks each requiring students to attempt 2. The questions cover topics like binary search, adjacency lists, stacks, DFS vs BFS, sorting algorithms, graph applications, recursion, binary tree representations, algorithm efficiency, and linked lists.

Uploaded by

Vijay Pal
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: 02
Total No. of Questions: 09

B.Tech.(CSE) / (IT) (2010 Batch) (Sem. – 3)


DATA STRUCTURES AND PROGRAMMING METHODOLOGY
M Code: 56504
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.

SECTION A
o m
.r c
1. a) What is the average and worst case complexity of binary search algorithm?

m
p e
b) What is an adjacency list? When it is used?

o
a .r c
c) How do you test for an empty stack?

r p
d) Distinguish between DFS and BFS.

e
b
e) Which sorting algorithm is of divide-and-conquer type? What is its average case
complexity?

a p
rp
f) What are the various applications of graphs?

g) Which data structure is used to perform recursion and why?

b
h) What are the different ways of representing a binary tree?

i) How you can measure the efficiency of an algorithm?

j) What are the limitations and advantages of two-way linked list over one-way linked list?

M-56504 Page 1 of 2
SECTION B

2. Explain the addition and deletion operation performed on a circular queue with necessary
algorithm.
3. Construct the binary tree given the following traversals.
Pre-order: E A C K F H D B G
In-order: F A E K C D H G B
4. What is minimum spanning tree? Explain with a suitable example of your own choice.
5. Explain various hashing functions. What do you mean be collisions in hashing?
6. Write an algorithm to count the number of nodes in a singly linked list.

SECTION C

25, 15, 30, 9, 99, 20, 26, 80, 42


o m
7. Write down quicksort Sort Algorithm and illustrate its working to sort list:

.r c
8. a) How 2-d arrays are represented in memory? Explain in detail.

m
e
b) Write a program to multiply two two-dimensional arrays.

p
9. What is a heap? How does it differ from a binary tree?
o
a .r c
a) Construct a heap tree (while explaining various steps) for the following elements:

p
b r
(44, 30, 50, 22, 60, 55, 77, 55)
b) Delete the root node of the tree formed in (a).
p e
a
b rp

M-56504 Page 2 of 2

You might also like