Skip to content
Gblog 100 Days of Code – A Complete Guide For Beginners and Experienced
Do you want to become a successful software developer and dreaming about getting into the big tech companies? Are you someone who is already working… Read More
Which of the following relational calculus expressions is not safe? (A) A (B) B (C) C (D) D Answer: (C) Explanation: A tuple relational calculus… Read More
R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition? (A) A->B, B->CD (B) A->B, B->C, C->D… Read More
Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag [i] =… Read More
Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size… Read More
Which of the following does not interrupt a running process? (A) A device (B) Timer (C) Scheduler process (D) Power failure Answer: (C) Explanation: Scheduler… Read More
Consider the following program Program P2      var n: int:       procedure W(var x: int)       begin           x=x+1;           print x;         end          procedure D       begin            var n: int; … Read More
Consider the following three C functions : [PI] int * g (void)  {    int x= 10;    return (&x);  }         [P2] int * g (void) … Read More
How many people must be there in a room to make the probability 100% that at-least two people in the room have same birthday? Answer: 367… Read More
InMobi visited our campus twice, once for the written round, then for the personal interviews of the shortlisted candidates. So here is the written +… Read More
What is printed by the print statements in the program P1 assuming call by reference parameter passing? Program P1() { x = 10; y =… Read More
What is the minimum number of stacks of size n required to implement a queue of size n? (A) One (B) Two (C) Three (D)… Read More
How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v1, v2, … vn} of n vertices? (A)… Read More
Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r,u) and d(r,v) be the… Read More
Consider the following data path of a simple non-pilelined CPU. The registers A, B, A1, A2, MDR, the bus and the ALU are 8-bit wide.… Read More
Consider the circuit given below with initial state Q0 =1, Q1 = Q2 = 0. The state of the circuit is given by the value… Read More

Start Your Coding Journey Now!