11 + Interview Questions in Gate Cs 2002 in Gate Page 1 InterviewSolution

1.	In 8085, which of the following modifies the program counter ?(A) Only PCHL instruction(B) Only ADD instructions(C) Only JMP and CALL instructions(D) All instructions
Answer»

Discussion

2.	Consider the following logic circuit whose inputs and function and output is f.Given thatf1(dx, y, z) = ∑(0, 1, 3, 5),f2(dx, y, z) = ∑(6, 7) andf(dx, y, z) = ∑(1, 4, 5),f3 is :(A) ∑(1, 4, 5)(B) ∑(6, 7)(C) ∑(0, 1, 3, 5)(D) None of these
Answer» None

Discussion

3.	Minimum sum of product expression for f(w, x, y, z) shown in Karnaugh-map below isyz\wx0001111000011001x00111x00110011x(A) xz + y’z(B) xz’ + zx’(C) x’y + zx’(D) None of these
Answer»

Discussion

4.	Consider the following multiplexor where 10, 11, 12, 13 are four data input lines selected by two address line combinations A1A0 = 00, 01, 10, 11 respectively and f is “the output of the multiplexor. EN is the enable input.The function f(x, y, z) implemented by the above circuit is :(A) xyz’(B) xy + z(C) x + z(D) None of these
Answer»

Discussion

5.	In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on :(A) the size of the blocks, and the size of the address of the blocks.(B) the number of blocks used for the index, and the size of the blocks.(C) the size of the blocks, the number of blocks used for the index, and the size of the address of the blocks.(D) None of these
Answer»

Discussion

6.	Relation R is decomposed using a set of functional dependencies, F and relation S is decomposed using another set of functional dependencies G. One decomposition is definitely BCNF, the other is definitely 3NF, but it is not known which is which. To make a guaranteed identification, which one of the following tests should be used on the decompositions? (Assume that the closures of F and G are available).(A) Dependency-preservation(B) Lossless-join(C) BCNF definition(D) 3NF definition
Answer»

Discussion

7.	Relation R with an associated set of functional dependencies, F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set relations is.(A) Zero(B) More than zero but less than that of an equivalent 3NF decomposition(C) Proportional to the size of F+(D) Indeterminate
Answer»

Discussion

8.	A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left subtree is at least half and at most twice the number of nodes in the right subtree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) of such a tree on n nodes is best described by which of the following?(A) log2 n(B) log4/3 n(C) log3 n(D) log3/2 n
Answer»

Discussion

9.	Horizontal microprogramming :(A) does not require use of signal decoders(B) results in larger sized microinstructions than vertical microprogramming(C) uses one bit for each control signal(D) all of the above.
Answer»

Discussion

10.	“If X, then Y unless Z” is represented by which of the following formulae in propositional logic?(“¬” is negation “^” is conjunction, and “→” is implication)(A) (X ^ ¬ Z) → Y(B) (X ^ Y) → ¬ Z(C) (X → (Y ^ ¬ Z)(D) (X → Y(^ ¬ Z)
Answer»

Discussion

11.	The optimal page replacement algorithm will select the page that(A) Has not been used for the longest time in the past.(B) Will not be used for the longest time in the future.(C) Has been used least number of times.(D) Has been used most number of times.
Answer» Answer: (B) Explanation: The optimal page replacement algorithm will select the page whose next occurrence will be after the longest time in future. For example, if we need to swap a page and there are two options from which we can swap, say one would be used after 10s and the other after 5s, then the algorithm will swap out the page that would be required 10s later. Thus, B is the correct choice.

11.

The optimal page replacement algorithm will select the page that(A) Has not been used for the longest time in the past.(B) Will not be used for the longest time in the future.(C) Has been used least number of times.(D) Has been used most number of times.

Answer» Answer: (B)
Explanation: The optimal page replacement algorithm will select the page whose next occurrence will be after the longest time in future. For example, if we need to swap a page and there are two options from which we can swap, say one would be used after 10s and the other after 5s, then the algorithm will swap out the page that would be required 10s later.

Thus, B is the correct choice.

Discussion

Explore topic-wise InterviewSolutions in .

In 8085, which of the following modifies the program counter ?(A) Only PCHL instruction(B) Only ADD instructions(C) Only JMP and CALL instructions(D) All instructions

Consider the following logic circuit whose inputs and function and output is f.Given thatf1(dx, y, z) = ∑(0, 1, 3, 5),f2(dx, y, z) = ∑(6, 7) andf(dx, y, z) = ∑(1, 4, 5),f3 is :(A) ∑(1, 4, 5)(B) ∑(6, 7)(C) ∑(0, 1, 3, 5)(D) None of these

Minimum sum of product expression for f(w, x, y, z) shown in Karnaugh-map below isyz\wx0001111000011001x00111x00110011x(A) xz + y’z(B) xz’ + zx’(C) x’y + zx’(D) None of these

Horizontal microprogramming :(A) does not require use of signal decoders(B) results in larger sized microinstructions than vertical microprogramming(C) uses one bit for each control signal(D) all of the above.

“If X, then Y unless Z” is represented by which of the following formulae in propositional logic?(“¬” is negation “^” is conjunction, and “→” is implication)(A) (X ^ ¬ Z) → Y(B) (X ^ Y) → ¬ Z(C) (X → (Y ^ ¬ Z)(D) (X → Y(^ ¬ Z)

The optimal page replacement algorithm will select the page that(A) Has not been used for the longest time in the past.(B) Will not be used for the longest time in the future.(C) Has been used least number of times.(D) Has been used most number of times.