## 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 »

## 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 »

## Data Structures and Algorithms | Set 14

Following questions have been asked in GATE CS 2008 exam. 1. We have a binary heap on n elements and wish to insert n more… Read More »

## Data Structures and Algorithms | Set 13

Following questions have been asked in GATE CS 2002 exam 1. The number of leaf nodes in a rooted tree of n nodes, with each… Read More »

## Data Structures and Algorithms | Set 12

Following questions have been asked in GATE CS 2007 exam. 1. Consider the following C program segment where CellNode represents a node in a binary… Read More »

## Data Structures and Algorithms | Set 11

Following questions have been asked in GATE CS 2007 exam. 1. Consider a hash table of size seven, with starting index zero, and a hash… Read More »

## Data Structures and Algorithms | Set 10

Following questions have been asked in GATE CS 2007 exam. 1. The height of a binary tree is the maximum number of edges in any… Read More »

## Data Structures and Algorithms | Set 9

Follow questions have been asked in GATE CS exam. 1 In a heap with n elements with the smallest element at the root, the 7th… Read More »