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
Recent activity by arpit_18
4
answers
1
GATE CSE 2020 | Question: 43
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this processor. Overheads associated with pipelining force you to ... , the speedup achieved by the pipelined processor over the non-pipelined processor (round off to $2$ decimal places) is_____________.
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this p...
16.7k
views
commented
Feb 11, 2021
CO and Architecture
gatecse-2020
numerical-answers
co-and-architecture
pipelining
2-marks
+
–
5
answers
2
what is true about binary semaphore?
what is true about binary semaphore? 1)Binary semaphore has drawback called busy wait or spin lock. 2)Binary semaphore is applicable only for two processes 3)Binary semaphore has no drawback called busy wait or spin lock 4)none of the above
what is true about binary semaphore?1)Binary semaphore has drawback called busy wait or spin lock.2)Binary semaphore is applicable only for two processes3)Binary semaphor...
3.4k
views
commented
Feb 11, 2021
Operating System
semaphore
+
–
9
answers
3
GATE CSE 2019 | Question: 22
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to $3$ decimal places) that their $4\text{-bit}$ (unsigned) binary representations have the same most significant bit is ___________.
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$The probability (rounded off to $3$ decimal places) that their $4\text{-bit}...
20.2k
views
commented
Feb 9, 2021
Digital Logic
gatecse-2019
numerical-answers
digital-logic
number-representation
probability
1-mark
+
–
5
answers
4
GATE IT 2004 | Question: 6
What values of x, y and z satisfy the following system of linear equations? $\begin{bmatrix} 1 &2 &3 \\ 1& 3 &4 \\ 2& 2 &3 \end{bmatrix} \begin{bmatrix} x\\y \\ z \end{bmatrix} = \begin{bmatrix} 6\\8 \\ 12 \end{bmatrix}$ $x = 6$, $y = 3$, $z = 2$ $x = 12$, $y = 3$, $z = - 4$ $x = 6$, $y = 6$, $z = - 4$ $x = 12$, $y = - 3$, $z = 0$
What values of x, y and z satisfy the following system of linear equations?$$\begin{bmatrix} 1 &2 &3 \\ 1& 3 &4 \\ 2& 2 &3 \end{bmatrix} \begin{bmatrix} x\\y \\ z \end{bm...
6.5k
views
commented
Feb 2, 2021
Linear Algebra
gateit-2004
linear-algebra
system-of-equations
easy
+
–
6
answers
5
GATE CSE 2015 Set 1 | Question: 16
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\varnothing \in 2^{A}$ $\varnothing \subseteq 2^{A}$ ... I and III only II and III only I, II and III only I, II and IV only
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE?$\varnoth...
15.7k
views
commented
Jan 31, 2021
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
set-theory
normal
+
–
4
answers
6
GATE CSE 2005 | Question: 42
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE?$R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence r...
9.2k
views
commented
Jan 30, 2021
Set Theory & Algebra
gatecse-2005
set-theory&algebra
normal
relations
+
–
3
answers
7
GATE CSE 2012 | Question: 53
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\varepsilon$ is the empty string, \$ indicates end of input, and, $ ... $ E2 : B \rightarrow S, S \rightarrow \varepsilon$ $ E3 : B \rightarrow S$
For the grammar below, a partial $LL(1)$ parsing table is also presented along with the grammar. Entries that need to be filled are indicated as $E1, E2,$ and $E3$. $\var...
17.7k
views
commented
Jan 28, 2021
Compiler Design
normal
gatecse-2012
compiler-design
parsing
+
–
7
answers
8
GATE CSE 2014 Set 1 | Question: 34
A canonical set of items is given below $S \to L .> R $ $Q \to R.$ On input symbol $<$ the set has a shift-reduce conflict and a reduce-reduce conflict. a shift-reduce conflict but not a reduce-reduce conflict. a reduce-reduce conflict but not a shift-reduce conflict. neither a shift-reduce nor a reduce-reduce conflict.
A canonical set of items is given below$S \to L . R $$Q \to R.$On input symbol $<$ the set hasa shift-reduce conflict and a reduce-reduce conflict.a shift-reduce conflict...
25.5k
views
commented
Jan 28, 2021
Compiler Design
gatecse-2014-set1
compiler-design
parsing
normal
lr-parser
+
–
6
answers
9
GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory i...
28.9k
views
commented
Jan 27, 2021
CO and Architecture
gatecse-2017-set2
cache-memory
co-and-architecture
normal
+
–
4
answers
10
GATE CSE 2017 Set 2 | Question: 42
The next state table of a $2-$ ... $T_1 = Q_1+Q_0, \quad T_0= \bar{Q_1} \bar{Q_0}$ $T_1 = \bar{Q_1}Q_0, \quad T_0= Q_1 + Q_0$
The next state table of a $2-$bit saturating up-counter is given below.$\begin{array}{cc|cc} Q_1 & Q_0 & Q_1^+ & Q_0^+ \\ \hline 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0...
11.2k
views
commented
Jan 26, 2021
Digital Logic
gatecse-2017-set2
digital-logic
digital-counter
+
–
7
answers
11
GATE CSE 2009 | Question: 13
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source. $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm?P: Always finds a negative weighted cycle, if one exists.Q: Finds whethe...
16.9k
views
commented
Jan 26, 2021
Algorithms
gatecse-2009
algorithms
graph-algorithms
normal
bellman-ford
+
–
9
answers
12
GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...
31.0k
views
commented
Jan 26, 2021
DS
gatecse-2019
numerical-answers
data-structures
binary-tree
2-marks
+
–
6
answers
13
GATE CSE 1997 | Question: 6.2
Let $G$ be the graph with $100$ vertices numbered $1$ to $100$. Two vertices $i$ and $j$ are adjacent if $\vert i-j \vert =8$ or $\vert i-j \vert=12$. The number of connected components in $G$ is $8$ $4$ $12$ $25$
Let $G$ be the graph with $100$ vertices numbered $1$ to $100$. Two vertices $i$ and $j$ are adjacent if $\vert i-j \vert =8$ or $\vert i-j \vert=12$. The number of con...
9.1k
views
answered
Jan 26, 2021
DS
gate1997
data-structures
normal
graph-theory
+
–
8
answers
14
GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets ...
42.1k
views
commented
Jan 25, 2021
Computer Networks
gatecse-2006
computer-networks
sliding-window
normal
+
–
7
answers
15
GATE CSE 2013 | Question: 37
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, ... , $2400$ and $2789$ First fragment, $2400$ and $2759$ Last fragment, $2400$ and $2759$ Middle fragment, $300$ and $689$
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datag...
32.2k
views
commented
Jan 25, 2021
Computer Networks
gatecse-2013
computer-networks
ip-addressing
normal
+
–
3
answers
16
GATE IT 2008 | Question: 5
Which of the following regular expressions describes the language over$\{0, 1\}$ consisting of strings that contain exactly two $1$'s? $(0 + 1)^ * \ 11(0 + 1) ^*$ $0 ^* \ 110 ^*$ $0 ^* 10 ^* 10 ^*$ $(0 + 1) ^* 1(0 + 1) ^* 1 (0 + 1) ^*$
Which of the following regular expressions describes the language over$\{0, 1\}$ consisting of strings that contain exactly two $1$'s?$(0 + 1)^ * \ 11(0 + 1) ^*$$0 ^* \ 1...
8.7k
views
commented
Jan 23, 2021
Theory of Computation
gateit-2008
theory-of-computation
regular-expression
easy
+
–
3
answers
17
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{llll}\hline \text{$G1$ :} & \text{stmnt} & \text{$\...
12.9k
views
commented
Jan 23, 2021
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
6
answers
18
GATE CSE 2017 Set 1 | Question: 38
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$. Which of the following are context-free languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \le...
13.8k
views
commented
Jan 22, 2021
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
6
answers
19
GATE IT 2004 | Question: 51
The storage area of a disk has the innermost diameter of $10$ cm and outermost diameter of $20$ cm. The maximum storage density of the disk is $1400$ bits/cm. The disk rotates at a speed of $4200$ RPM. The main memory of a computer has $64$-bit word length ... from the disk, the percentage of memory cycles stolen for transferring one word is $0.5 \%$ $1 \%$ $5\%$ $10\%$
The storage area of a disk has the innermost diameter of $10$ cm and outermost diameter of $20$ cm. The maximum storage density of the disk is $1400$ bits/cm. The disk ro...
22.5k
views
commented
Jan 21, 2021
CO and Architecture
gateit-2004
co-and-architecture
dma
normal
+
–
10
answers
20
GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...
48.5k
views
commented
Jan 19, 2021
CO and Architecture
gatecse-2013
normal
co-and-architecture
pipelining
+
–
13
answers
21
GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of ...
36.2k
views
commented
Jan 4, 2021
Computer Networks
gatecse-2007
computer-networks
subnetting
easy
isro2016
+
–
6
answers
22
GATE CSE 2003 | Question: 82, ISRO2009-1
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network? $172.57.88.62$ and $172.56.87.23$ $10.35.28.2$ and $10.35.29.4$ $191.203.31.87$ and $191.234.31.88$ $128.8.129.43$ and $128.8.161.55$
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network?$172.57.88.62$ and $172.56....
29.6k
views
commented
Jan 4, 2021
Computer Networks
gatecse-2003
computer-networks
subnetting
normal
isro2009
+
–
3
answers
23
GATE CSE 2004 | Question: 56
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\text{TCP}$ layer prefixes $20$ byte header to the message. This passes ... $200$ $220$ $240$ $260$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\...
23.4k
views
commented
Jan 4, 2021
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
6
answers
24
GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/...
25.1k
views
commented
Jan 2, 2021
Computer Networks
gateit-2008
computer-networks
sliding-window
normal
+
–
4
answers
25
GATE CSE 2001 | Question: 2.17 | UGCNET-AUG2016-III: 21
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z } $\text{10, 3}$ $\text{31, 3}$ $\text{27, 7}$ None of the above
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing?Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } f...
12.5k
views
commented
Dec 31, 2020
Programming in C
gatecse-2001
programming-in-c
parameter-passing
normal
ugcnetcse-aug2016-paper3
+
–
5
answers
26
GATE CSE 2007 | Question: 33
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $X * Y = XY + X'Y'.$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$. $P : X = Y * Z, \\ Q :Y = X * Z, \\ R : X *Y * Z = 1$ Which of the following is TRUE? Only $P$ and $Q$ are valid. Only $Q$ and $R$ are valid. Only $P$ and $R$ are valid. All $P$, $Q$, $R$ are valid.
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $$X * Y = XY + X'Y'.$$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$.$$P : X = ...
9.1k
views
answered
Dec 27, 2020
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
3
answers
27
GATE IT 2006 | Question: 7, ISRO2009-41
The addition of $4-bit$, two's complement, binary numbers $1101$ and $0100$ results in $0001$ and an overflow $1001$ and no overflow $0001$ and no overflow $1001$ and an overflow
The addition of $4-bit$, two's complement, binary numbers $1101$ and $0100$ results in$0001$ and an overflow$1001$ and no overflow$0001$ and no overflow$1001$ and an over...
14.5k
views
commented
Dec 26, 2020
Digital Logic
gateit-2006
digital-logic
number-representation
normal
isro2009
+
–
2
answers
28
GATE IT 2007 | Question: 42
$(C012.25)_H - (10111001110.101)_B =$ $(135103.412)_o$ $(564411.412)_o$ $(564411.205)_o$ $(135103.205)_o$
$(C012.25)_H - (10111001110.101)_B =$$(135103.412)_o$$(564411.412)_o$$(564411.205)_o$$(135103.205)_o$
7.0k
views
commented
Dec 26, 2020
Digital Logic
gateit-2007
digital-logic
number-representation
normal
+
–
2
answers
29
TIFR CSE 2011 | Part A | Question: 16
A variable that takes thirteen possible values can be communicated using? Thirteen bits. Three bits. $\log_{2}13$ bits. Four bits. None of the above.
A variable that takes thirteen possible values can be communicated using?Thirteen bits.Three bits.$\log_{2}13$ bits.Four bits.None of the above.
2.1k
views
commented
Dec 26, 2020
Digital Logic
tifr2011
number-representation
+
–
5
answers
30
GATE CSE 2007 | Question: 85
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 ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$
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...
9.6k
views
commented
Dec 25, 2020
Combinatory
gatecse-2007
combinatory
normal
discrete-mathematics
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register