All Medium Articles

Microsoft IDC Interview | Set 35 (On-Campus for Internship) 3

Online test: This test was organized by cocubes.com, and had to be completed within an hour. There were two coding questions: 1. There is a… Read More »

GATE | GATE-CS-2005 | Question 90 3

Consider the following floating point format Mantissa is a pure fraction in sign-magnitude form. The decimal number 0.239 × 213 has the following hexadecimal representation… Read More »

So recently Amadeus Labs visited my college for Campus Placements and finally picked 10 students. It also offered us 6 month training before the job.… Read More »

GATE | GATE-CS-2005 | Question 90 3.5

Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2,… Read More »

GATE | GATE-CS-2005 | Question 72 3

Consider the following code fragment: if (fork() == 0) { a = a + 5; printf(“%d,%d\n”, a, &a); } else { a = a –5;… Read More »

GATE | GATE-CS-2005 | Question 55 3

Consider the languages: L1 = {anbncm | n, m > 0} L2 = {anbmcm | n, m > 0} Which one of the following statements… Read More »

GATE | GATE-CS-2005 | Question 49 3

What are the eigenvalues of the following 2 × 2 matrix? (A) -1 and 1 (B) 1 and 6 (C) 2 and 5 (D) 4… Read More »

GATE | GATE-CS-2005 | Question 37 3

Suppose T(n) = 2T (n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE? (A) T(n) = O(n2) (B) T(n)… Read More »

GATE | GATE-CS-2005 | Question 29 3

Which one of the following statements about normal forms is FALSE? (A) BCNF is stricter than 3NF (B) Lossless, dependency-preserving decomposi­tion into 3NF is always… Read More »

GATE | GATE-CS-2005 | Question 27 3

An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be (A) 255.255.0.0 (B) 255.255.64.0 (C)… Read More »

GATE | GATE-CS-2005 | Question 10 3

Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the… Read More »

Find the smallest positive integer value that cannot be represented as sum of any subset of a given array 3.8

Given a sorted array (sorted in non-decreasing order) of positive numbers, find the smallest positive integer value that cannot be represented as sum of elements… Read More »

Oracle Interview | Set 8 3

Company Name : Oracle (Server Technology) Oracle procedure consists of 1) Written Round 2) Coding Round 3) 2-3 Technical Rounds and 1 HR Round 1)… Read More »

GATE | GATE-CS-2006 | Question 79 3.5

Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arrives at the barrier and waits for… Read More »

MAQ Software Interview Experience | Set 2 3

1) Written Test: 30 ques in 30 mins consisting of simple quantitative aptitude, 2-3 puzzles. 2) Algorithm Round: 2 question, either write the code or… Read More »

Microsoft Interview | Set 33 (On-Campus for Internship) 3.6

Recently Microsoft IDC had visited our Campus for Internship. There were 6 rounds in total for me. Objective Round :- The objective round was taken… Read More »

Facebook Interview | Set 2 (On Campus for Internship) 3.3

Recently facebook visited our campus. There was an online round first. 7 people were shortlisted for the telephonic interviews. And then there were 2 telephonic… Read More »

Adobe Interview | Set 13 (On Campus for Internship) 3.6

We had Adobe visit our campus recently. First they shortlisted students for an online test on the basis of CGPA. A few students even got… Read More »

Pattern Searching using a Trie of all Suffixes 3.8

Problem Statement: Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[].… Read More »

GATE | GATE-CS-2006 | Question 85 3

Consider the following snapshot of a system running n processes. Process i is holding Xi instances of a resource R, 1 <= i <= n.… Read More »