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

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

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

## C Language | Set 4

Following questions have been asked in GATE CS exam. 1. In the C language (GATE CS 2002) a) At most one activation record exists between… Read More »

## Operating Systems | Set 4

Following questions have been asked in GATE CS exam. 1. Using a larger block size in a fixed block size file system leads to (GATE… Read More »

## Data Structures and Algorithms | Set 8

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 »

## Data Structures and Algorithms | Set 7

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 »

## Principle of programming languages | Set 1

Following questions have been asked in GATE CS exam. 1.The most appropriate matching for the following pairs X: Indirect addressing 1: Loops Y: Immediate addressing… Read More »

## Data Structures and Algorithms | Set 6

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 »