מחשבים 4

The pop() method tends to be useful for:

• Delete an indexed item

• Remove the last element from an array or stack

• Add an element to an array or stack

• Determines if an array has used all its memory

• Releases memory from an array structure

Which method allows inserting an object into the queue?

• front

• isEmpty

• dequeue

• enqueue

• next

A node requires memory for

• a connection between queues

• its 2d data structure

• data and a pointer

• the address of its attached list

• the address of its linked list

To access a linked list's particular node, you will likely need to

• identify the reference point of the node

• create sub elements of the linked list

• slice through the list

• loop through the link list

Which of these data structures is LIFO?

• Stack

• Queue

• Binary Tree

• Double linked list

Act of adding values into a stack is called

• Popping

• Polling

• Pushing

• None

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

For a linked list, what meta-data will need to be stored with each data entry?

• The Name of the list
• The address of the current data entry
• The address of the next data entry in the list
• The meaning of life

A Kind of tree where every node in a tree can have at most two children.

• Binary Tree
• Binary Expression Tree
• Tree
• Binary Search Tree

A tree is composed of ____ connected by edges or lines.

• Fruit 
• Leaf Node
• Root Node
• Nodes