Search Header Logo

Zion Round 1 Test Set 2

Authored by SCOB23_Aniket_Patil SCOB23_Aniket_Patil

Professional Development

University

Used 1+ times

Zion Round 1 Test Set 2
AI

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

15 mins • 1 pt

Asymptotic complexity of linear search with array in average case is

O(1)
O(n)
O(n/2)
log n

2.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

Upper bound is denoted as _______

O
Ω
Θ
ω

3.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

Which one of the following is not a fundamental data type in C++?

Float
string
Int
Char

4.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

A normal queue, if implemented using an array of size N-1, gets full when

Front = (rear + 1)mod N
Front = rear + 1
Rear = front.
Rear = N – 1

5.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

Shell sort is also known as

diminishing decrement sort
diminishing increment sort
partition exchange sort
diminishing insertion sort

6.

MULTIPLE CHOICE QUESTION

15 mins • 1 pt

Which one of the following is not an algorithm design strategy?

Recursive
Non-linear
Backtracking
Dynamic Programming

7.

MULTIPLE CHOICE QUESTION

15 mins • 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

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?