that must be replaced with another integer so that the resulting array is sorted in non-decreasing order. The distance of the array [2, 5, 3, 1, 4, 2, 6] is __________

Numerical answer

Your answer

Source: GATE CSE 2024 Set 2 (CS2), IISc Bengaluru. Official question paper.

GATE CSE 2016 | Set 2 | Question 14

Dynamic Programming

MCQ1 mark

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

Single correct

Answer key coming soon

Source: GATE CSE 2016 Set 2, IISc Bengaluru. Official question paper.

GATE CSE 2011 | Question 25

Dynamic Programming

MCQ1 mark

An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array

A[0 : n-1]

is given below. Let

L_i

denote the length of the longest monotonically increasing sequence starting at index

i

in the array. Initialize

L_{n-1} = 1

. For all

i

such that

0 \le i \le n - 2

L_i = \begin{cases} 1 + L_{i+1} & \text{if } A[i] < A[i+1] \\ 1 & \text{Otherwise} \end{cases}

Finally the length of the longest monotonically increasing sequence is

\text{Max}(L_0, L_1, \ldots, L_{n-1})

. Which of the following statements is TRUE?

Single correct

Answer key coming soon

Source: GATE CSE 2011, IIT Madras. Official question paper.

Use ← → to move

Questions

3 total

Correct Wrong Answer seen

Sort

FiltersClear all

Year

Set

Marks

Marks

Question type

Question type