## GATE | GATE-CS-2002 | Question 45

Dynamic linking can cause security concerns because: (A) Security is dynamic (B) The path for searching dynamic libraries is not known till runtime (C) Linking… Read More »

## GATE | GATE-CS-2002 | Question 44

To evaluate an expression without any embedded function calls: (A) One stack is enough (B) Two stacks are needed (C) As many stacks as the… Read More »

## GATE | GATE-CS-2002 | Question 43

The C language is: (A) A context free language (B) A context sensitive language (C) A regular language (D) Parasble fully only by a Turing… Read More »

## GATE | GATE-CS-2002 | Question 42

The binary relation S = ф (empty set) on set A = {1, 2, 3} is : (A) Neither reflexive nor symmetric (B) Symmetric and… Read More »

## GATE | GATE-CS-2002 | Question 41

Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is : (A) 1/16 (B) 1/8 (C)… Read More »

## GATE | GATE-CS-2002 | Question 40

The Newton-Raphson iteration Xn + 1 = (Xn/2) + 3/(2Xn) can be used to solve the equation (A) X2 = 3 (B) X3 = 3… Read More »

## GATE | GATE-CS-2002 | Question 39

Which of the following is true? (A) The complement of a recursive language is recursive. (B) The complement of a recursively enumerable language is recursively… Read More »

## GATE | GATE-CS-2002 | Question 38

The smallest finite automation which accepts the language {x | length of x is divisible by 3} has : (A) 2 states (B) 3 states… Read More »

## GATE | GATE-CS-2002 | Question 37

A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left subtree is at least half and… Read More »

## GATE | GATE-CS-2002 | Question 36

The running time of the following algorithm Procedure A(n) If n < = 2 return (1) else return (A(Image not present√nImage not present)); is best… Read More »

## GATE | GATE-CS-2002 | Question 35

Consider the following algorithm for searching for a given number x in an unsorted array A[1…..n] having n distinct values: 1. Choose an i uniformaly… Read More »

## GATE | GATE-CS-2002 | Question 34

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is: (A) n/2 (B) (n… Read More »

## GATE | GATE-CS-2002 | Question 33

Consider the following declaration of a two dimensional array in C: Assuming that the main memory is byte-addressable and that the array is stored starting… Read More »

## GATE | GATE-CS-2002 | Question 32

Horizontal microprogramming : (A) does not require use of signal decoders (B) results in larger sized microinstructions than vertical microprogramming (C) uses one bit for… Read More »

## GATE | GATE-CS-2002 | Question 31

The performance of a pipelined processor suffers if : (A) the pipeline stages have different delays (B) consecutive instructions are dependent on each other (C)… Read More »