GATE | GATE CS 1999 | Question 44
Arrange the following configurations for CPU in decreasing order of operating speeds; Hardwired Control, vertical microprogramming, horizontal micropr...Read More
Arrange the following configurations for CPU in decreasing order of operating speeds; Hardwired Control, vertical microprogramming, horizontal micropr...Read More
RAID configurations of disks are used to provide (A) Fault-tolerance (B) High speed (C) High data density (D) None of the above Answer: (A) Explanatio...Read More
Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2 ≠ Ø. The decomp...Read More
Let R = ( A, B, C, D, E, F ) be a relation scheme with the following dependencies: C→F, E→A, EC→D, A→B. Which of the following is a key of R? (A) CD (...Read More
The Newton-Raphson method is to be used to find the root of the equation f(x)=0 where x0 is the initial approximation and f ' is the derivative of f....Read More
Consider the join of a relation R with a relation S. If K has m tuples and S has n tuples, then the maximum and minimum sizes of the join respectively...Read More
The number of articulation point of the following graph is: (A) 0 (B) 1 (C) 2 (D) 3 Answer: (D) Explanation: An articulation point is a vertex whose r...Read More
Consider the regular expression (0+1)(0+1)... n times. The minimum state finite automaton that recognizes the language represented by this regular exp...Read More
[5 Marks question] Suppose we have a function HALTS which when applied to any arbitrary function f and its arguments will say TRUE if function f termi...Read More
[5 Marks question] Show that the language L = { xcx | x∈ {0,1}* and c is a terminal symbol } is not context free, c is not 0 or 1. Answer: Explanation...Read More