Review of the semester ;) | Baamboozle - Baamboozle

What is the worst case complexity of a quick sort algorithm?

O(𝒏^𝟐 )

Oops!

Check

Okay!

Check

What advantage does a linked list have over an array?

A linked list is not of a fixed size

Oops!

Check

Okay!

Check

When is Binary Search preferred over Linear Search?

Sorted Array

Oops!

Check

Okay!

Check

When struct is used instead of the keyword class means, what will happen in the program?

access is public by default

Oops!

Check

Okay!

Check

banana

Go to last place!

Oops!

fairy

Take points!

rocket

Go to first place!

Okay!

lifesaver

Give 25 points!

Oops!

Given the following Banana class in C++. Create a new Banana object properly

Banana sample("yellow");

Oops!

Check

Okay!

Check

What is the first change that insertion sort would make to this sequence? “6 2 5 9”

2 6 5 9

Oops!

Check

Okay!

Check

A ________ is blue print that defines certain characteristics and behavior. It is simply a representation of different types of objects.

Class

Oops!

Check

Okay!

Check

Which sorting algorithm uses a pivot point?

Quick sort

Oops!

Check

Okay!

Check

What is the output of the following program segment?

Oops!

Check

Okay!

Check

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?

Bubble Sort

Oops!

Check

Okay!

Check

monster

Reset all scores!

Oops!

star

Double points!

Okay!

gift

Win 15 points!

Okay!

thief

Give points!

What output is displayed after the following segment of code executes:

10 an infinite number of times. top() simply copies the top element of the stack. Use push() to remove an element from the stack.

Oops!

Check

Okay!

Check

baam

Lose 25 points!

Oops!

magnet

Take 15 points!

Okay!

fairy

Take points!

thief

Give points!

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

ABCD

Oops!

Check

Okay!

Check

Using a binary search why will the number 9 never be found in the following list: 11, 8, 13, 9, 7, 3

The list is not in order

Oops!

Check

Okay!

Check

Restart Join for Free

Your experience on this site will be improved by allowing cookies.