DATA STRUCTURES CERTIFICATION
EVALUATION COMPLETE QUESTIONS
WITH VERIFIED SOLUTIONS
●● Array
Answer: An indexed set of related of related elements. It must be finite
and indexed and only contain elements with the same data type.
●● Queue
Answer: FIFO data structure. Used in breadth first search algorithms.
●● Linear Queue
Answer: A queue containing a front and rear pointer. These can be used
to identify the first and last positions.
●● Circular Queue
Answer: A queue where the front and rear pointers can move over the
two ends of the queue.
●● Priority Queue
Answer: Items are assigned a priority. Items with the highest priority are
dequeued first and items of the same priority are dequeued using FIFO.
EVALUATION COMPLETE QUESTIONS
WITH VERIFIED SOLUTIONS
●● Array
Answer: An indexed set of related of related elements. It must be finite
and indexed and only contain elements with the same data type.
●● Queue
Answer: FIFO data structure. Used in breadth first search algorithms.
●● Linear Queue
Answer: A queue containing a front and rear pointer. These can be used
to identify the first and last positions.
●● Circular Queue
Answer: A queue where the front and rear pointers can move over the
two ends of the queue.
●● Priority Queue
Answer: Items are assigned a priority. Items with the highest priority are
dequeued first and items of the same priority are dequeued using FIFO.
