Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by krishn.jh
21
votes
1
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered:$$\begin{arr...
12.9k
views
answered
Jan 22, 2019
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
3
votes
2
TIFR CSE 2019 | Part B | Question: 2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
4.6k
views
answered
Dec 24, 2018
Algorithms
tifr2019
algorithms
minimum-spanning-tree
+
–
4
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$
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...
1.8k
views
answered
Jul 27, 2018
Combinatory
isi
combinatory
discrete-mathematics
normal
+
–
6
votes
4
GATE IT 2008 | Question: 25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$ $\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)}$
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes?$\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$$\frac{(n+(b+r)-1)!}{(n-1)!\...
8.5k
views
answered
Jul 27, 2018
Combinatory
gateit-2008
combinatory
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?
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 ...
2.3k
views
answered
Jul 23, 2018
Combinatory
combinatory
+
–
2
votes
6
GATE CSE 1996 | Question: 2.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$
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{Kbyt...
21.2k
views
answered
Jun 20, 2018
Operating System
gate1996
operating-system
memory-management
normal
+
–
4
votes
7
GATE IT 2005 | Question: 43
Which of the following input sequences will always generate a $1$ at the output $z$ ...
Which of the following input sequences will always generate a $1$ at the output $z$ at the end of the third cycle?$\begin{array}{|l|l|}\hline \textbf{A} & \textbf{B} & \t...
15.3k
views
answered
Jun 14, 2018
Digital Logic
gateit-2005
digital-logic
circuit-output
normal
+
–
0
votes
8
ISI2013-PCB-CS-5a
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$.
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 run...
1.2k
views
answered
Jun 11, 2018
Operating System
descriptive
isi2013-pcb-cs
operating-system
process-synchronization
+
–
3
votes
9
GATE CSE 2010 | Question: 23
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$ ... ? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress
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...
17.9k
views
answered
Jun 11, 2018
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
12
votes
10
GATE CSE 2000 | Question: 9
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. ... Draw one circuit for each output bit using, altogether, two two-input AND gates, one two-input OR gate and two NOT gates.
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 th...
2.9k
views
answered
May 28, 2018
Digital Logic
gatecse-2000
digital-logic
min-no-gates
descriptive
+
–
5
votes
11
GATE CSE 2001 | Question: 2.10
The $2's$ complement representation of (-539)10 in hexadecimal is $ABE$ $DBC$ $DE5$ $9E7$
The $2's$ complement representation of (-539)10 in hexadecimal is$ABE$$DBC$$DE5$$9E7$
12.1k
views
answered
May 22, 2018
Digital Logic
gatecse-2001
digital-logic
number-representation
easy
+
–
3
votes
12
GATE CSE 1995 | Question: 18
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): ... do begin REM:=N mod 2; BINARY:=BINARY + B*EXPONENT; EXPONENT:=EXPONENT*10; N:=C end TWOSCOMP:=BINARY end end;
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. ...
2.6k
views
answered
May 21, 2018
Digital Logic
gate1995
digital-logic
number-representation
normal
descriptive
+
–
4
votes
13
GATE CSE 1995 | Question: 1.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
In a vectored interrupt:The branch address is assigned to a fixed location in memoryThe interrupting source supplies the branch information to the processor through an in...
14.7k
views
answered
May 7, 2018
CO and Architecture
gate1995
co-and-architecture
interrupts
normal
+
–
9
votes
14
GATE IT 2008 | Question: 38
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 ... back to the stack. ADD (X)−, (X) ADD (X), (X)− ADD −(X), (X)+ ADD −(X), (X)
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 = ...
9.0k
views
answered
May 7, 2018
CO and Architecture
gateit-2008
co-and-architecture
machine-instruction
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register