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

Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as… Read More »

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

A variable x is said to be live at a statement Si in a program if the following three conditions hold simultaneously: 1. There exists… Read More »

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

Let an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an? (A) an–2 +… Read More »

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

Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per… Read More »

## Visa Interview Experience | Set 6 (On-Campus)

Written Round: 75 minutes Test on Mettle. Assessment Composition: 1. Coding Skills: 2 Questions (One ques is from DP(easy one like 0-1 knapsack) and other… Read More »

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

Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9,… Read More »

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

Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For x ∈ V,… Read More »

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

(A) 0 (B) -1 (C) 1 (D) infinite Answer: (B) Explanation: Let f(x) be the given function. We assume that $\frac{1}{x} = z$ Differentiating both… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 53

The graph shown below 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A,… Read More »

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

Consider the following C program segment. The cyclomatic complexity of the program segment is __________. (A) 3 (B) 4 (C) 5 (D) 6 Answer: (C)… Read More »

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

Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m : n relationship R12, E1 and E3 are… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 50

An algorithm performs (logN)1/2 find operations, N insert operations, (logN)1/2 operations, and (logN)1/2 decrease-key operations on a set of data items with keys drawn from… Read More »

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

Consider the operations f(X, Y, Z) = X’YZ + XY’ + Y’Z’  and  g(X′, Y, Z) = X′YZ + X′YZ′ + XY Which one of… Read More »

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

Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. The same processor is upgraded to a… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 47

A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flipflop as follows. The Q output of the D flip-flop is connected to… Read More »