Question Discussion & Solution

MCQ

In Quick sort algorithm,constants hidden in T(n lg n) are

Large

Not known

Medium

Small

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivotelementand:

There is explicit combine process as well to conquer the solution.

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

Discussion

MCQ

. Which of the following is something that has certain attributes or properties which may be assigned values?

Field

File

Records

Entity

Discussion

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

Discussion

MCQ

In a Heap tree

Values in a node is greater than every value in left sub tree and smaller than right sub tree

Values in a node is greater than every value in children of it

Both of above conditions applies

None of above conditions applies

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