Question Discussion & Solution

MCQ

. The time factor when determining the efficiency of algorithm is measured by

Counting microseconds

Counting the number of statements

Counting the number of key operations

Counting the kilobytes of algorithm operations

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following case does not exist in complexity theory

Best case

Worst case

Average case

Null case

Discussion

MCQ

The space factor when determining the efficiency of algorithm is measured by

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

Counting the average memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

Discussion

MCQ

Dijkstra

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

Has greedy approach to compute single source shortest paths to all other vertices

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

Discussion

MCQ

The complexity of linear search algorithm is

O(n)

O(log n)

O(n^2)

O(n log n)

Discussion

MCQ

The deletion mechanism in the stack is called as

PUSH

POP

Delete

None of these

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