Team 1
0
Team 2
0
Teams
Name
Score
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
Loading
5
×
A function can have _____ inside the parenthesis
Arguments/Parameters
Oops!
Check
Okay!
Check
15
×
We are sorting the following list in ascending order: 5 4 2 9 3 1 8 What does the list look like after ONE pass of the selection sort algorithm?
1 4 2 9 3 5 8
Oops!
Check
Okay!
Check
5
×
How many null pointers exists in a circular linked list?
0
Oops!
Check
Okay!
Check
15
×
Specify whether the statement below is valid or invalid.
Invalid
Oops!
Check
Okay!
Check
15
×
When is Binary Search preferred over Linear Search?
Sorted Array
Oops!
Check
Okay!
Check
×
trap
No points!
Oops!
×
rocket
Go to first place!
Okay!
×
rocket
Go to first place!
Okay!
×
banana
Go to last place!
Oops!
×
baam
Lose 5 points!
Oops!
×
seesaw
Swap points!
Okay!
×
gift
Win 10 points!
Okay!
×
thief
Give points!
5
10
15
20
25
15
×
What is the output of the following program segment?
10
Oops!
Check
Okay!
Check
15
×
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
10
×
In C++ what the following command does: delete a;
Free memory allocated for the variable
Oops!
Check
Okay!
Check
×
lifesaver
Give 10 points!
Oops!
×
rocket
Go to first place!
Okay!
×
gift
Win 25 points!
Okay!
×
baam
Lose 20 points!
Oops!
10
×
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
25
×
Given the following Banana class in C++. Create a new Banana object properly
Banana sample("yellow");
Oops!
Check
Okay!
Check
×
lifesaver
Give 10 points!
Oops!
×
seesaw
Swap points!
Okay!
×
rocket
Go to first place!
Okay!
×
thief
Give points!
5
10
15
20
25
5
×
Which sorting algorithm uses a pivot point?
Quick sort
Oops!
Check
Okay!
Check
10
×
In linked list implementation of a queue, the important condition for a queue to be empty is?
FRONT is null
Oops!
Check
Okay!
Check
×
Restart
Review
Join for Free
;
Your experience on this site will be improved by allowing cookies.
Allow cookies