Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least (A) N2… Read More

Which of the following statements is true? (A) If a language is context free it can always be accepted by a deterministic push-down automaton (B)… Read More

Consider the following two statements: (A) Only S1 is correct (B) Only S2 is correct (C) Both S1 and S2 are correct (D) None of… Read More

1st round ( machine coding round) Write down code in any language for a simple employee hierarchy which has 3 types of employees. CEO Manager… Read More

Consider two well-formed formulas in prepositional logic. Which of the following statements is correct? (A) F1 is satisfiable, F2 is valid (B) F1… Read More

Consider the following relations: R1(a,b) iff (a+b) is even over the set of integers R2(a,b) iff (a+b) is odd over the set of integers R3(a,b)… Read More

Consider the following statements: S1: The sum of two singular n × n matrices may be non-singular S2: The sum of two n × n… Read More

Recently I have participated in Amazon SDE interview for Chennai location Kindle team. Kindle team has arrived Bangalore location to take drive. I have given… Read More

1.Round Quant(30), Tech(30), vrbl(15), logical(15).2 hours Tech. Tell Me about yourself. Explain your internship Project.(Related Question) 1.write a function to find nth Fibonacci number.(I used recursion) -Its… Read More

After 2 hours of gruelling Technical Interview and getting to know that he cleared all the interview rounds, It was a dream come true for… Read More

We recommend reading following posts as a prerequisite of this post.K’th Smallest/Largest Element in Unsorted Array | Set 1 K’th Smallest/Largest Element in Unsorted Array |… Read More

A simple sentence if syntactically correct if it fulfills given rules. The following are given rules.1. Sentence must start with a Uppercase character (e.g. Noun/… Read More

From the following instance of a relation scheme R (A, B, C), we can conclude that : A B C 1 1 1 1 1… Read More

Relation R is decomposed using a set of functional dependencies, F and relation S is decomposed using another set of functional dependencies G. One decomposition… Read More

A B+ -tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8… Read More