Algorithm previous year question of gate

previous year question of ALGORITHMS gate 1993

ALGORITHMS |Gate-1994| Previous Year Questions| Set-14

ALGORITHMS |Gate-1994| FORTRAN implementation do not permit recursion because : [GATE – 1994] a. they use static allocation for variablesb. they use dynamic allocation for variablesc. stacks are not available on all machinesd. it is not possible to implement recursion on all machines Answer : a) The recurrence relation that arises in relation with the …

ALGORITHMS |Gate-1994| Previous Year Questions| Set-14 Read More »

previous year question of ALGORITHMS gate 1993

ALGORITHMS |Gate-1995| Previous Year Questions| Set-13

ALGORITHMS |Gate-1995| Merge sort uses : [GATE – 1995] a. Divide and conquer strategyb. Backtracking approachc. Heuristic searchd. Heuristic search Answer : a) For merging two sorted lists of sizes m and n into a sorted list of size m+n, we required comparisons of : [GATE – 1995] a. O(m)b. O(n)c. O(m+n)d. O(logm+logn) Answer : c) …

ALGORITHMS |Gate-1995| Previous Year Questions| Set-13 Read More »

previous year question of ALGORITHMS gate 1993

ALGORITHMS |Gate-2008| Previous Year Questions| Set-10

ALGORITHMS |Gate-2008| Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of the elements. Let T(n) be the number of comparisons required to sort n elements. Then : [GATE – 2008] a. T(n) ≤ 2T(n/5) + …

ALGORITHMS |Gate-2008| Previous Year Questions| Set-10 Read More »