The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by krishn.jh
User krishn.jh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User krishn.jh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
GATE19987b
In a computer system where the bestfit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{ll} \hline \textbf{Partitions size in $KB$} & \textbf{$4K \ 8K \ 20K \ 2K$} \\\hline \textbf{Job sizes in $ ... $} \\\hline \end{array}$When will the $20K$ job complete?
answered
Jan 22, 2019
in
Operating System

3.4k
views
gate1998
operatingsystem
processschedule
normal
+2
votes
2
TIFR2019B2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
answered
Dec 24, 2018
in
Algorithms

408
views
tifr2019
algorithms
minimumspanningtrees
+3
votes
3
ISI 2017
For each positive integer $n$ consider the set $S_n$ defined as follows: $S_1 = \{1\},\:S_2 = \{2, 3\},\:S_3 = \{4,5,6\}, \: \dots $ and in general, $S_{n+1}$ consists of $n+1$ consecutive integers the smallest of which is one more than the largest integer in $S_n$. Then the sum of all the integers in $S_{21}$ equals to $1113$ $53361$ $5082$ $4641$
answered
Jul 27, 2018
in
Combinatory

474
views
isi
permutationandcombination
discretemathematics
normal
+4
votes
4
GATE2008IT25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b1)!\,(n+r1)!}{(n1)!\,b!\,(n1)!\,r!}$ $\frac{(n+(b+r)1)!}{(n1)!\,(n1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r)  1)!} {n!\,(b + r  1)}$
answered
Jul 27, 2018
in
Combinatory

2.5k
views
gate2008it
permutationandcombination
normal
0
votes
5
Combinatorics
A company hires 11 new employees, each of whom is to be assigned to one of 4 subdivisions. Each subdivision will get at least one new employee. In how many ways can these assignments be made?
answered
Jul 23, 2018
in
Combinatory

216
views
permutationandcombination
0
votes
6
GATE19962.18
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyte}$ respectively. The smallest allocation request in $\text{Kbyte}$ that could be denied is for $151$ $181$ $231$ $541$
answered
Jun 20, 2018
in
Operating System

5.8k
views
gate1996
operatingsystem
memorymanagement
normal
+2
votes
7
GATE2005IT43
Which of the following input sequences will always generate a $1$ at the output $z$ ...
answered
Jun 14, 2018
in
Digital Logic

6.2k
views
gate2005it
digitallogic
circuitoutput
normal
0
votes
8
ISI2013PCBCS5a
Suppose that an operating system provides two functions, $block()$ which puts the calling process on the blocked queue, and $wakeup(P)$ which moves process $P$ to the runnable queue if it is currently on the blocked queue (otherwise, its behaviour is unpredictable). Consider ... the initialisation of the semaphore(s), and the calls to $wait()$ and $signal()$ made by $A$ and $B$.
answered
Jun 11, 2018
in
Operating System

389
views
descriptive
isi2013pcbcs
operatingsystem
processsynchronization
+2
votes
9
GATE201023
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables $S1$ and $S2$ ... achieved? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress
answered
Jun 11, 2018
in
Operating System

5k
views
gate2010
operatingsystem
processsynchronization
normal
+10
votes
10
GATE20009
Design a logic circuit to convert a single digit BCD number to the number modulo six as follows (Do not detect illegal input): Write the truth table for all bits. Label the input bits $I_1, I_2, \ldots$ with $I_1$ as the least significant bit. Label the ... truth. Draw one circuit for each output bit using, altogether, two twoinput AND gates, one twoinput OR gate and two NOT gates.
answered
May 28, 2018
in
Digital Logic

862
views
gate2000
digitallogic
minnogates
descriptive
+4
votes
11
GATE20012.10
The $2's$ complement representation of (539)10 in hexadecimal is $ABE$ $DBC$ $DE5$ $9E7$
answered
May 22, 2018
in
Digital Logic

3.9k
views
gate2001
digitallogic
numberrepresentation
easy
+2
votes
12
GATE199518
The following is an incomplete Pascal function to convert a given decimal integer (in the range $8$ to $+7$) into a binary integer in $2's$ complement representation. Determine the expressions $A, B, C$ that complete program. function TWOSCOMP (N:integer):integer; var ... ;0 do begin REM:=N mod 2; BIANRY:=BINARY + B*EXPONENT; EXPONENT:=EXPONENT*10; N:=C end TWOSCOMP:=BINARY end end;
answered
May 21, 2018
in
Digital Logic

734
views
gate1995
digitallogic
numberrepresentation
normal
+3
votes
13
GATE19951.3
In a vectored interrupt: The branch address is assigned to a fixed location in memory The interrupting source supplies the branch information to the processor through an interrupt vector The branch address is obtained from a register in the processor None of the above
answered
May 7, 2018
in
CO and Architecture

2.1k
views
gate1995
coandarchitecture
interrupts
normal
+4
votes
14
GATE2008IT38
Assume that EA = (X)+ is the effective address equal to the contents of location X, with X incremented by one word length after the effective address is calculated; EA = −(X) is the effective address equal to the contents of location X, with X decremented by one word length before the effective address ... back to the stack. ADD (X)−, (X) ADD (X), (X)− ADD −(X), (X)+ ADD −(X), (X)
answered
May 7, 2018
in
CO and Architecture

3.3k
views
gate2008it
coandarchitecture
machineinstructions
normal
+1
vote
15
GATE200639
We consider the addition of two $2's$ complement numbers $ b_{n1}b_{n2}\dots b_{0}$ and $a_{n1}a_{n2}\dots a_{0}$. A binary adder for adding unsigned binary numbers is used to add the two numbers. The sum is denoted by $ c_{n1}c_{n2}\dots c_{0}$ ... $ c_{out}\oplus c_{n1}$ $ a_{n1}\oplus b_{n1}\oplus c_{n1}$
answered
Mar 29, 2018
in
Digital Logic

6.9k
views
gate2006
digitallogic
numberrepresentation
normal
50,741
questions
57,244
answers
198,018
comments
104,610
users