Computer Science
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a:
- Queue
- Stack
- Tree
- Linked list
Related Questions
Which of the following applications may use a Stack?
- A parentheses balancing program
- Tracking of local variables at run time
- Compiler Syntax Analyzer
- All of these
Consider the usual algorithm for determining whether a sequence of parentheses is balanced.
The maximum number of parentheses that appear on the Stack AT ANY ONE TIME when the algorithm analyzes: (()(())(())) is:
- 1
- 2
- 3
- 4 or more
A Queue is a:
- FIFO (First In First Out) list
- LIFO (Last In First Out) list
- Ordered array
- Linear tree
Assertion (A): The major implementation of using a data structure is to manage the storage of data in the memory efficiently.
Reasoning (R): Data structure refers to the way memory is allocated for holding data using minimum space. It leads to faster data access during the execution of the program.
- Both A and R are true and R is the correct explanation of A.
- Both A and R are true but R is not the correct explanation of A.
- A is true but R is false.
- A is false but R is true.