All Expert Articles
Adobe Interview | Set 14 (On Campus for Full Time)
Round 1(aptitude and coding) Two tests: Test 1 (50 mins) 45 questions on analytical reasoning, quantitative and geometry. Analytical Reasoning Questions were tough, with lengthy… Read More
Adobe
Experiences
Interview Experiences
GATE | GATE-CS-2006 | Question 49
An implementation of a queue Q, using two stacks S1 and S2, is given below: void insert(Q, x) {    push (S1, x); }     void… Read More
GATE-CS-2006
GATE-GATE-CS-2006
GATE
GATE | GATE-CS-2014-(Set-2) | Question 65
Let k = 2n. A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2n bit decoder. This… Read More
GATE-CS-2014-(Set-2)
GATE-GATE-CS-2014-(Set-2)
GATE
GATE | GATE-CS-2014-(Set-1) | Question 65
An access sequence of cache block address is of length N and contains n unique block addresses. The number of unique block addresses between two… Read More
GATE-CS-2014-(Set-1)
GATE-GATE-CS-2014-(Set-1)
GATE
GATE | GATE-CS-2014-(Set-1) | Question 65
Consider a hash table with 9 slots. The hash function is ℎ(k) = k mod 9. The collisions are resolved by chaining. The following 9… Read More
GATE-CS-2014-(Set-1)
GATE-GATE-CS-2014-(Set-1)
GATE
GATE | GATE-CS-2014-(Set-1) | Question 65
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is ________… Read More
GATE-CS-2014-(Set-1)
GATE-GATE-CS-2014-(Set-1)
GATE
GATE | GATE-CS-2006 | Question 18
We are given a set X = {x1, …. xn} where xi = 2i. A sample S ⊆ X is drawn by selecting each xi… Read More
GATE-CS-2006
GATE-GATE-CS-2006
GATE
GATE | GATE-CS-2007 | Question 29
A minimum state deterministic finite automaton accepting the language L={w | w ε {0,1} *, number of 0s and 1s in w are divisible by… Read More
GATE-CS-2007
GATE-GATE-CS-2007
GATE
GATE | GATE-CS-2007 | Question 25
Let A be a 4 x 4 matrix with eigenvalues -5, -2, 1, 4. Which of the following is an eigenvalue of [A I] [I… Read More
GATE-CS-2007
GATE-GATE-CS-2007
GATE
GATE | GATE CS 2008 | Question 80
The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and positive integer W, is… Read More
GATE-CS-2008
GATE-GATE CS 2008
GATE
GATE | GATE CS 2008 | Question 71
Consider a machine with a 2-way set associative data cache of size 64 Kbytes and block size 16 bytes. The cache is managed using 32… Read More
GATE-CS-2008
GATE-GATE CS 2008
GATE
GATE | GATE CS 2008 | Question 63
The P and V operations on counting semaphores, where s is a counting semaphore, are defined as follows: P(s) : s = s - 1;… Read More
GATE-CS-2008
GATE-GATE CS 2008
GATE
GATE | GATE CS 2008 | Question 41
A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take… Read More
GATE-CS-2008
GATE-GATE CS 2008
GATE
GATE | GATE-CS-2009 | Question 48
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of… Read More
GATE-CS-2009
GATE-GATE-CS-2009
GATE
GATE | GATE-CS-2009 | Question 60
Let R and S be relational schemes such that R={a,b,c} and S={c}. Now consider the following queries on the database: IV) SELECT R.a, R.b FROM R,S… Read More
GATE-CS-2009
GATE-GATE-CS-2009
GATE
Java | Functions | Question 4
class intWrap {    int x; }  public class Main {      public static void main(String[] args) {        intWrap i = new intWrap();        i.x = 10;        intWrap… Read More
Functions
Java-Functions
Java Quiz
GATE | GATE CS 2010 | Question 65
If 137 + 276 = 435 how much is 731 + 672? (A) 534 (B) 1403 (C) 1623 (D) 1513 Answer: (C)Explanation: If we try… Read More
GATE-CS-2010
GATE-GATE CS 2010
GATE
Amazon Interview | Set 55 (On-Campus)
Online Test on InterviewStreet: 18 MCQs (Normal C loop questions, networking, dbms, os, analytical) 2 Coding questions 1. Check if an undirected graph is a tree or not. 2.… Read More
Amazon
DSA
Experiences
Interview Experiences
Mathematical
GATE | GATE CS 2010 | Question 1
Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in… Read More
GATE-CS-2010
GATE-GATE CS 2010
GATE
GATE | GATE CS 2011 | Question 6
The time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2.… Read More
GATE-CS-2011
GATE-GATE CS 2011
GATE
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox