1
GATE CSE 2019
Numerical
+1
-0
Consider a sequence of 14 elements : A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum $$S\left( {i,j} \right) = \sum\limits_{k = 1}^j {A\left[ k \right]} $$. Determine the maximum of S(i, j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used)

Answer : ________.
Your input ____
2
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?
T(1) = 2T (n/2) + log n
A
$$\theta (n)$$
B
$$\theta (n \log n)$$
C
$$\theta (n^2)$$
D
$$\theta (\log n)$$
3
GATE CSE 2014 Set 3
Numerical
+1
-0
The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given value of X using only one temporary variable is _____.
Your input ____
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
You have an array of n elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is
A
O(n2)
B
O(n log n)
C
$$\Theta (n \log n)$$
D
O(n3)
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12