All Easy Articles

## Puzzle 1 | (How to Measure 45 minutes using two identical wires?) 2.4

How do we measure forty-five minutes using two identical wires, each of which takes an hour to burn? We have matchsticks with us. The wires… Read More »

## Find maximum depth of nested parenthesis in a string 2.6

We are given a string having parenthesis like below      “( ((X)) (((Y))) )” We need to find the maximum depth of balanced parenthesis, like… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65 2

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Processing… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 40 2

Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65 2.6

Consider the following C program. filter_none edit close play_arrow link brightness_4 code # include  int main( ) {   static int a[] = {10, 20, 30,… Read More »

## Find position of an element in a sorted array of infinite numbers 2.7

Suppose you have a sorted array of infinite numbers, how would you search an element in the array? Source: Amazon Interview Experience. Since array is… Read More »

## GATE | GATE-CS-2015 (Set 2) | Question 65 2

A Computer system implements 8 kilobyte pages and a 32-bit physical address space. Each page table entry contains a valid bit, a dirty bit three… Read More »

## GATE | GATE-CS-2015 (Set 2) | Question 11 2

Consider the following transaction involving two bank accounts x and y. read(x); x := x – 50; write(x); read(y); y := y + 50; write(y)… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 65 2

Consider the following C program segment. filter_none edit close play_arrow link brightness_4 code while (first <= last) {    if (array [middle] < search)       first =… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 65 2.5

Consider the operations f(X, Y, Z) = X’YZ + XY’ + Y’Z’  and  g(X′, Y, Z) = X′YZ + X′YZ′ + XY Which one of… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 65 2

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 65 2.6

For a set A, the power set of A is denoted by 2A. If A = {5, {6}, {7}}, which of the following options are… Read More »

## GATE | GATE-CS-2015 (Set 1) | Question 65 2

Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of… Read More »

## Count number of ways to reach a given score in a game 2.5

Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of… Read More »

## Greedy Algorithm for Egyptian Fraction 2.8

Every positive fraction can be represented as sum of unique unit fractions. A fraction is unit fraction if numerator is 1 and denominator is a… Read More »

## Find sum of all left leaves in a given Binary Tree 2.2

Given a Binary Tree, find sum of all left leaves in it. For example, sum of all left leaves in below Binary Tree is 5+1=6.… Read More »

## Difference between getc(), getchar(), getch() and getche() 2

All of these functions read a character from input and return an integer value. The integer is returned to accommodate a special value used to… Read More »

## What is the difference between printf, sprintf and fprintf? 2.2

printf: printf function is used to print character stream of data on stdout console. Syntax : int printf(const char* str, …); Example : filter_none edit… Read More »

## Goldman Sachs Interview Experience | Set 7 2

Telephonic Round(1st Round) (Manager): Swap two variables without using third variable. There ‘s an array with every element repeated twice except one. Find that element.… Read More »

## Persistent Systems interview experience (on campus) 2

Persistent system came to our campus for recruitment. I faced so many problems before the interview because i searched a lot about the interview process… Read More »