Scribd
Upload
33 views

Royal Technosoft Pvt. Ltd. 9879472527

The document contains 10 questions related to data structures, stacks, and their applications. Specifically, it asks about the differences between data and information, defining and giving examples of different data structures, explaining stack operations with examples, writing algorithms for stack operations, listing applications of stacks and discussing recursion, providing 5 examples of stacks, defining polish and reverse polish notations, writing an algorithm to reverse a number using a stack, writing an algorithm to check if a number is a palindrome using a stack, and converting 4 infix expressions to postfix and prefix notations.

Uploaded by

Tej Sha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Royal Technosoft Pvt. Ltd. 9879472527

The document contains 10 questions related to data structures, stacks, and their applications. Specifically, it asks about the differences between data and information, defining and giving examples of different data structures, explaining stack operations with examples, writing algorithms for stack operations, listing applications of stacks and discussing recursion, providing 5 examples of stacks, defining polish and reverse polish notations, writing an algorithm to reverse a number using a stack, writing an algorithm to check if a number is a palindrome using a stack, and converting 4 infix expressions to postfix and prefix notations.

Uploaded by

Tej Sha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Royal TechnoSoft Pvt. Ltd.

9879472527
Tejas Shah
1. What is data? What is information? Differentiate between them?
2. Define data structure? Explain different type of data Structure.
3. Explain Stack. Explain its operation with proper example.
4. Write an algorithm for all operation of stack.
5. List out different application of stack and discuss Recursion.
6. List out five example of stack.
7. Define polish notation & reverse Polish notation.
8. WAP to reverse number using stack.
9. WAP to check number is palindrome or not using stack.
10. Convert following infix expression into postfix and prefix notation.
a. A B / (C * D ^ E)
b. A + B * C D / E * H
c. A + (B + C ^ D) - E ^ F * (G - H)
d. A + B * C $ D ^ G / ( H ^ B $ F * K ) * T

You might also like