Scribd
Upload
3 views

Dsa

The document outlines questions for two groups, A and B, focusing on data structures and algorithms. Group A includes questions on queues, recursive algorithms using stacks, and Dijkstra's algorithm for shortest paths. Group B consists of eight questions covering stack operations, sorting algorithms, queue types, asymptotic analysis, array implementation of lists, search algorithms, and graph traversal.

Uploaded by

rameshtharu076
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Dsa

The document outlines questions for two groups, A and B, focusing on data structures and algorithms. Group A includes questions on queues, recursive algorithms using stacks, and Dijkstra's algorithm for shortest paths. Group B consists of eight questions covering stack operations, sorting algorithms, queue types, asymptotic analysis, array implementation of lists, search algorithms, and graph traversal.

Uploaded by

rameshtharu076
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Group A

Attempt ant Two questions:


1. Define queue. What are different applications of queue? Explain queue operations with
example.
2. How recursive algorithm use stack to store intermediate results? Illustrate with an
example. Convert the infix expression A+B-(C*D/E+F)-G*H into postfix expression
using stack.
3. What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable
example.
Group B
Attempt any Eight questions:

1. Explain push and pop operations of stack. Whar are different applications of stack?
2. Sort the number {82, 73, 12, 39, 26, 88, 2, 9, 60, 41} using shell sort.
3. What is linear queue? Why do we need circular queue? Explain.
4. What is asymptotic analysis? Explain theta notation with example.
5. Explain array implementation of list.
6. Write a program to implemet sequential search algorithm.
7. What is graph traversal? Explain.
8. Write short notes on:
a) Breadth first traversal of graph
b) TOH

You might also like