C-Dynamic Memory Allocation and Data Structure Questions and Answers

Practice Mode
Showing 10 of 104 questions
Q71
Which of the following is not a type of queue?
  • A Rear queue
  • B output retricted queue
  • C Priority queue
  • D Circular queue
Answer: Option A
Q72
In the input restricted queue
  • A Deletion of element at both front and rear end.
  • B Addition of element at both front and rear end.
  • C Deletion at only front end
  • D All of the above
Answer: Option A
Q73
In which queue element can be inserted randomly
  • A Priority queue
  • B Circular queue
  • C Simple queue
  • D None of the above
Answer: Option D
Q74
In which queue smallest element of the queue is delted first
  • A Ascending priority queue
  • B Decending priority queue
  • C Circular queue
  • D Simple queue.
Answer: Option A
Q75
"Round Robin algorithm" is based on:
  • A Stack
  • B Queue
  • C Trees
  • D Graph
Answer: Option B
Q76
In which queue the largest element is deleted first
  • A Circular queue
  • B ascending priority queue
  • C Descending priority queue
  • D Data queue
Answer: Option C
Q77
When an element is inserted in queue, the position of rear:
  • A Increases
  • B Decreases
  • C Remains constant
  • D None of these.
Answer: Option A
Q78
When an element is deletion in queue, the position of frong
  • A Increases
  • B Decreases
  • C Remains constant
  • D None o these
Answer: Option A
Q79
Entries in a stack are "ordered". What is the meaning of this statement?
  • A A collection of stacks can be sorted.
  • B Stack entries may be compard with the '<' operation.
  • C the entries must be stored in a linked list.
  • D There is a first entry, a second entry, and so on.
Answer: Option A
Q80
The operation for adding an entry to a stack is traditionally called.
  • A Add
  • B Append
  • C Insert
  • D Push
Answer: Option D

📚 More from C Language

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
C Language
Back to C Language
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test