Skip to content
Gblog Write It Up: Share Your Interview Experiences
Since we are receiving so many interview experiences, we have great news to share with you. Therefore, we are moving this event’s date up to… Read More
In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time (A) Θ(n log… Read More
The usual Θ(n2) implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted… Read More
Consider the following graph, Among the following sequences: (I) a b e g h f (II) a b f e h g (III) a b… Read More
Consider the following three claims 1. (n + k)m = Θ(nm), where k and m are constants 2. 2n + 1 = O(2n) 3. 22n… Read More
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree.… Read More
In a bottom-up evaluation of a syntax directed definition, inherited attributes can (A) always be evaluated (B) be evaluated only if the definition is L-­attributed… Read More
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1… Read More
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? (A) Removing left recursion alone (B) Factoring the grammar alone (C)… Read More
If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ? (A)… Read More
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D)… Read More
Nobody knows yet if P = NP. Consider the language L defined as follows : Which of the following statements is true ? (A) L… Read More
Ram and Shyam have been asked to show that a certain problem Π is NP-complete. Ram shows a polynomial time reduction from the 3-SAT problem… Read More
Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the… Read More
For a pipelined CPU with a single ALU, consider the following situations 1. The j + 1-st instruction uses the result of the j-th instruction… Read More
I recently cleared Intuit Interview. It was a life changing experience and I am very happy to crack the interview for SSE. Below are the… Read More

Start Your Coding Journey Now!