# Category Archives: MCQ (adsbygoogle = window.adsbygoogle || []).push({});

## Data Structures and Algorithms | Set 26

Following questions have been asked in GATE 2011 exam. 1) A max-heap is a heap where the value of each parent is greater than or… Read More »

## Data Structures and Algorithms | Set 25

Following questions have been asked in GATE 2010 exam. 1 Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij… Read More »

## Data Structures and Algorithms | Set 24

Following questions have been asked in GATE CS 2010 exam. 1. The following C function takes a simply-linked list as input argument. It modifies the… Read More »

## C Language | Set 7

Following questions have been asked in GATE CS 2010 exam. 1. What does the following program print? filter_none edit close play_arrow link brightness_4 code #include<stdio.h>… Read More »

## Data Structures and Algorithms | Set 23

Following questions have been asked in GATE CS 2005 exam. 1. Which one of the following is a key factor for preferring B-trees to binary… Read More »

## Data Structures and Algorithms | Set 22

Following questions have been asked in GATE CS 2005 exam. 1) A program P reads in 500 integers in the range [0..100] representing the scores… Read More »

## Data Structures and Algorithms | Set 21

Following questions have been asked in GATE CS 2008 exam. 1. The subset-sum problem is defined as follows. Given a set of n positive integers,… Read More »

## Data Structures and Algorithms | Set 20

Following questions have asked in GATE CS 2006 exam. 1. Let S be an NP-complete problem and Q and R be two other problems not… Read More »

## Data Structures and Algorithms | Set 19

Following questions have been asked in GATE CS 2009 exam. 1. Let X be a problem that belongs to the class NP. Then which one… Read More »

## Data Structures and Algorithms | Set 18

Following questions have been asked in GATE CS 2006 exam. 1. Consider the polynomial p(x) = a0 + a1x + a2x^2 +a3x^3, where ai !=… Read More »

## Data Structures and Algorithms | Set 17

Following questions have been asked in GATE CS 2006 exam. 1. An implementation of a queue Q, using two stacks S1 and S2, is given… Read More »

## C Language | Set 6

Following questions have been asked in GATE CS 2006 exam. 1. Consider the following C-program fragment in which i, j and n are integer variables.… Read More »

## Data Structures and Algorithms | Set 16

Following questions have been asked in GATE CS 2009 exam. 1. Consider a binary max-heap implemented using an array. Which one of the following array… Read More »

## Data Structures and Algorithms | Set 15

Following questions have been asked in GATE CS 2008 exam. 1. The most efficient algorithm for finding the number of connected components in an undirected… Read More »

## C Language | Set 5

Following questions have been asked in GATE CS 2008 exam. 1. What is printed by the following C program? filter_none edit close play_arrow link brightness_4… Read More »