Searching and Sorting

Searching and Sorting

University - Professional Development

15 Qs

quiz-placeholder

Similar activities

DreamWeaver CS6

DreamWeaver CS6

University

20 Qs

ER MODEL

ER MODEL

University

15 Qs

Kuis Dadakan ;)

Kuis Dadakan ;)

10th Grade - University

15 Qs

CHAPTER 1: COMPUTER SECURITY REVIEW

CHAPTER 1: COMPUTER SECURITY REVIEW

University

10 Qs

Networks and Components

Networks and Components

Professional Development

20 Qs

Python Quiz For Starters

Python Quiz For Starters

3rd Grade - Professional Development

17 Qs

Multimedia Video & Animation

Multimedia Video & Animation

University

20 Qs

Django-quiz

Django-quiz

5th Grade - University

20 Qs

Searching and Sorting

Searching and Sorting

Assessment

Quiz

Computers

University - Professional Development

Hard

Created by

AKSHAY KUMAR

Used 301+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Choose a CORRECT statement about pivot in quick sort method.

A pivot divides the list evenly.

A pivot can be chosen randomly.

A pivot is chosen by using a formula

A pivot makes the searching method becomes slow

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Identify the INCORRECT statement about searching


i. Binary search starts by testing the largest data

ii. Linear search can be done for unsorted data only

iii. Linear search starts by testing data at the middle of list

iv. Binary search can be done for sorted homogeneous data

i, ii and iii

ii, iii and iv

i, iii and iv

i, ii, iii and iv

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Suppose a list is {2, 9, 5, 4, 8, 1}. After the first phase of bubble sort, the list becomes …

2, 9, 5, 4, 8, 1

2, 9, 5, 4, 1, 8

2, 5, 9, 4, 8, 1

2, 5, 4, 8, 1, 9

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given a list is {7, 4, 5, 9, 8, 2, 1}. After the first phase of selection sort, the list becomes …

1,2,4,9,8,5,7

1,2,5,9,8,4,7

1,4,5,9,8,2,7

7,4,5,9,8,2,1

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If the number of records to be sorted is small, identify the suitable sorting to be used

Quick sort

Merge sort

Selection sort

Bubble sort

6.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The worst case occurs in linear search algorithm when ______________________

Item is not in the array at all

Item is somewhere in the middle of the array

Item is the last element in the array or item is not there at all

Item is the last element in the array

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

Identify the correct statement?

Neither the 7 nor the 9 is the pivot.

The pivot could be either the 7 or the 9.

The pivot is not the 7, but it could be the 9.

The pivot could be the 7, but it is not the 9.

Create a free account and access millions of resources

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?