# Tag Archives: GATE-CS-2015 (Set 3)

## GATE | GATE-CS-2015 (Set 3) | Question 65

Consider three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown below The values of McCabe’s Cyclomatic complexity… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 64

Consider the following C program. The output of the program is __________. filter_none edit close play_arrow link brightness_4 code # include <stdio.h> int f1(void); int… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 63

Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 61

Consider the following reservation table for a pipeline having three stages S1, S2 and S3. Time –> —————————– 1 2 3 4 5 —————————– S1… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 60

The velocity v (in kilometer/minute) of a motorbike which starts from rest, is given at fixed intervals of time t(in minutes) as follows: t 2… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 59

Suppose c = 〈c, … , c[k – 1]〉 is an array of length k, where all the entries are from the set {0, 1}.… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

Consider the following C program: filter_none edit close play_arrow link brightness_4 code # include <stdio.h> int main( ) {    int i, j, k = 0;… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format. OP Ri, Rj, Rk where operation… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 56

Consider B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 55

(A) A (B) B (C) C (D) D Answer: (A) Explanation: Given- Putting we get- Subtracting the second equation from the first one we get-… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 54

Given the function F = P′ + QR, where F is a function in three Boolean variables P, Q and R and P′ = !P,… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

The total number of prime implicants of the function f(w, x, y, z) = Σ(0, 2, 4, 5, 6, 10) is ________. (A) 2 (B)… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

Let f(n) = n and g(n) = n(1+sin n), where n is a positive integer. Which of the following statements is/are correct? I. f(n) =… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 51

Let R be a relation on the set of ordered pairs of positive integers such that ((p, q), (r, s)) ∈ R if and only… Read More »