COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
A parentheses balancing program
|
|
|
Tracking of local variables at run time
|
|
|
Compiler Syntax Analyzer
|
|
|
Data Transfer between two asynchronous process
|
Detailed explanation-1: -Explanation: Data transfer between the two asynchronous process uses the queue data structure for synchronisation. The rest are all stack applications. 7.
Detailed explanation-2: -The common application of Stack is delimiter checking, i.e., parsing that involves analyzing a source program syntactically. It is also called parenthesis checking.
Detailed explanation-3: -Which of the following applications may use a stack? A parentheses balancing program. Tracking of local variables at runtime. Compiler Syntax Analyzer.
Detailed explanation-4: -Application of the Stack A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.
Detailed explanation-5: -The option d, i.e., balancing of symbols is an application of the stack data structure. 37) Which of the following option is true if implementation of Queue is from the linked list?