C-Dynamic Memory Allocation and Data Structure
C-Dynamic Memory Allocation and Data Structure
71. Which of the following is not a type of queue?
- Rear queue
- output retricted queue
- Priority queue
- Circular queue
72. In the input restricted queue
- Deletion of element at both front and rear end.
- Addition of element at both front and rear end.
- Deletion at only front end
- All of the above
73. In which queue element can be inserted randomly
- Priority queue
- Circular queue
- Simple queue
- None of the above
74. In which queue smallest element of the queue is delted first
- Ascending priority queue
- Decending priority queue
- Circular queue
- Simple queue.
76. In which queue the largest element is deleted first
- Circular queue
- ascending priority queue
- Descending priority queue
- Data queue
77. When an element is inserted in queue, the position of rear:
- Increases
- Decreases
- Remains constant
- None of these.
78. When an element is deletion in queue, the position of frong
- Increases
- Decreases
- Remains constant
- None o these
79. Entries in a stack are "ordered". What is the meaning of this statement?
- A collection of stacks can be sorted.
- Stack entries may be compard with the '<' operation.
- the entries must be stored in a linked list.
- There is a first entry, a second entry, and so on.
80. The operation for adding an entry to a stack is traditionally called.
- Add
- Append
- Insert
- Push