Scribd
Upload
6 views

Module 2 Questions

Uploaded by

hemanthpushpa808
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
6 views

Module 2 Questions

Uploaded by

hemanthpushpa808
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

1.Define Stacks.

Write the stack implementations for push and pop


functions using arrays (using dynamic arrays - Jan 19) with StackFull &
StackEmpty conditions.
(OR)
Write a program in C to implement push, pop and display operations for stacks
using arrays.
2. Write a C Program to Convert infix expressions to postfix expressions.
Convert the following infix expressions to postfix expressions :
1. (a+(b-c)*(d-e)%f)
2. (a+b) * d – e / (f + a * d) +c (Write the post fix form using stack)
3. (( a / ( b – c + d)) * (e – f ) * g) (Write the post fix form using stack)
4. a+(b+c)+(b/d)*a+z*u
5. A-B/C(C*D$E)

3. Write a Algorithm and function to evaluate the postfix expression. Illustrate


the same for the given postfix expression: ABC-D*+E$F+ and assume A=6,
B=3, C=2, D=5, E=1 and F=7.
A*(B+D)/E-F*(G+H/K)

4. Develop a C program to implement insertion, deletion and display operations


on Linear queue.

5. Write a C program to implement insertion, deletion and display operations on


a circular queue.

6. List the disadvantages of linear queue and explain how it is solved in


circular
queue. Give the algorithm to implement a circular queue with suitable
example.

7Define queues. List the different types of queues. Write the


implementation of ordinary queues using arrays.
8. Explain in detail multiple stacks, with relevant functions in C
9. Explain in detail multiple queue, with relevant functions in C

You might also like