All Medium Articles

## Print all possible paths from top left to bottom right of a mXn matrix 3.4

The problem is to print all the possible paths from top left to bottom right of a mXn matrix with the constraints that from each… Read More »

## GATE | GATE CS 2010 | Question 49 3

Consider the data from above question. When there is a miss in both L1 cache and L2 cache, first a block is transferred from main… Read More »

## Generate all unique partitions of an integer 3.8

Given a positive integer n, generate all possible unique ways to represent n as sum of positive integers. Examples: Input: n = 2 Output: 2… Read More »

## Some interesting shortest path questions | Set 1 3

Question 1: Given a directed weighted graph. You are also given the shortest path from a source vertex ‘s’ to a destination vertex ‘t’.  If… Read More »

## GATE | GATE CS 2010 | Question 65 3

The weight of a sequence a0, a1, …, an-1 of real numbers is defined as a0+a1/2+…+ aa-1/2n-1. A subsequence of a sequence is obtained by deleting… Read More »

## GATE | GATE CS 2010 | Question 65 3

In the sequential circuit shown below,if the initial value of the output Q1Q0 is 00,what are the next four values of Q1Q0? (A) 11, 10,… Read More »

## GATE | GATE CS 2010 | Question 30 3

Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. which one of… Read More »

## GATE | GATE CS 2010 | Question 26 3

Consider a company that assembles computers. The probability of a faulty assembly of any computer is p. The company therefore subjects each computer to a… Read More »

## Microsoft Interview | Set 23 3

Written Test: First round was an online test on cocubes platform (not good for coding). This test is based on C, C++ and DS. The… Read More »

## GATE | GATE CS 2010 | Question 65 3

A main memory unit with a capacity of 4 megabytes is built using 1M × 1-bit DRAM chips. Each DRAM chip has 1K rows of… Read More »

## GATE | GATE CS 2010 | Question 3 3

What is the possible number of reflexive relations on a set of 5 elements? (A) 210 (B) 215 (C) 220 (D) 225 Answer: (C) Explanation:… Read More »

## GATE | GATE CS 2011 | Question 64 3

A transporter receives the same number of orders each day. Currently, he has some pending orders (backlog) to be shipped. If he uses 7 trucks,… Read More »

## GATE | GATE CS 2011 | Question 37 3

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? f1(n) = 2^n f2(n) = n^(3/2)… Read More »

## GATE | GATE CS 2011 | Question 30 3

Which one of the following options is CORRECT given three positive integers x, y and z, and a predicate? P(x) = ¬(x=1)∧∀y(∃z(x=y*z)⇒(y=x)∨(y=1)) (A) P(x) being… Read More »

## Microsoft Interview | Set 21 3

Hi, a brief documentation of my Microsoft experience is as follows: Group Activity: On the evening before the interview we had a group activity round.… Read More »

## Java | Abstract Class and Interface | Question 2 3

Which of the following is true about interfaces in java. 1) An interface can contain following type of members. ….public, static, final fields (i.e., constants)… Read More »

## GATE | GATE CS 2012 | Question 55 3

Consider the data given in previous question. The size of the cache tag directory is (A) 160 Kbits (B) 136 bits (C) 40 Kbits (D)… Read More »

## GATE | GATE CS 2012 | Question 39 3

A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block… Read More »

## GATE | GATE CS 2012 | Question 38 3.7

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by… Read More »

## GATE | GATE CS 2012 | Question 37 3

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this… Read More »