Question Discussion & Solution

MCQ

Testing of a program consists of 2 phases which are ______________________ and ____________

Average case & Worst case

Time complexity & Space complexity

Validation and checking errors

Debugging and profiling

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The amount of time needs to run to completion is known as____________

Space complexity

Worst case

Time complexity

Best case

Discussion

MCQ

Which of the following is not a primitive data structure?

Boolean

Integer

Arrays

Character

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

The worst case time complexity of the nondeterministic dynamic knapsack algorithm is

O(n log n)

O( log n)

O(n^2)

O(n)

O(1).

Discussion

MCQ

A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

Singly Linked List

Circular Linked List

Doubly Linked List

Linear Linked List

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