Quiz3 review SP23

What is the worst case time complexity of searching an Element in a Single Linked list?

• O(1)

• O(n)

• O(nlogn)

• O(logn)

What is the first node in a Linked List called?

• Head node

• Node

• Tail node

• Starter node

A node can only hold one data type

• True

• False

What is the following code doing?

• Deleting a Linked List

• Not a valid function

• Printing data of a linked list

• Searching for an element in a Linked list

What is the following psuedocode doing?

• Adding two Linked List together

• Deleting a LL and adding a new one

• Wont work

• Searching through 2 LL's

If we use tail in a LL or DLL what is the worst case time complexity for adding at the end?

• O(1)

• O(n)

• O(m) where 1<=m<=n

• O(logn)

A Max heap is:

• Heap where all parent nodes are bigger than children

• Heap where all parent nodes are smaller than children

• A complete Tree

• Represented by an Array

The following Min Heap in array form is:

_ means empty space

• 1,3,2,4,6,5_

• 1,2,3,_,4,5,6

• 6,5,_,4,3,2,1

• 1,3,_,4,6,2,5

Performing heapsort on this min heap would result in what?

• 6,7,10,12,15,17

• 17,15,12,10,7,6

• 6,7,12,10,15,17

To find a Left child we use:

To Find a right child we use:

• Left: 2i

  Right:2i+1

• Left: i/2

  Right:i/2 +1

• Left: 2+i

  Right 2 + i

• Left: i

  Right: 2i