
Neo Coding Round 1 Set 1
Authored by ZION DYPIT
Computers
University
Used 1+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
25 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is a Divide and Conquer algorithm?
Bubble sort
Heap sort
Selection sort
Merge sort
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Partition and exchange sort is
quick sort
heap sort
tree sort
bubble sort
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
ADT is called as Abstract because
It is completely independent data type
It is collection of different data types
Implementation Details are hidden
none
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The complexity of Binary search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which one of the following is not a fundamental data type in C++?
Float
string
Int
Char
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What will be the contents of the stack after performing following operations push(1), push(2), push(2), pop, pop, pop, push(2),push(1), pop, pop.
Stack empty
44928
2
1
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The && and | operators compare two
boolean values
numberic values
both a and b
None of these
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?