2,933 views

2 Answers

Best answer
1 votes
1 votes

See here for subject wise mark distribution in GATE 2016 and previous years: http://md.gatecse.in

selected by
0 votes
0 votes
Some Questions : (Feb 06 , 2016 : Set 2)

 

1) L1: T(M) : at least 2016 steps for all inputs
L2: T(M)  : at least 2016 steps for some inputs
L3 : T(M) for all inputs
Nature of L1 , L2 ,L3 ?
2) 13power99 mod 17 == ?
3) Minimum color for vertex-cover for a planar Graph ?
4) 1,2,3,4,5,6,7 key are in binary search tree. How many trees will be possible for height 7 , assuming root at level 1 ?
5) key [1,1023] are in Min Heap ; max height of 9 th element ? (root at level 0)...
6) S: two transactions starting from reading with 2nd with no producer consumer situation and last step for both abort of 1st followed by 2nd abort.
Is S will be recoverable and cascading rollback ? (transaction steps i dont remeber)
7)                 A(n)
                  |
                A(n/2)
                  |
    return    <--------    A(n/2)            A(n/2) -----> A(n/2)
                               |
            return    <--------    A(n/2)        A(n/2) -------------> return

Compexity of A(n) is O(n^{alpha}) .. what is {alpha} ???

Related questions

1 votes
1 votes
3 answers
1
Satish06 asked Feb 3, 2019
4,777 views
1 votes
1 votes
0 answers
3