Question Discussion & Solution

MCQ

The upper bound on the time complexity of the nondeterministic sorting algorithm is

O(n)

O(n log n)

O(1)

O( log n)

O(n^2).

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The deletion mechanism in the stack is called as

PUSH

POP

Delete

None of these

Discussion

MCQ

LIFO mechanism is used in

Stack

Queue

Array

linked list

Discussion

MCQ

Who invented the word Algorithm

Abu Ja

Abu Mohammed Khan

Abu Jafar Mohammed Kasim

Abu Ja

Discussion

MCQ

The general criteria of algorithm; algorithm must terminates after a finite number of steps ______

Output

Finiteness

Effectiveness

Input

Discussion

MCQ

The Average case occur in linear search algorithm

When Item is somewhere in the middle of the array

When Item is not in the array at all

When Item is the last element in the array

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

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

Asymptotic Notation

Divide and Conquer Strategy

Sorting

Linear Time Sorting

Dynamic Programming

Greedy Algorithms

Backtracking Algorithms

Graphs

Complexity Theory

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Design and Analysis of Algorithms Topics