# Tag Archives: GATE-GATE-CS-2007

## GATE | GATE-CS-2007 | Question 10

Consider a 4-way set associative cache consisting of 128 lines with a line size of 64 words. The CPU generates a 20-bit address of a… Read More »

## GATE | GATE-CS-2007 | Question 85

Consider the following Boolean function of four variables: f(w,x,y,z) = ∑(1,3,4,6,9,11,12,14) The function is: (A) independent of one variables. (B) independent of two variables. (C)… Read More »

## GATE | GATE-CS-2007 | Question 85

How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line decoder without using any other logic gates? (A) 7… Read More »

## GATE | GATE-CS-2007 | Question 7

Which of the following is TRUE? (A) Every subset of a regular set is regular. (B) Every finite subset of a non-regular set is regular.… Read More »

## GATE | GATE-CS-2007 | Question 6

Which of the following problems is undecidable?  (A) Membership problem for CFGs (B) Ambiguity problem for CFGs. (C) Finiteness problem for FSAs. (D) Equivalence… Read More »

## GATE | GATE-CS-2007 | Question 5

Consider the DAG with Consider V = {1, 2, 3, 4, 5, 6}, shown below. Which of the following is NOT a topological ordering? (A)… Read More »

## GATE | GATE-CS-2007 | Question 4

Let G be the non-planar graph with the minimum possible number of edges. Then G has (A) 9 edges and 5 vertices (B) 9 edges… Read More »

## GATE | GATE-CS-2007 | Question 85

What is the maximum number of different Boolean functions involving n Boolean variables? (A) n2 (B) 2n (C) 22n (D) 2n2 Answer: (C) Explanation: No… Read More »

## GATE | GATE-CS-2007 | Question 2

Let S be a set of nelements. The number of ordered pairs in the largest and the smallest equivalence relations on S are: (A) n… Read More »

## GATE | GATE-CS-2007 | Question 1

Consider the following two statements about the function f(x)=|x| P. f(x) is continuous for all real values of x Q. f(x) is differentiable for all… Read More »