Skip to content
Gblog Get FREE Placement Assistance with GeeksforGeeks LIVE Courses to Upskill Yourself
The job market has changed drastically post-pandemic – with frequent job-hopping and the race to upskill oneself. The latter has proved to be a game-changer… Read More
If G is a forest with n vertices and k connected components, how many edges does G have? (A) floor(n/k) (B) ceil(n/k) (C) n-k (D)… Read More
There are two elements x, y in a group (G,∗) such that every element in the group can be written as a product of some… Read More
Let S be the sample space and two mutually exclusive events A and B be such that A U B = S. If P(.) denotes… Read More
The value of integral given below is: (A) (B) (C) (D) (A) A (B) B (C) C (D) D Answer: (A) Explanation: Using Integration By-parts-… Read More
(A) I Only (B) II Only (C) Both I and II (D) Neither I or II Answer: (C) Explanation: Quiz of this Question My Personal… Read More
The above sequential circuit is built using JK flip-flops is initialized with Q2Q1Q0 = 000. The state sequence for this circuit for the next 3… Read More
The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss… Read More
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback… Read More
Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order. int ProcessArray(int *listA, int x,… Read More
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation.… Read More
Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots… Read More
Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up… Read More
Consider the decision problem 2CNFSAT defined as follows: (A) NP-Complete. (B) solvable in polynomial time by reduction to directed graph reachability. (C) solvable in constant… Read More
Suppose you want to move from 0 to 100 on the number line. In each step, you either move right by a unit distance or… Read More
Here, wr is the reverse of the string w. Which of these languages are deterministic Context-free languages? (A) None of the languages (B) Only L1… Read More

Start Your Coding Journey Now!