## Android Developer Interview at Headstrong and SnapDeal

Headstrong: 1st Round: 1) What is Heap Memory and Difference between stack and heap memory. 2) Why would you do the setContentView() in onCreate() of… Read More »

## Printing Longest Common Subsequence

Given two sequences, print the longest subsequence present in both of them. Examples: LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.… Read More »

## Amazon Interview | Set 79 (For SDE-1)

I have 8 months of experience and I recently appeared for interview of Amazon for role of SDE-I. Written Round: Q1: Convert a binary tree… Read More »

## Data Structures and Algorithms | Set 33

Following questions have been asked in GATE CS 2014 exam. 1) Consider the tree arcs of a BFS traversal from a source node W in… Read More »

## C Language | Set 10

Following questions have been asked in GATE CS 2014 exam. 1) Consider the following program in C language: filter_none edit close play_arrow link brightness_4 code… Read More »

## Data Structures and Algorithms | Set 32

Following questions have been asked in GATE CS 2014 exam. 1) Let G be a graph with n vertices and m edges. What is the… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 65

Let X denote the Exclusive OR (XOR) operation. Let ‘1’ and ‘0’ denote the binary constants. Consider the following Boolean expression for F over two… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 65

Consider the following relational schema: employee(empId, empName, empDept) customer(custId, custName, salesRepId, rating) salesRepId is a foreign key referring to empId of the employee relation. Assume… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 63

The CORRECT formula for the sentence, “not all rainy days are cold” is (A) A (B) B (C) C (D) D Answer: (D) Explanation: (A)… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 62

Consider the set of all functions f: {0,1, … ,2014} → {0,1, … ,2014} such that f(f(i)) = i, for all 0 ≤ i ≤… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 65

Let d denote the minimum degree of a vertex in a graph. For all planar graphs on n vertices with d ≥ 3, which one… Read More »

## GATE | GATE-CS-2014-(Set-3) | Question 60

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 »

## GATE | GATE-CS-2014-(Set-3) | Question 59

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 »

## GATE | GATE-CS-2014-(Set-3) | Question 58

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 »

## GATE | GATE-CS-2014-(Set-3) | Question 57

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 »