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
Given N number of coins, the task is to find probability of getting at least K number of heads after tossing all the N coins… Read More
Consider the following functions from positives integers to real numbers 10, √n, n, log2n, 100/n.Attention reader! Don’t stop learning now.  Practice GATE exam well before… Read More
Consider a two-level cache hierarchy L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate… Read More
Consider the following grammar p --> xQRS Q --> yz|z R --> w|∈ S -> y Which is FOLLOW(Q)?Attention reader! Don’t stop learning now.  Practice… Read More
Consider the first-order logic sentence F: ∀ x (∃ y R(x,y)).Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with… Read More
Let c1, cn be scalars not all zero. Such that the following expression holds: where ai is column vectors in Rn. Consider the set of… Read More
Given a positive integer n, count numbers x such that 0 < x <n and x^n > n where ^ is bitwise XOR operation.Examples:   Input… Read More
Threads of a process share (A) global variables but not heap (B) heap but not global variables (C) neither global variables nor heap (D) both… Read More
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it… Read More
The statement (¬ p) → (¬ q) is logically equivalent to which of the statements below? I. p → q Attention reader! Don’t stop learning… Read More
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree… Read More
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: Attention reader! Don’t stop learning… Read More
The following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}: V -> W VW -> X Y -> VX Y… Read More
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q… Read More
A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or… Read More