Scribd
Upload
87 views3 pages

Data Structures and Algorithms

This document contains questions for an exam on data structures and algorithms. It includes 15 multiple part questions testing a variety of topics: 1. It asks students to differentiate between stacks and queues and provide applications. 2. Several questions test algorithm design and analysis skills for operations on data structures like arrays, linked lists, trees, graphs, and hash tables. 3. Other questions address algorithmic topics like dynamic programming, backtracking, NP-hard and NP-complete problems, graph algorithms, and asymptotic complexity analysis.

Uploaded by

Anonymous V7P5fNQI
Copyright
© Attribution Non-Commercial (BY-NC)
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
87 views3 pages

Data Structures and Algorithms

This document contains questions for an exam on data structures and algorithms. It includes 15 multiple part questions testing a variety of topics: 1. It asks students to differentiate between stacks and queues and provide applications. 2. Several questions test algorithm design and analysis skills for operations on data structures like arrays, linked lists, trees, graphs, and hash tables. 3. Other questions address algorithmic topics like dynamic programming, backtracking, NP-hard and NP-complete problems, graph algorithms, and asymptotic complexity analysis.

Uploaded by

Anonymous V7P5fNQI
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 3

Reg. No.

Question Paper Code :

13089

B.Tech. Information Technology Third Semester

142301 DATA STRUCTURES AND ALGORITHMS (Regulation 2010) Time : Three hours

42

Answer ALL questions.

PART A (10 2 = 20 marks) 1. 2.


3.
4. 5. 6. 7. 8.

Differentiate between stack and queue and give its applications. Convert A * (B + D)/E F * (G + H/K) into Postfix expression.
Draw the expression tree for (a + b * c) + ((d * e + f) * g) .
What is an AVL tree?

What is a Hash table?

Give two examples of disjoint sets. Differentiate between graph and tree. Trace the Eulers path and Eulers circuit in the graph.

94

21 9

9.

Define dynamic programming and backtracking.

10.

Define NP hard and NP complete.

42

19

19

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

42
Maximum : 100 marks

PART B (5 16 = 80 marks) 11. (a) (i)

Write ADT operations for array implementation of polynomial addition. (8)

(ii)

Formulate an algorithm to insert an element in a doubly linked list. (8)

Or (b) (i)

Write down the algorithm to convert infix to reverse polish form. Using it convert ((A + B) * D) (E F ) .

19

42

or not in a circular queue. 12. (a) (i)

42
Or Or Or
2

(ii)

Write an algorithm to find whether a particular element is present (8)

Explain the various tree traversal & predict a binary tree with Preorder : ABCDEFGHI & Inorder : BCAEDGHFI. (8) (8)

(ii)

Formulate an algorithm to insert an element in a binary tree.

(b)

(i) (ii)

Formulate an algorithm to search an element in a binary tree. Explain binary search tree and give its time complexity.

19

13.

(a)

(i) (ii)

42

What is open addressing hashing? Describe any one technique. Explain the operations on bit vector representation of sets.

21 9

(b)

(i)

Explain the smart union algorithm.

(ii)

Discuss the use of sets in tree representation of sets in client-server (8) (8) (8)

environment. Write Dijkstras algorithm for shortest path. Explain topological sorting with an example.

14.

(a)

(i)

(ii)

94

1
(8) (8) (8) (8) (8) (8)

13089

(b)

(i) (ii)

Explain Eulers and Hamiltonian circuits.

Write down the Prims algorithm and find the minimum spanning tree for the following graph. (8)

(ii)

Explain Asymptotic complexity classes. Or

42
3

15.

(a)

(i)

Explain divide and conquer technique with an example.

19

42

(b)

(i) (ii)

Define big Oh notation. Write short notes on :

Branch and bound techniques and NP complete problems.

19

94

21 9

42

(8)

(8) (8)

(6)

(5) (5)

13089

You might also like