Skip to content
All Medium Articles
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf(“%d,%d\n”, a, &a); } else { a = a –5;… Read More
Consider the languages: L1 = {anbncm | n, m > 0} L2 = {anbmcm | n, m > 0} Which one of the following statements… Read More
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
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
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
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
Consider the following circuit. Which one of the following is TRUE? (A) f is independent of X (B) f is independent of Y (C) f… Read More
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
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
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
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
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
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
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
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
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
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
Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20%… Read More
Given two arrays of numbers a1, a2, a3,…an and b1, b2, .. bn where each number is 0 or 1, the fastest algorithm to find… Read More
On line test consist of 4 sections analytical, quant, computer science and English. Coding on paper(45 min): Based on scores they shortlisted for ST, APPS… Read More