V

Vinay • 28.75K Points
Instructor II

Q. Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?

  • (A) q[0]
  • (B) q[1]
  • (C) q[9]
  • (D) q[10]
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Teredo is an automatic tunneling technique. In each client the obfuscated IPv4 address is represented by bits

Q. To prove the statement P is tautologically equivalent to the statement Q, it is enough to prove that _______.

Q. Which is the limitation of high level language?

Q. Three select lines are required to address four data input lines.

Q. Which Operators Are Known As Ternary Operator?

Q. The hashing file space is divided into_______________.

Q. Correlated variables can have zero correlation coeffficient. True or False?

Q. A linear SONET network can be ________

Q. What is compaction?

Q. Pervasiveness of planning indicates that planning

Question analytics