C Programming: MCQ Set – 11

Q101: 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

  • (A) Queue
  • (B) Stack
  • (C) Tree
  • (D) Linked list

Q102: In a circular linked list

  • (A) Components are all linked together in some sequential manner
  • (B) There is no beginning and no end
  • (C) Components are arranged hierarchically
  • (D) Forward and backward traversal within the list is permitted

Q103: Applications of Stack are

  • (A) Simulation, event driven systems
  • (B) Postfix and prefix manipulations
  • (C) Dictionary systems, polynomial manipulations
  • (D) Fixed block storage allocation, garbage collection

Q104: Electronic spreadsheets are most useful in a situation where relatively …. data must be input but …… calculations are required.

  • (A) little; simple
  • (B) large; simple
  • (C) large; complex
  • (D) little; complex



≪ Previous | Next ≫