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

## GATE | GATE-CS-2002 | Question 5

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (A) log2… Read More »

## GATE | GATE-CS-2002 | Question 4

The minimum number of colours required to colour the vertices of a cycle with η nodes in such a way that no two adjacent nodes… Read More »

## GATE | GATE-CS-2002 | Question 3

The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is: (A) 2k (B) (3k + 1 – 1)/2… Read More »

## GATE | GATE-CS-2002 | Question 3

The trapezoidal rule for integration give exact result when the integrand is a polynomial of degree: (A) 0 but not 1 (B) 1 but not… Read More »

## GATE | GATE-CS-2002 | Question 1

The rank of the matrix is : (A) 4 (B) 2 (C) 1 (D) 0 Answer: (C) Explanation:   Rank of the matrix is defined… 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 »

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

## C Language | Set 3

Following questions have been asked in GATE CS exam. 1.Assume the following C variable declaration int *A [10], B[10][10]; Of the following expressions I A[2]… Read More »