GATE 1996 Four jobs to be executed on a single processor system arrive at time 0+ in the order A, B, C, D. Their burst CPU time requirements are 4,1, 8, 1 time units respectively. The completion time of A under round robin scheduling with time slice of one time unit is (a) 10 (b) […]

### Category: GATE

## GATE | Find Matrix F | ME GATE 2006 | Prof. Jayesh Umre

## GATE | Singular Matrix | ME GATE 2004 | Prof. Jayesh Umre

Click here to view on YouTube

## GATE | Find a+b Matrix? | EC GATE 2005 | Prof. Jayesh Umre

## GATE | Inverse of 3X3 Matrix | Prof. Jayesh Umre

## GATE | Inverse of 2X2 Matrix | Prof. Jayesh Umre

## GATE | Top row of Matrix inverse ? | CE GATE 2005 | Prof. Jayesh Umre

## GATE | The product of Matrix | CE 2008 | Prof. Jayesh Umre

## GATE CS | Binary tree questions | Prof. Jayesh Umre

## GATE | Binary Search Tree | Related Questions | Prof. Jayesh Umre

## GATE | Adjoint of a Matrix | Prof. Jayesh Umre

## C SwitchCase numerical GATE CS2012 | Prof. Jayesh Umre

## GATE SRTF | What is the total waiting time for process P2?

## C SwitchCase numerical GATE CS2012 | Prof. Jayesh Umre

## c program numerical GATE CS2012 | Prof. Jayesh Umre

## GATE 2014 DBMS FIND Maximum number of Super keys | Prof. Jayesh Umre

## GATE 2017 DBMS Query | Prof. Jayesh Umre

## GATE 2004, Calculate height of Binary Tree | Prof. Jayesh Umre

## GATE, Context switch calculation in SRTF algorithm | Prof. Jayesh Umre

## GATE Calculate Total Waiting Time SRTF algorithm | Prof. Jayesh Umre

## GATE 2010 Binary tree descendent | Prof. Jayesh Umre

## GATE, Longest Remaining Time First Algorithm | Prof. Jayesh Umre

## GATE, AVG function and join DBMS | Prof. Jayesh Umre

## GATE 02

GATE 2016, SET I, 1 Mark A processor can support a maximum of 4GB, where the memory is word-addressable (a word consists of two bytes). The size of address bus of the processor is at least _________bits. Sol. First we will convert 4GB in to Bytes 4GB = 230 X 4 = 230 X 22 […]

## GATE 01

GATE 2013 R (ABCDEFGH) CH → G A → BC B → CFH E → A F → EG Find the number of candidate keys? Sol. Which one is not at right side.That is D.so,[D]+ → DIts not candidate key., because not all keys determined in it.[DA]+ → DABCFHEGIts candidate key because all keys are […]