1
GATE CSE 1987
Subjective
+2
-0
Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1
2
GATE CSE 1987
Subjective
+2
-0
What is the generating function G (z) for the sequence of Fibonacci numbers?
3
GATE CSE 1987
MCQ (Single Correct Answer)
+2
-0.6
Let P be a quicksort program to sort numbers in ascending order. Let t1 and t2 be the time taken by the program for the inputs [1 2 3 4] and [5 4 3 2 1], respectively. Which of the following holds?
A
t1 = t2
B
t1 > t2
C
t1 < t2
D
t1= t2 + 5 log 5
4
GATE CSE 1987
Subjective
+2
-0
Find a solution to the following recurrence equation
T(n) = T(n - 1)+ n
T(1) = 1
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12