Skip to content
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
A policeman sees a thief at a distance of 100 meters and starts to chase him. The thief sees him and starts to run too.… Read More
If John walks at the speed of 5 km/h, he reaches his office 7 minutes late. However, if he walks at the speed of 6… Read More
I recently had interviews with Amazon at Hyderabad for SDE 1. I had around 1 year and 9 months of experience. Telephonic Interview : It… Read More
The following bit pattern represents a floating point number in IEEE 754 single precision format 1 10000011 101000000000000000000000Attention reader! Don’t stop learning now.  Practice GATE… Read More
Let N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the… Read More
Which of the following regular expressions describes the language over {0, 1} consisting of strings that contain exactly two 1’s? (A) (0 + 1) *… Read More
What is the size of the smallest MIS(Maximal Independent Set) of a chain of nine nodes? (A) 5 (B) 4 (C) 3 (D) 2 Answer:… Read More
What is the chromatic number of the following graph? (A) 2 (B) 3 (C) 4 (D) 5 Answer: (B) Explanation: The chromatic number of a… Read More
A sample space has two events A and B such that probabilities P(A ∩ B) = 1/2, P(A’) = 1/3, P(B’) = 1/3. What is… Read More
A set of Boolean connectives is functionally complete if all Boolean functions can be synthesized using those. Which of the following sets of connectives is… Read More
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number 180.… Read More
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at truck number 180.… Read More
Let P1,P2,…,Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi and Pj, let… Read More
Let P1, P2,….. , Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi… Read More
Consider the following expression ad’ + (ac)’ + bc’d Which of the following expressions does not correspond to the Karnaugh Map obtained for the above… Read More