Tag Archives: GATE-CS-DS-&-Algo

Following questions have been asked in GATE CS exam. 1. Consider the following functions Which of the following is true? (GATE CS 2000) (a) h(n)… Read More

Following questions have been asked in GATE CS 2006 exam. 1. In a binary max heap containing n numbers, the smallest element can be found… Read More

Following questions have been asked in GATE CS exam. 1. The usual Θ(n^2) implementation of Insertion Sort to sort an array uses linear search to… Read More

Following questions have been asked in GATE CS exam. 1. Consider the following C function. float f(float x, int y)  {    float p, s; int… Read More

Following questions have been asked in GATE CS exam. 1. Consider the following C program segment c struct CellNode {   struct CelINode *leftchild;   int element;   struct… Read More

Following questions have asked in GATE CS exam.  1. Suppose you are given an array s[1…n] and a procedure reverse (s,i,j) which reverses the order… Read More

Following questions have been asked in GATE CS exam. 1. Consider the function f defined below. struct item  {    int data;    struct item * next; … Read More