Scribd
Upload
27 views3 pages

Practice Questions For DSA

The document discusses various topics related to data structures and algorithms including asymptotic notations, linear and non-linear data structures, different types of queues, stack operations like checking balanced parentheses, queue operations, polish notations, infix to postfix conversions, stack ADT and applications, recursion vs iteration, algorithm characteristics, circular queue, order of growth functions, queue and tree implementations and operations. It also provides questions to write algorithms for various conversions between infix, postfix and prefix expressions, stack and queue implementations and operations.

Uploaded by

barotshreedhar66
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
27 views3 pages

Practice Questions For DSA

The document discusses various topics related to data structures and algorithms including asymptotic notations, linear and non-linear data structures, different types of queues, stack operations like checking balanced parentheses, queue operations, polish notations, infix to postfix conversions, stack ADT and applications, recursion vs iteration, algorithm characteristics, circular queue, order of growth functions, queue and tree implementations and operations. It also provides questions to write algorithms for various conversions between infix, postfix and prefix expressions, stack and queue implementations and operations.

Uploaded by

barotshreedhar66
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/ 3

Module 1,2,3

1) Explain asymptotic notations with example.


2) Compare Linear and Non linear data structures.
3) Explain different types of queues in the data structure.
4) Write an algorithm to check balanced parenthesis using STACK.
5) Consider the queue given below which has front=1 and rear=5

A B C D E

Draw the queue after performing following operations.


(a) Add F
(b) Delete two alphabets
(c) Add G
(d) Add H
(e) Delete four Alphabets
(f) Add I
6) Explain polish notations. Convert the following infix expression to their postfix equivalents:
(a) (A-B)+C*D/E-C
(b) ((A-B)+D/((E+F)*G))
7) Write ADT for Stack? Give application of Stack.
8) Consider the algorithm for determining whether a sequence of parenthesis is balanced or not
using STACK. What will be maximum number of parenthesis that will appear on the STACK
at any one time when the algorithm analyses the expression given below:
Expression= ( ( ) ( ( ) ) ( ( ) ) )
Justify your answer.
9) In a linear queue while performing dequeue operation, describe the condition when front and
rear pointer both are at the same position.
10) Write a short note on Iteration Vs Recursion
11) What is Algorithm? Explain the necessary characteristics of an algorithm.
12) Explain need of Circular queue and compare circular queue with linear queue.
13) Explain the concept of order of growth functions.
14) Write an algorithm to convert Infix expression into Postfix expression. Convert the following
infix expression into postfix expression (a*b+c)-d/f
15) Write an algorithm to convert Infix expression into prefix expression.
16) Write and Explain algorithm to implement linear queue using array.
17) What is the condition of overflow of circular queue.
18) Write an algorithm to implement Input restricted double ended queue.
19) Write an algorithm to implement Output restricted double ended queue.
20) How a tree data structure is different from graph data structure.
21) Differentiate between peek() and pop() function.
22) Differentiate Stack and Queue.
23) Differentiate array and Linked list.
24) Write an algorithm to convert the given Infix expression to Postfix expression using STACK.
Infix expression = ( A – B + ( C * D ) / F )
25) Six characters A, B, C, D, E and F are pushed to the empty Stack. Two characters are popped
from stack one by one and enqueued into the empty linear queue. Two more characters G and
H are enqueued into that queue. One character is dequeued from the queue and pushed to the
stack. What is the output when peek operation is performed on the stack?
Justify your answer.

Module 4
26) Explain different types of Linked Lists with block diagrams.
27) Write an algorithm to display the node values/elements of a linked list.
28) How to create node of a linked list.List various steps to create a linked list.
29)

You might also like