Dark Mode

Recent activity by PiratedVirus

2 answers

1

Madeeasy[CN-Flow control]
Consider two computers A and B are connected through a network of 30 Mbps.Assume the distance between them is 3000km and the signal propagation speed is same as the speed of light and the packet size is 12 KB. What is minimum number of bits required for window to achieve 100% utilization during GBN and SR protocol ?

commented in Computer Networks Dec 25, 2019

1.2k views

0 answers

2

MadeEasy Test Series: Digital Logic - Logic Gates
A bulb in a stair case has two switches, one switch being at the ground floor and other at the first floor. The bulb can be turned ON and also can be turned OFF by any one of the switches irrespective of the state of the other switch. What ... of the state of the other switch so I think, it should be OR gate. What should be the answer? OR or XOR

commented in Digital Logic Dec 25, 2019

484 views

0 answers

3

MadeEasy Full Length Test 2019: Engineering Mathematics - Probability
Can any one explain me the part in green box Thanks :)

commented in Probability Nov 13, 2019

840 views

1 answer

4

MadeEasy Subject Test: Digital Logic - Booths Algorithm
I understand booth's algorithm, but what is the meaning of this question?

commented in Digital Logic Nov 7, 2019

3.5k views

1 answer

5

Calculate mod in RSA algorithm
How to calculate Mod of a big number in RSA Like 5 raise to power 13 mod 77

commented in Computer Networks Jan 15, 2019

1.9k views

10 answers

6

GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.

comment edited in Combinatory Jan 15, 2019

17.8k views

2 answers

7

commented in Computer Networks Jan 15, 2019

2.3k views

1 answer

8

RSA(self doubt)

commented in Computer Networks Jan 15, 2019

650 views

9 answers

9

GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

commented in DS Jan 14, 2019

24.0k views

2 answers

10

Jamming Signal
What is Jamming Signal and How does it Work?

commented in Computer Networks Jan 13, 2019

5.7k views

0 answers

11

MadeEasy Test Series: Computer Networks - Sliding Window
Assume 2 computers are connected via a network, The networks use GoBack7 SW protocol for maintaining flow control. It is observed that every $5^{th}$ packet that has been sent through the network is lost. The number of extra packets needs to resend for transmitting 10 such packet through the network is______________________.

comment edited in Computer Networks Jan 13, 2019

853 views

0 answers

12

made easy cn 2018
consider the following statement:- data link layer define the boundaries of frame because framing is always of fixed size true or false?? acc. to me , its true

commented in Computer Networks Jan 12, 2019

801 views

1 answer

13

Ace 2019
Dependency preserving/Lossless ?

commented in Databases Jan 12, 2019

602 views

4 answers

14

Topological Sort
How many Topological Orderings possible from A to H?

commented in Algorithms Jan 12, 2019

2.1k views

18 answers

15

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

commented in Databases Jan 12, 2019

70.8k views

5 answers

16

GATE CSE 1996 | Question: 2.21
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output. Binary to Hex conversion Binary to BCD conversion Binary to Gray code conversion Binary to $radix-12$ conversion

commented in Digital Logic Jan 10, 2019

13.9k views

8 answers

17

GATE IT 2007 | Question: 45
The line $T$ in the following figure is permanently connected to the ground. Which of the following inputs $(X_1 X_2 X_3 X_4)$ will detect the fault ? $0000$ $0111$ $1111$ None of these

commented in Digital Logic Jan 10, 2019

12.2k views

4 answers

18

GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$

commented in CO and Architecture Jan 9, 2019

46.3k views

8 answers

19

GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$

commented in CO and Architecture Jan 9, 2019

34.3k views

1 answer

20

GATE 2015 SET-2 Q 29
Let the random variable X represent the number of times a fair coin needs to be tossed till two consecutive heads appear for the first time. The expectation of X is _______.

commented in Probability Jan 6, 2019

3.9k views

8 answers

21

GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$

commented in Probability Jan 6, 2019

8.5k views

1 answer

22

commented in Databases Dec 27, 2018

444 views

2 answers

23

ME test series
Consider the following CFG, with S as start symbol: S -> aA l CB A -> BaA I e B-> bB l Abc l e C -> B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION) FIRST(B)? FOLLOW(C)?

commented in Compiler Design Dec 24, 2018

996 views

0 answers

24

Viable prefix & Handle
What is viable prefix and handle can you please explain with the example?

commented in Compiler Design Dec 24, 2018

639 views

0 answers

25

decidability
please someone explain what are these problems and how to solve these problems for every language with proper explanation? MEMBERSHIP PROBLEM EMPTINESS PROBLEM COMPLETENESS PROBLEM EQUILITY PROBLEM SUBSET PROBLEM DISJOINTNESS PROBLEM IS GIVEN LANGUAGE REGULAR FINITENESS PROBLEM

commented in Theory of Computation Dec 24, 2018

963 views

1 answer

26

Regular expressions
→ Let LA = ab*a and LB = b*a. Let LA / LB = {x | xy∈ LA for some y ∈ LB}, then LA / LBis: 1.a 2.None of these. 3. ab* 4.ab*a

commented in Theory of Computation Dec 23, 2018

805 views

1 answer

27

Context Free Grammar
Is 0^n 1^n 0^n 1^n where n>=0 a CFG ? Its given that its not CFG , please explain how ?

commented in Theory of Computation Dec 23, 2018

289 views

0 answers

28

Compiler theory
LR grammars describe a proper superset of the languages recognized by LL (predictive) parsers “Unable to interpret this statement completely” Please guide Source: https://parasol.tamu.edu/~rwerger/Courses/434/lec8.pdf

commented in Compiler Design Dec 23, 2018

260 views

2 answers

29

GATE IT 2006 | Question: 29
Consider the regular grammar below $S \rightarrow bS \mid aA \mid \epsilon $ $A \rightarrow aS \mid bA$ ... $\{\epsilon\},\{wa \mid w \in (a + b)^* \text{and} \{wb \mid w \in (a + b)^*\}$

commented in Theory of Computation Dec 21, 2018

9.8k views

1 answer

30

ME test series
Please draw the GANTT CHART

commented in Operating System Dec 18, 2018

379 views