Which of the following is not the required condition for binary search algorithm?

There must be mechanism to delete and/or insert elements in list.

There should be the direct access to the mid element in any sub list

Number values should only be present

Consider the code given below, which runs insertion sort: void insertionSort(int arr[], int array_size) { int i, j, value; for (i = 1; i < array_size; i++) { value = arr[i]; j = i; while (________ ) { arr[j] = arr[j − 1]; j = j − 1; } arr[j] = value; } } Which condition will correctly implement the while loop?

(j > 0) && (arr[j − 1] > value)

(j > 0) || (arr[j − 1] > value)

(j > 0) && (arr[j + 1] > value)

(j > 0) && (arr[j + 1] < value)

Consider an array of length 5, arr[5] = {9,7,4,2,1}. What are the steps of insertions done while running insertion sort on the array?

7 9 4 2 1 4 7 9 2 1 2 4 7 9 1 1 2 4 7 9

9 7 4 1 2 9 7 1 2 4 9 1 2 4 7 1 2 4 7 9

7 4 2 1 9 4 2 1 9 7 2 1 9 7 4 1 9 7 4 2

7 9 4 2 1 2 4 7 9 1 4 7 9 2 1 1 2 4 7 9

Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order. Statement 2: And these elements are the m smallest elements in the array.

Statement 1 is true but statement 2 is false

Statement 1 is false but statement 2 is true

RMP MCA-22.01.24-searching and sorting-FN

Authored by CCC info@ccc.training

English

Professional Development

Used 1+ times

RMP MCA-22.01.24-searching and sorting-FN

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

Content View
Student View

15 questions

Show all answers

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is correct recurrence for worst case of Binary Search?

T(n) = 2T(n/2) + O(1) and T(1) = T(0) = O(1)

T(n) = T(n-1) + O(1) and T(1) = T(0) = O(1)

T(n) = T(n/2) + O(1) and T(1) = T(0) = O(1)

T(n) = T(n-2) + O(1) and T(1) = T(0) = O(1)

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the time complexity of binary search with iteration?

O(nlogn)

O(logn)

O(n)

O(n2)

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found using Binary Search?

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion using Binary Search?

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the worst case complexity of binary search using recursion?

O(n log n)

O(log n)

O(n)

O(n2)

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is not a limitation of binary search algorithm?

must use a sorted array

requirement of sorted array is expensive when a lot of insertion and deletions are needed

there must be a mechanism to access middle element directly

binary search algorithm is not efficient when the data elements are more than 1500

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The Average case occurs in linear search algorithm _____________

when item is somewhere in the middle of the array

when item is not the array at all

when item is the last element in the array

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

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 Microsoft

or continue with

Facebook

Apple

Others

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

Already have an account?

Similar Resources on Wayground

20 questions

Business English Units 1-2 Vocabulary

Quiz

•

11th Grade - Professi...

15 questions

IPA - Session 6 - Review /b/ /p/ ; /s/ /z/ /ʃ/

Quiz

•

KG - Professional Dev...

10 questions

Degree Of Comparison (Tingkat perbandingan)

Quiz

•

Professional Development

15 questions

20 dec 2023 SRMIST TRP CPS AN

Quiz

•

Professional Development

15 questions

Who wants to be a Millionaire Unit 1/2

Quiz

•

Professional Development

18 questions

CTO Plywood

Quiz

•

Professional Development

20 questions

IELTs - Mindset 2 (not complete) News and the media adjectives.

Quiz

•

Professional Development

15 questions

SASI -1st year -DAY5-FN (22.12.23)

Quiz

•

Professional Development

Popular Resources on Wayground

21 questions

Continents and Oceans

Quiz

•

6th Grade

20 questions

Parts of Speech

Quiz

•

5th Grade

16 questions

Subject & Predicate

Quiz

•

5th Grade

25 questions

Multiplication Facts

Quiz

•

5th Grade

6 questions

Rule of Law

Quiz

•

6th - 12th Grade

22 questions

Continents and Oceans

Quiz

•

5th Grade

10 questions

Movie Trivia

Quiz

•

KG - 2nd Grade

15 questions

Rounding Decimals

Quiz

•

5th Grade

Discover more resources for English

10 questions

Irregular verbs (1)

Presentation

•

Professional Development

RMP MCA-22.01.24-searching and sorting-FN

Which of the following is correct recurrence for worst case of Binary Search?

What is the time complexity of binary search with iteration?

Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found using Binary Search?

Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion using Binary Search?

What is the worst case complexity of binary search using recursion?

Which of the following is not a limitation of binary search algorithm?

The Average case occurs in linear search algorithm _____________

Binary search algorithm cannot be applied to ___________________.

Complexity of linear search algorithm is ________________.

Which of the following is not the required condition for binary search algorithm?

Access all questions and much more by creating a free account

Similar Resources on Wayground

Popular Resources on Wayground

Discover more resources for English