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
Recent activity 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
4
answers
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?
commented
Feb 3, 2019
in
Operating System

3.5k
views
gate1998
operatingsystem
processschedule
normal
4
answers
2
GATE200675
Consider two cache organizations. First one is $32$ $kB$ $2$way set associative with $32$ $byte$ block size, the second is of same size but direct mapped. The size of an address is $32$ $bits$ in both cases . A $2$to$1$ multiplexer has latency of $0.6 ns$ while a $k$bit comparator ... that of direct mapped is $h_2$. The value of $h_2$ is: $2.4$ $ns$ $2.3$ $ns$ $1.8$ $ns$ $1.7$ $ns$
comment edited
Dec 31, 2018
in
CO and Architecture

3.4k
views
gate2006
coandarchitecture
cachememory
normal
4
answers
3
GATE200674
Consider two cache organizations. First one is $32 \hspace{0.2cm} KB$ $2way$ set associative with $32 \hspace{0.2cm} byte$ block size, the second is of same size but direct mapped. The size of an address is $32 \hspace{0.2cm} bits$ in both cases . A $2to1$ ... . The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$
comment edited
Dec 31, 2018
in
CO and Architecture

9k
views
gate2006
coandarchitecture
cachememory
normal
2
answers
4
GATE2008IT69
The three way handshake for TCP connection establishment is shown below. Which of the following statements are TRUE? $S1:$ Loss of $SYN + ACK$ from the server will not establish a connection $S2:$ Loss of $ACK$ from the client cannot establish the connection $S3:$ ... on no packet loss $S2$ and $S3$ only $S1$ and $S4$ only $S1$ and $S3$ only $S2$ and $S4$ only
comment edited
Dec 31, 2018
in
Computer Networks

