## GATE | GATE-CS-2004 | Question 90

Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.  Group-1  Group-2  P.  Functional  1.  Command-based, proce-dural  Q.… Read More »

## GATE | GATE-CS-2004 | Question 89

L1 is a recursively enumerable language over Σ. An algorithm A effectively enumerates its words as w1, w2, w3, … Define another language L2 over… Read More »

## GATE | GATE-CS-2004 | Question 88

Consider the following grammar G: S → bS | aA | b A → bA | aB B → bB | aS | a Let… Read More »

## GATE | GATE-CS-2004 | Question 87

The language {am bn Cm+n | m, n ≥ 1} is (A) regular (B) context-free but not regular (C) context sensitive but not context free… Read More »

## GATE | GATE-CS-2004 | Question 86

The following finite state machine accepts all those binary strings in which the number of 1’s and 0’s are respectively. (A) divisible by 3 and… Read More »

## GATE | GATE-CS-2004 | Question 85

A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node… Read More »

## GATE | GATE-CS-2004 | Question 90

The recurrence equation T(1) = 1 T(n) = 2T(n – 1) + n, n ≥ 2 evaluates to (A) 2n + 1– n – 2… Read More »

## GATE | GATE-CS-2004 | Question 83

The time complexity of the following C function is (assume n > 0) filter_none edit close play_arrow link brightness_4 code int recursive (int n) {… Read More »

## GATE | GATE-CS-2004 | Question 82

Let A[1, …, n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is… Read More »

## GATE | GATE-CS-2004 | Question 81

Let G1 = (V, E1) and G2 = (V, E2) be connected graphs on the same vertex set V with more than two vertices. If… Read More »

## GATE | GATE-CS-2004 | Question 80

A point is randomly selected with uniform probability in the X-Y plane within the rectangle with corners at (0,0), (1,0), (1,2) and (0,2). If p… Read More »

## GATE | GATE-CS-2004 | Question 90

How many graphs on n labeled vertices exist which have at least (n2 – 3n)/2 edges ? (A) A (B) B (C) C (D) D… Read More »

## GATE | GATE-CS-2004 | Question 78

Two n bit binary strings, S1 and S2, are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number… Read More »

## GATE | GATE-CS-2004 | Question 77

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is (A) 2… Read More »

## GATE | GATE-CS-2004 | Question 76

In an M’N matrix such that all non-zero entries are covered in a rows and b columns. Then the maximum number of non-zero entries, such… Read More »