Kahoot Questions for Data Structures & Algorithms I

A queue works using the ____ principle.

FIFO

Given myStack: 3(top) & 2.Push(5). Peek().Pop().Pop() What is the new stack?

2

Determine the deque contents after the following operations.

5,2,6

In which bucket would the value 76 be stored in a 10 element hash table?

6

Given numQueue: 8,7,6 - What are the queue's contents after the following operations?

6,9,5

Abstraction is...

A simplified representation of a complex object or process

A binary tree characteristic includes:

A tree where each node has at most 2 child nodes

Which of the following data structures only stores homogeneous data elements?

Arrays

A 100-element hash table has 100 _____.

Buckets

A hash table contains two components:

Buckets and a mapping key

Doubly linked lists contain...

Data, previous pointer and next pointer

An abstract data type...

Describes pre-defined operations on the data structure

Lists may be implemented using any of the following data structures:

Doubly-linked list, Array, Singly-linked list

Graphs are composed of (choose 2):

Edges, Vertices

In a priority queue, how is the priority of elements maintained?

Element has a priority associated with the highest priority first

A queue and a deque use the same operations

False

A set ADT allows duplicate terms.

False

The programmer must understand the underlying structure to use an ADT?

False

The queue enqueue operation inserts an item at the front of the queue?

False

What is the underlying data structure for a dictionary?

Hash table

A singly list does not:

Have nodes with pointers to the previous nodes

A priority queue would be implemented as a(n) _____.

Heap data structures

In a max heap, the root is always:

Highest Number

A stack works using the ____ principle.

LIFO

In a binary tree, a _____ is a node with no children.

Leaf

The following ADTs are ordered & indexed (choose 2):

List, Array

Common ADTs include (Choose 3):

List, Deque, Stack

Which statement is NOT executed when a new node is appended to my list?

List→head = newnode

In the following dictionary example, which value is the key?

Name

Select all stack operations:

Push, Peek, Pop

Knowledge of an ADT's underlying implementation is needed to analyze the run time efficiency

True

Name the data structure:

Binary Tree