Question Discussion & Solution

MCQ

Which of the following belongs to the algorithm paradigm?

Minimum & Maximum problem

Knapsack problem

Selection problem

Merge sort

Quick sort.

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

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

MCQ

Data by itself is not useful unless

It is massive

It is processed to obtain information

It is collected from diverse sources

It is properly stated

Discussion

MCQ

Which sorting algorithn is faster :

O(n^2)

O(n+k)

O(nlogn)

O(n^3)

Discussion

MCQ

Which of the following is a set of data values and associated operations that are specified accurately, independent of any particular implementation?

Stack

Tree

Abstract data type

Graph

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