Gblog Must Do Coding Questions for Product Based Companies
As the placement season is back, GeeksforGeeks is here to help you crack the interview. We have selected some most commonly asked and MUST DO… Read More
Four fair six-sided dice are rolled. The probability that the sum being 22 is X/1296. The value of X is ________ (A) 7 (B) 8… Read More
A function is continuous in the interval [0, 2]. It is known that f(0) = f(2) = -1 and f(1) = 1. Which one of… Read More
The function f(x) = x sinx satisfies the following equation f”(x) + f(x) + t cosx = 0. The value of t is (A) -1… Read More
Consider a 4-to-1 multiplexer with two select lines S1 and S0, given below Attention reader! Don’t stop learning now.  Practice GATE exam well before the… Read More
An access sequence of cache block address is of length N and contains n unique block addresses. The number of unique block addresses between two… Read More
Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing… Read More
Consider a hash table with 9 slots. The hash function is ℎ(k) = k mod 9. The collisions are resolved by chaining. The following 9… Read More
I attended Expedia interview for SDE-II role. Here are the questions on each round.Hey geek! It's time to become a success story instead of reading… Read More
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do… Read More
Consider the following C function in which size is the number of elements in the array E: The value returned by the function MyX is… Read More
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ______________. (A) 148 (B) 147 (C) 146 (D)… Read More
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following… Read More
There are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags have coins of weight… Read More
Which of the regular expressions given below represent the following DFA? I) 0*1(1+00*1)* II) 0*1*1+11*0*1 III) (0+1)*1 (A) I and II only (B) I and… Read More
Let L be a language and L’ be its complement. Which one of the following is NOT a viable possibility? (A) Neither L nor L’… Read More