MEDIUM
Earn 100
The term for inserting an element into a full queue is
50% studentsanswered this correctly
Important Questions on Data Structure
HARD
Recursive procedures are implemented by _____.
HARD
Which of the following names does not relate to stacks?
HARD
In reverse polish notation, expression is written as _____.
HARD
In what order the elements of a pushdown stack are accessed:
HARD
When new data are to be 'inserted into a data structure but there is no available space; this situation is usually called.
HARD
Which of the following is not the type of queue?
HARD
Stacks can't be used to __________.
MEDIUM
Which of the following statements is true?
HARD
Recursive procedures are implemented by _____.
HARD
The register or main memory location which contains the effective address of the operand is known as _____.
HARD
What is the condition known as, when in a Linked list START NULL?
HARD
Which data structure is needed to convert infix notation to postfix notation?
HARD
A list of data items usually words or bytes, with the accessing restriction that elements can be added or removed at one end of the list only, is known as _____.
EASY
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 _____.
HARD
The term "push" and "pop" is related to the _____.
HARD
The term push and pop is related to
MEDIUM
The execution of RST n instruction causes the stack pointer to:
HARD
The process of accessing data stored in a tape is similar to manipulating data on a __________.
HARD
A data structure where elements can be added or removed at either end but not in the middle is known as:
