Skip to content

Category Archives: GATE

Which of the following graphs is isomorphic to (A) A (B) B (C) C (D) D Answer: (B) Explanation: See Graph isomorphismQuiz of this Question… Read More
Which of the following problems are decidable? (A) 1, 2, 3, 4 (B) 1, 2 (C) 2, 3, 4 (D) 3, 4 Answer: (D) Explanation:… Read More
Which of the following transport layer protocols is used to support electronic mail? (A) SMTP (B) IP (C) TCP (D) UDP Answer: (C) Explanation: E-mail… Read More
The amount of ROM needed to implement a 4 bit multiplier is (A) 64 bits (B) 128 bits (C) 1 Kbits (D) 2 Kbits Answer:… Read More
Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. which… Read More
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces… Read More
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is (A) T(n) = 2T(n − 2) +… Read More
Given the basic ER and relational models, which of the following is INCORRECT? (A) An attribute of an entity can have more than one value… Read More
What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational” (A) A (B) B (C) C (D) D… Read More
Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of… Read More
Consider the function f(x) = sin(x) in the interval [π/4, 7π/4]. The number and location(s) of the local minima of this function are (A) One,… Read More
A process executes the code fork(); fork(); fork(); The total number of child processes created is (A) 3 (B) 4 (C) 7 (D) 8 Answer:… Read More
The decimal value 0.5 in IEEE single precision floating point representation has (A) fraction bits of 000…000 and exponent value of 0 (B) fraction bits… Read More
The truth table represents the Boolean function (A) X (B) X+Y (C) X xor Y (D) Y Answer: (A) Explanation: The value of f(X, Y)… Read More
The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is (A) (B) (C)… Read More

Start Your Coding Journey Now!