4.4k
views
gate2008it
computernetworks
tcp
normal
3
answers
5
GATE2008IT53
The following is a code with two threads, producer and consumer, that can run in parallel. Further, $S$ and $Q$ are binary semaphores quipped with the standard $P$ and $V$ operations. semaphore S = 1, Q = 0; integer x; producer: consumer: while ( ... may be lost Values generated and stored in '$x$' by the producer will always be consumed before the producer can generate a new value
comment edited
Dec 31, 2018
in
Operating System

3k
views
gate2008it
operatingsystem
processsynchronization
normal
2
answers
6
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;
answer edited
Dec 24, 2018
in
Digital Logic

740
views
gate1995
digitallogic
numberrepresentation
normal
3
answers
7
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

418
views
tifr2019
algorithms
minimumspanningtrees
2
answers
8
GATE200112
Consider a $5$stage pipeline  IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle and all ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.
commented
Dec 9, 2018
in
CO and Architecture

4.1k
views
gate2001
coandarchitecture
pipelining
normal
descriptive
4
answers
9
GATE2016237
Consider the following program: int f (int * p, int n) { if (n <= 1) return 0; else return max (f (p+1, n1), p[0]  p[1]); } int main () { int a[] = {3, 5, 2, 6, 4}; print f(" %d", f(a, 5)); } Note: $max (x, y)$ returns the maximum of $x$ and $y$. The value printed by this program is ________.
commented
Dec 3, 2018
in
Programming

4.3k
views
gate20162
programminginc
normal
numericalanswers
2
answers
10
GATE199626
A computer system has a threelevel memory hierarchy, with access time and hit ratios as shown below: $\overset{ \text {Level $1$ (Cache memory)} \\ \text{Access time = $ ... time of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
commented
Dec 2, 2018
in
CO and Architecture

3.7k
views
gate1996
coandarchitecture
cachememory
normal
2
answers
11
GATE2016243
Consider the following languages: $L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$ $L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$ Which one of the following is TRUE? Both $L_{1}$ and $L_{2}$ are contextfree. $L_{1}$ is contextfree while $L_{2}$ is not contextfree. $L_{2}$ is contextfree while $L_{1}$ is not contextfree. Neither $L_{1}$ nor $L_{2}$ is contextfree.
commented
Nov 28, 2018
in
Theory of Computation

3.7k
views
gate20162
theoryofcomputation
contextfreelanguages
normal
2
answers
12
GATE19938.1
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true? $G$ has no cycles The graph obtained by removing any edge from $G$ is not connected $G$ has at least one cycle The graph obtained by removing any two edges from $G$ is not connected None of the above
commented
Nov 25, 2018
in
Graph Theory

1.8k
views
gate1993
graphtheory
graphconnectivity
easy
3
answers
13
GATE199412
Assume that a CPU has only two registers $R_1$ and $R_2$ and that only the following instruction is available $XOR \: R_i, R_j;\{R_j \leftarrow R_i \oplus R_j, \text{ for } i, j =1, 2\}$ Using this XOR instruction, find an instruction sequence in order to ... $R_1$ and $R_2$ The line p of the circuit shown in figure has stuck at 1 fault. Determine an input test to detect the fault.
commented
Nov 20, 2018
in
CO and Architecture

1.1k
views
gate1994
coandarchitecture
machineinstructions
normal
2
answers
14
GATE2006IT80
Let $L$ be a regular language. Consider the constructions on $L$ below: repeat $(L) = \{ww \mid w \in L\}$ prefix $(L) = \{u \mid ∃v : uv \in L\}$ suffix $(L) = \{v \mid ∃u : uv \in L\}$ half $(L) = \{u \mid ∃v :  v  =  u  \text{ and } uv \in L\}$ Which of the constructions could lead to a nonregular language? Both I and IV Only I Only IV Both II and III
commented
Nov 19, 2018
in
Theory of Computation

2.8k
views
gate2006it
theoryofcomputation
normal
regularlanguages
1
answer
15
GATE199103,xiv
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma$ ? It could be undecidable It is Turingmachine recognizable It is a context sensitive language. It is a regular language. None of the above,
commented
Nov 18, 2018
in
Theory of Computation

1.5k
views
gate1991
theoryofcomputation
easy
regularlanguages
5
answers
16
GATE200852
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P2, Q1, R3, S4$ $P1, Q3, R2, S4$ $P1, Q2, R3, S4$ $P3, Q2, R1, S4$
commented
Nov 18, 2018
in
Theory of Computation

3.5k
views
gate2008
theoryofcomputation
finiteautomata
normal
5
answers
17
GATE200849
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ indicates a final state) $\overset{Y}{\begin{array}{lll}\hline \text{} & \textbf{a} & \textbf{b} \\\hline \text{$\rightarrow$ $ ...
commented
Nov 18, 2018
in
Theory of Computation

4.9k
views
gate2008
normal
theoryofcomputation
finiteautomata
2
answers
18
GATE19943.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
commented
Nov 17, 2018
in
Theory of Computation

3.4k
views
gate1994
theoryofcomputation
finiteautomata
normal
1
answer
19
CMI2012B02a
For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be $\Sigma_{0 \leq i < n} 2^{n1i}.a_i$ Let $\Sigma = \{(0, 0),(0, 1),(1, 0),(1, 1)\}$. Construct a finite automaton that accepts the set of all strings $(a_0, b_0)(a_1, b_1) \dots (a_{n−1}, b_{n−1}) \in \: \Sigma^*$ such that $val(b_0b_1 \dots b_{n−1}) = 2 · val(a_0a_1 \dots a_{n−1})$.
commented
Nov 16, 2018
in
Theory of Computation

705
views
cmi2012
descriptive
theoryofcomputation
finiteautomata
2
answers
20
CMI2010B04c
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers. If a language $L$ is accepted by an NFA with $n$ states then there is a DFA with no more than $2^n$ states accepting $L$.
commented
Nov 15, 2018
in
Theory of Computation

435
views
descriptive
cmi2010
finiteautomata
1
answer
21
GATE199201,v
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the transmitter _____.
commented
Sep 1, 2018
in
Computer Networks

916
views
gate1992
computernetworks
networkflow
easy
4
answers
22
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
commented
Aug 10, 2018
in
CO and Architecture

2.2k
views
gate1995
coandarchitecture
interrupts
normal
5
answers
23
GATE199204b
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a twobit output $(X_1, X_0 )$ corresponding to the highest priority active input signal. Assume $A$ has the highest priority followed by $B$ and $C$ has the lowest ... none of the inputs are active the output should be $00$, design the priority encoder using $4:1$ multiplexers as the main components.
commented
Aug 10, 2018
in
Digital Logic

1.3k
views
gate1994
digitallogic
multiplexer
descriptive
12
answers
24
TIFR2012A1
Amar and Akbar both tell the truth with probability $\dfrac{3 } {4}$ and lie with probability $\dfrac{1}{4}$. Amar watches a test match and talks to Akbar about the outcome. Akbar, in turn, tells Anthony, "Amar told me that India won". What probability should Anthony ... $\left(\dfrac{7}{16}\right)$ $\left(\dfrac{10}{16}\right)$ None of the above
commented
Aug 6, 2018
in
Probability

1.8k
views
tifr2012
probability
conditionalprobability
3
answers
25
TIFR2010A13
A cube whose faces are colored is split into $1000$ small cubes of equal size. The cubes thus obtained are mixed thoroughly. The probability that a cube drawn at random will have exactly two colored faces is: $0.096$ $0.12$ $0.104$ $0.24$ None of the above
commented
Aug 4, 2018
in
Probability

642
views
tifr2010
probability
2
answers
26
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.
comment edited
Jul 29, 2018
in
Digital Logic

872
views
gate2000
digitallogic
minnogates
descriptive
4
answers
27
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

482
views
isi
permutationandcombination
discretemathematics
normal
2
answers
28
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.6k
views
gate2008it
permutationandcombination
normal
4
answers
29
GATE200785
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the line segment from ... $^{20}\mathrm{C}_{10}  ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$
commented
Jul 27, 2018
in
Combinatory

2.3k
views
gate2007
permutationandcombination
normal
discretemathematics
3
answers
30
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?
commented
Jul 24, 2018
in
Combinatory

217
views
permutationandcombination
5
answers
31
GATE20058
Let $A, B$ and $C$ be nonempty sets and let $X = ( A  B )  C$ and $Y = ( A  C )  ( B  C ).$ Which one of the following is TRUE? $X = Y$ $X ⊂ Y$ $Y ⊂ X$ None of these
commented
Jul 22, 2018
in
Set Theory & Algebra

1.3k
views
gate2005
settheory&algebra
easy
sets
2
answers
32
GATE200220
The following solution to the single producer single consumer problem uses semaphores for synchronization. #define BUFFSIZE 100 buffer buf[BUFFSIZE]; int first = last = 0; semaphore b_full = 0; semaphore b_empty = BUFFSIZE void producer() { while(1) { ... $c1$ and immediately before $c2$ so that the program works correctly for multiple producers and consumers.
commented
Jul 18, 2018
in
Operating System

1.8k
views
gate2002
operatingsystem
processsynchronization
normal
descriptive
3
answers
33
GATE2015323
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $T$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set of all elements in $T$ which ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$
commented
Jul 10, 2018
in
Set Theory & Algebra

3.9k
views
gate20153
settheory&algebra
sets
normal
3
answers
34
GATE199317
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
commented
Jul 6, 2018
in
Set Theory & Algebra

2.2k
views
gate1993
settheory&algebra
easy
sets
descriptive
6
answers
35
GATE200519
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not possible but ... interrupts and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible
commented
Jun 23, 2018
in
Operating System

5.7k
views
gate2005
operatingsystem
iohandling
normal
12
answers
36
GATE2007IT83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
commented
Jun 23, 2018
in
Operating System

6.7k
views
gate2007it
operatingsystem
diskscheduling
normal
0
answers
37
#GATE2019
I want to start Computer Network Subject as per schedule. but i don't know anything much about this subject as previous time i completely left this subject so how much average no. of days it will take to complete along with all Previous years GATE Questions of ... parallel or should i do only computer network one time) Note: i am doing job also.(5 days working) Seniors.Please suggest.
asked
Jun 22, 2018
in
GATE

90
views
preparation
10
answers
38
GATE2014233
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of the following ... faults as the optimal page replacement policy for this program? Leastrecentlyused Firstinfirstout Lastinfirstout Mostrecentlyused
commented
Jun 20, 2018
in
Operating System

9k
views
gate20142
operatingsystem
pagereplacement
ambiguous
5
answers
39
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.9k
views
gate1996
operatingsystem
memorymanagement
normal
2
answers
40
Paging
For a computer architecture with multi level paging, a page size of $4 \hspace{0.1cm}KB$, and $64 \hspace{0.1cm} bit$ Physical and Virtual address: What is the smallest possible size for a page table entry, rounded up to a power of $2$? using your result ... fits into a single page, How many levels of Page tables would be required to completely map the $64 \hspace{0.1cm} bit$ virtual space?
commented
Jun 20, 2018
in
Operating System

155
views
computerarchitecture
paging
50,737
questions
57,324
answers
198,408
comments
105,174
users