1.4.2 Data Structures

_________________ is a collection of elements used to store the same type of data.

• Array
• Switch
• Case
• Loop

What is returned by values[5]?

• 9
• 12
• 6
• 8

int nums[ ] =
{2, 3, 5, 8, 9, 11};
How would you access the fourth element in nums

• nums[4]
• nums[3]
• nums(4)
• nums(3)

Which of these data structures is FIFO? 

• Stack
• Queue
• Binary Tree
• Double linked list

What would a dynamic data structure entail?

• Memory is allocated to the data structure as the program executes.
• Memory is allocated to the data structure at compile time.
• The size of the structure is fixed
• The data structure can also double as TNT

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Front" pointer point?

• 0

• 1

• 2

• 3

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Rear" pointer point?

• 0

• 1

• 2

• 3

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Front" pointer point?

• Bert

• Cynthia

• Cedric

• Albert

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Rear" pointer point?

• Bert

• Cynthia

• Cedric

• Albert

A Queue can only store 6 data items. The Queue is sent 4 data items: Bert, Cynthia, Cedric and Albert. Where does the "Rear" pointer point if a deQueue operation is performed.

• Bert

• Cynthia

• Cedric

• Albert