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
×
What is the worst case complexity of a quick sort algorithm?
O(ð^ð )
Oops!
Check
Okay!
Check
5
×
The object in the image resembles which data structure
Linked List
Oops!
Check
Okay!
Check
10
×
What advantage does a linked list have over an array?
A linked list is not of a fixed size
Oops!
Check
Okay!
Check
25
×
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
5
×
How many null pointers exists in a circular linked list?
0
Oops!
Check
Okay!
Check
×
heart
Other team wins 10 points!
Oops!
×
rocket
Go to first place!
Okay!
×
shark
Other team loses 15 points!
Okay!
×
baam
Lose 20 points!
Oops!
10
×
In C++ what the following command does: delete a;
Free memory allocated for the variable
Oops!
Check
Okay!
Check
×
trap
No points!
Oops!
×
shark
Other team loses 15 points!
Okay!
×
fairy
Take points!
5
10
15
20
25
×
lifesaver
Give 20 points!
Oops!
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
15
×
Specify whether the statement below is valid or invalid.
Invalid
Oops!
Check
Okay!
Check
5
×
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
10
×
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
×
boom
Lose 50 points!
Oops!
×
fairy
Take points!
5
10
15
20
25
×
shark
Other team loses 5 points!
Okay!
×
baam
Lose 20 points!
Oops!
10
×
Make the following function return the following number in the fibonacci sequence
fibo(n-1)+fibo(n-2)
Oops!
Check
Okay!
Check
×
banana
Go to last place!
Oops!
×
seesaw
Swap points!
Okay!
×
rocket
Go to first place!
Okay!
×
thief
Give points!
5
10
15
20
25
10
×
The maximum comparisons needed in Binary Search on array of size 16 is:
4
Oops!
Check
Okay!
Check
×
Restart
Review
Join for Free
;
Your experience on this site will be improved by allowing cookies.
Allow cookies