Neo Coding Round 1 Set 1

Neo Coding Round 1 Set 1

University

25 Qs

quiz-placeholder

Similar activities

Java-1

Java-1

University

20 Qs

Preguntas de ED-Interciclo 1

Preguntas de ED-Interciclo 1

University

20 Qs

Data Structures: Placement Preparations

Data Structures: Placement Preparations

University

25 Qs

Data Structure

Data Structure

University

20 Qs

Algo Duel

Algo Duel

University

20 Qs

DSA QUIZ

DSA QUIZ

University

20 Qs

Q9 ABSTRACTION IN JAVA

Q9 ABSTRACTION IN JAVA

University

20 Qs

Java - SET -1

Java - SET -1

University

25 Qs

Neo Coding Round 1 Set 1

Neo Coding Round 1 Set 1

Assessment

Quiz

Computers

University

Hard

Created by

ZION DYPIT

Used 1+ times

FREE Resource

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

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?