# Tag Archives: GATE-GATE-CS-2007

## GATE | GATE-CS-2007 | Question 25

Let A be a 4 x 4 matrix with eigenvalues -5, -2, 1, 4. Which of the following is an eigenvalue of [A I] [I… Read More »

## GATE | GATE-CS-2007 | Question 24

Suppose we uniformly and randomly select a permutation from the 20! Permutations of 1, 2, 3 ,…..,20. What is the probability that 2 appears at… Read More »

## GATE | GATE-CS-2007 | Question 23

Which of the following graphs has an Eulerian circuit? (A) Any k-regular graph where kis an even number. (B) A complete graph on 90 vertices… Read More »

## GATE | GATE-CS-2007 | Question 85

Let Graph(x) be a predicate which denotes that x is a graph. Let Connected(x) be a predicate which denotes that x is connected. Which of… Read More »

## GATE | GATE-CS-2007 | Question 85

How many different non-isomorphic Abelian groups of order 4 are there (A) 2 (B) 3 (C) 4 (D) 5 Answer: (A) Explanation: 2 can be… Read More »

## GATE | GATE-CS-2007 | Question 20

Which one of the following uses UDP as the transport protocol? (A) HTTP (B) Telnet (C) DNS (D) SMTP Answer: (C) Explanation: UDP is a… Read More »

## GATE | GATE-CS-2007 | Question 85

In Ethernet when Manchester encoding is used, the bit rate is: (A) Half the baud rate. (B) Twice the baud rate. (C) Same as the… Read More »

## GATE | GATE-CS-2007 | Question 18

Which one of the following is a top-down parser? (A) Recursive descent parser. (B) Operator precedence parser. (C) An LR(k) parser. (D) An LALR(k) parser… Read More »

## GATE | GATE-CS-2007 | Question 17

Consider the following statements about user level threads and kernel level threads. Which one of the following statement is FALSE? (A) Context switch time is… Read More »

## GATE | GATE-CS-2007 | Question 85

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2. Group I… Read More »

## GATE | GATE-CS-2007 | Question 85

Consider the following segment of C-code: int j, n; j = 1; while (j 0 is: Base of Log is 2 in all options. (A)… Read More »

## GATE | GATE-CS-2007 | Question 14

Which of the following sorting algorithms has the lowest worst-case complexity? (A) Merge sort (B) Bubble Sort (C) Quick Sort (D) Selection Sort Answer: (A)… Read More »

## GATE | GATE-CS-2007 | Question 13

The maximum number of binary trees that can be formed with three unlabeled nodes is: (A) 1 (B) 5 (C) 4 (D) 3 Answer: (B)… Read More »

## GATE | GATE-CS-2007 | Question 12

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a… Read More »

## GATE | GATE-CS-2007 | Question 11

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit… Read More »