DSA Quiz

Algorithms Quiz | Dynamic Programming | Question 8

Last Updated: 04 May 2020

What happens when a top-down approach of dynamic programming is applied to any problem?(A) It increases both, the time complexity and the sp ...read more

UGC-NET | UGC NET CS 2015 Jun - II | Question 24

Last Updated: 12 December 2018

The average case occurs in the Linear Search Algorithm when:(A) The item to be searched is in some where middle of the Array(B) The item to ...read more

Algorithms | Recursion | Question 9

Similar Topics

DSA

22.3k+ articles

Sorting Quiz

71+ articles

misc

70+ articles

Algorithms-Graph Traversals

40+ articles

Algorithms-Analysis of Algorithms

29+ articles

Algorithms-Sorting-Quiz

27+ articles

Algorithms-Graph Shortest Paths Quiz

24+ articles

Analysis of Algorithms

22+ articles

Algorithms-Misc

22+ articles

Graph Shortest Paths Quiz

18+ articles

Last Updated: 17 May 2019

Predict output of following program[tabby title="C"][sourcecode language="c"]#include int fun(int n){ if (n == 4) retur ...read more

Algorithms | Graph Traversals | Question 12

Algorithms-Recursion

Last Updated: 15 November 2018

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes ...read more

Algorithms-Graph Traversals

Graph Traversals

Algorithms | Dynamic Programming | Question 5

Last Updated: 28 June 2021

Four matrices M1, M2, M3 and M4 of dimensions pxq, qxr, rxs and sxt respectively can be multiplied is several ways with differen ...read more

Algorithms-Dynamic Programming

Algorithms | Analysis of Algorithms | Question 9

Last Updated: 28 June 2021

In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statem ...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms

Algorithms | Sorting | Question 14

Last Updated: 11 June 2019

In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. Which of the following is the t ...read more

Algorithms | Backtracking | Question 1

Last Updated: 10 February 2013

Which of the following is not a backtracking algorithm?(A) Knight tour problem ...read more

Algorithms | Analysis of Algorithms | Question 19

Algorithms-Backtracking

Last Updated: 28 June 2021

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3, and f4? f1(n) = 2n f2(n) = n(3/ ...read more

Algorithms-Analysis of Algorithms

Analysis of Algorithms

Algorithms | Sorting | Question 9

Last Updated: 22 December 2021

Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or m ...read more

Algorithms | Dynamic Programming | Question 2

Last Updated: 23 September 2018

We use dynamic programming approach when (A)We need an optimal solution(B)The solution has optimal substructure(C)The ...read more

Algorithms-Dynamic Programming

Algorithms | Sorting | Question 7

Last Updated: 06 September 2021

Which of the following is not true about comparison-based sorting algorithms? (A)The minimum possible time complexity ...read more

Algorithms | Sorting | Question 6

Last Updated: 28 June 2021

Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that ...read more

Algorithms | Sorting | Question 5

Last Updated: 20 October 2021

Given an unsorted array. The array has this property that every element in the array is at most k distance from its position in ...read more