GATE | GATE CS 1999 | Question 2
Suppose that the expectation of a random variable X is 5. Which of the following statement is True? (A) There is a simple point at which X has the v...Read More
Suppose that the expectation of a random variable X is 5. Which of the following statement is True? (A) There is a simple point at which X has the v...Read More
[5 Marks question] A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both virtual an...Read More
[5 Marks question] What will be the output of the following program assuming that parameter passing is (i) call by value (ii) call by reference (iii)...Read More
[5 Marks question] a. Show that the formula [(~p ∨ q) ⇒ (q⇒ p)] is not a tautology. b. Let A be a tautology and B be any other formula. Prove that (...Read More
[5 Marks question] a. Consider the following algorithm. Assume procedure A and procedure B take O(1) and O(1/n) unit of time respectively. Derive the...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