Scribd
Upload
26 views2 pages

Dsa 2018

The document is an examination paper for B. Tech students covering various data structures and algorithms topics. It includes questions on binary search trees, priority queues, searching algorithms, sorting algorithms, tree traversals, and complexity analysis. Candidates are instructed to attempt any five questions, with all questions carrying equal marks.

Uploaded by

sofipal72
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
26 views2 pages

Dsa 2018

The document is an examination paper for B. Tech students covering various data structures and algorithms topics. It includes questions on binary search trees, priority queues, searching algorithms, sorting algorithms, tree traversals, and complexity analysis. Candidates are instructed to attempt any five questions, with all questions carrying equal marks.

Uploaded by

sofipal72
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

7. (a) What is a binary search tree ? What are No. of Printed Pages : 04 Roll No. .......................

its advantages over linked list and array


? Show stepwise procedure to contruct a 303
binary search tree from the following
number : B. Tech. EXAMINATION, Dec. 2018
61, 13, 22, 72, 55, 99, 35, 45, 80, 95. (Third Semester)
Show that the state of tree after deleting (Old Scheme) (Re-appear Only)
55 and 35. 15
(CSE, ECE, AEI)
(b) What is priority queue ? What are its
CSE201
applications ? 5
DATA STRUCTURES AND
8. (a) Write an algorithm to search an element ALGORITHMS
from sorted Linked List. 7
(b) Write recursive algorithm for binary Time : 3 Hours] [Maximum Marks : 100
search. 7
Before answering the question-paper candidates
(c) Write an algorithm to perform selection
should ensure that they have been supplied to correct
sort. 6
and complete question-paper. No complaint, in this
regard, will be entertained after the examination.

Note : Attempt any Five questions. All questions


carry equal marks.

M-303 4 220 (3-47/11)M-303 P.T.O.


1. (a) Write an algorithm to convert infix 4. (a) Compare and contrast depth first and
expression into postfix expression using breadth first tree traversals. 7
stack. 10
(b) Write Warshall’s algorithm to find shortest
(b) Consider an infix expression
path on graph. 7
P : (A*B^D/(E+F)/G
(c) What is Hash Function ? What are its
Convert the expression P into postfix
applications ? 6
expression using Stacks. 10

2. (a) Write an algorithm to delete an algorithm 5. Explain the following :

from queue when is represented using (a) Recursion 4


linear array. 10 (b) Time complexity 4
(b) Write an algorithm to insert an element (c) Big oh notation 4
after given node LOC in singly Linked
(d) Divide and conquer algorithm. 8
List. 10
6. (a) Write an algorithm for buble sort. Sort
3. (a) Write an algorithm to perform postorder
the given array using bubble sort :
traversal of Binary tree. With the help of
24, 80, 54, 29, 60, 51, 91, 86, 44, 33. 10
example, illustrate postorder traversal of
tree using stacks. 15 (b) Write an algorithm to perform merging

(b) What is AVL tree ? What is the relevance of sorted algorithm. 10


of AVL tree ? 15
M-303 2 (3-47/12)M-303 3 P.T.O.

You might also like