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

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

Let X denote the Exclusive OR (XOR) operation. Let ‘1’ and ‘0’ denote the binary constants. Consider the following Boolean expression for F over two… Read More »

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

Consider the following relational schema: employee(empId, empName, empDept) customer(custId, custName, salesRepId, rating) salesRepId is a foreign key referring to empId of the employee relation. Assume… Read More »

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

The CORRECT formula for the sentence, “not all rainy days are cold” is (A) A (B) B (C) C (D) D Answer: (D) Explanation: (A)… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 62

Consider the set of all functions f: {0,1, … ,2014} → {0,1, … ,2014} such that f(f(i)) = i, for all 0 ≤ i ≤… Read More »

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

Let d denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices with d ≥ 3, which one… Read More »

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

If G is a forest with n vertices and k connected components, how many edges does G have? (A) floor(n/k) (B) ceil(n/k) (C) n-k (D)… Read More »

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

There are two elements x, y in a group (G,∗) such that every element in the group can be written as a product of some… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 58

Let S be the sample space and two mutually exclusive events A and B be such that A U B = S. If P(.) denotes… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 57

The value of integral given below is: (A) (B) (C) (D) (A) A (B) B (C) C (D) D Answer: (A) Explanation: Using Integration By-parts-… Read More »

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

(A) I Only (B) II Only (C) Both I and II (D) Neither I or II Answer: (C) Explanation: Quiz of this Question My Personal… Read More »

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

The above sequential circuit is built using JK flip-flops is initialized with Q2Q1Q0 = 000. The state sequence for this circuit for the next 3… Read More »

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

The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss… Read More »

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

An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback… Read More »

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

Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order. filter_none edit close play_arrow link… Read More »

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

Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation.… Read More »