Data Structure Basics

Example of non linear data structure

• array

• tree

• queue

• stack

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

• Array
• Switch
• Case
• Loop

Which of these data structures is LIFO?

• Stack

• Queue

• Binary Tree

• Double linked list

int nums[ ] =

{2, 3, 5, 8, 9, 11};

How would you access the fourth element in nums

• nums[8]

• nums[3]

• nums(4)

• nums(3)

Which of the following is NOT a Type of Data Structures?

• Arrays
• Tables
• Stacks
• Trees

A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.

• Linear Queue

• Circular Queue

• Priority Queue

LIFO stands for

• List of Outputs

• Last in First Out

• First in Last Out

• None of them

Act of adding values into a stack is called

• Popping

• Polling

• Pushing

• None

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

Example of linear data structure except

• array

• tree

• queue

• stack