Testing

Testing

University

25 Qs

quiz-placeholder

Similar activities

Quantitative Aptitude Series

Quantitative Aptitude Series

University

20 Qs

Batch 1 Quiz - DSA Lab

Batch 1 Quiz - DSA Lab

University

25 Qs

Data Structure

Data Structure

University

20 Qs

3ICTH7H8DSA

3ICTH7H8DSA

University

25 Qs

ITEDAT Endterm Quiz #1

ITEDAT Endterm Quiz #1

University

20 Qs

Queues

Queues

University

20 Qs

coe java 24 june 21 7:30 to 745 pm only

coe java 24 june 21 7:30 to 745 pm only

University

20 Qs

Stack and Queue

Stack and Queue

University

25 Qs

Testing

Testing

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

Asymptotic complexity of linear search with array in average case is
O(1)
O(n)
O(n/2)
log n

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Upper bound is denoted as _______
O
Ω
Θ
ω

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which one of the following is not a fundamental data type in C++?
Float
string
Int
Char

4.

MULTIPLE CHOICE QUESTION

30 sec • 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

30 sec • 1 pt

Shell sort is also known as
diminishing decrement sort
diminishing increment sort
partition exchange sort
diminishing insertion sort

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which one of the following is not an algorithm design strategy?
Recursive
Non-linear
Backtracking
Dynamic Programming

7.

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

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?