Skip to content
Gblog Crack the Coding Interview With GeeksforGeeks Weekly Contest Series
“The difference between ordinary and extraordinary is practice”, quoted by Vladamir Horowitz. What he said was nothing sort of unique as achieving perfection and success… Read More
Which of the following is true? (A) The complement of a recursive language is recursive. (B) The complement of a recursively enumerable language is recursively… Read More
The smallest finite automation which accepts the language {x | length of x is divisible by 3} has : (A) 2 states (B) 3 states… Read More
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left subtree is at least half and… Read More
The running time of the following algorithm Procedure A(n) If n < = 2 return (1) else return (A(Image not present√nImage not present)); is best… Read More
Consider the following algorithm for searching for a given number x in an unsorted array A[1…..n] having n distinct values: 1. Choose an i uniformaly… Read More
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is: (A) n/2 (B) (n… Read More
Consider the following declaration of a two dimensional array in C: char a[100][100]; Assuming that the main memory is byte-addressable and that the array is… Read More
Horizontal microprogramming : (A) does not require use of signal decoders (B) results in larger sized microinstructions than vertical microprogramming (C) uses one bit for… Read More
The performance of a pipelined processor suffers if : (A) the pipeline stages have different delays (B) consecutive instructions are dependent on each other (C)… Read More
The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x… Read More
What are the states of the Auxiliary Carry (AC) and Carry Flag (dCY) after executing the following 8085 program? MVI L, 5DH MVI L, 6BH… Read More
Let f(A, B) = A’ + B. Simplified expression for function f(f(x + y, y)z) is : (A) x’ + z (B) xyz (C) xy’… Read More
Consider the following multiplexor where 10, 11, 12, 13 are four data input lines selected by two address line combinations A1A0 = 00, 01, 10,… Read More
Consider the following logic circuit whose inputs and function and output is f. Given that f1(dx, y, z) = ∑(0, 1, 3, 5), f2(dx, y,… Read More
Maximum number of edges in a n – node undirected graph without self loops is (A) n2 (B) n(n – 1)/2 (C) n – 1… Read More

Start Your Coding Journey Now!