Dark Mode

Answers by aditi19

0 votes

1

Kenneth Rosen Edition 7 Exercise 6.2 Question 38 (Page No. 406)
Find the least number of cables required to connect eight computers to four printers to guarantee that for every choice of four of the eight computers, these four computers can directly access four different printers. Justify your answer.

answered in Combinatory Jan 21, 2021

454 views

0 votes

2

Peter Linz Edition 4 Exercise 3.2 Question 13 (Page No. 88)
Find a regular expression for the following languages on {$a, b$}. (a) $L =$ {$w : n_a (w)$ and $n_b (w)$ are both even}. (b) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 1$}. (c) $L =$ {$w :(n_a (w) - n_b (w))$ mod $3 = 0$}. (d) $L =$ {$w :2n_a (w)+3n_b (w)$ is even}.

answered in Theory of Computation Jun 7, 2020

540 views

0 votes

3

Peter Linz Edition 4 Exercise 3.1 Question 16 (Page No. 76)
Give regular expressions for the following languages on $Σ =$ {$a, b, c$}. (a) all strings containing exactly one $a$, (b) all strings containing no more than three $a$'s, (c) Peter Linz Edition 4 Exercise 3.1 Question 16.c ... 16.d (Page No. 76) (e) all strings in which all runs of $a$'shave lengths that are multiples of three.

answered in Theory of Computation Jun 7, 2020

1.6k views

0 votes

4

answered in Linear Algebra Oct 22, 2019

489 views

0 votes

5

answered in Linear Algebra Oct 22, 2019

436 views

1 vote

6

Andrew S. Tanenbaum Edition 5th Exercise 8 Question 32 (Page No. 874)
The Diffie-Hellman key exchange is being used to establish a secret key between Alice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice’s secret number, x, is 12, and Bob’s secret number, y, is 3. Show how Alice and Bob compute the secret key.

answered in Computer Networks Oct 21, 2019

1.7k views

0 votes

7

Andrew S. Tanenbaum Edition 5th Exercise 8 Question 18 (Page No. 873)
Alice and Bob use RSA public key encryption in order to communicate between them. Trudy finds out that Alice and Bob shared one of the primes used to determine the number n of their public key pairs. In other words, Trudy found out that na = pa × q and nb = pb × q. How can Trudy use this information to break Alice’s code?

answered in Computer Networks Oct 21, 2019

1.0k views

0 votes

8

Andrew S. Tanenbaum Edition 5th Exercise 8 Question 17 (Page No. 873)
Using the RSA public key cryptosystem, with a = 1, b = 2 . . . y = 25, z = 26. (a) If p = 5 and q = 13, list five legal values for d. (b) If p = 5, q = 31, and d = 37, find e. (c) Using p = 3, q = 11, and d = 9, find e and encrypt ‘‘hello’’.

answered in Computer Networks Oct 21, 2019

2.2k views

0 votes

9

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 36 (Page No. 609)
In a network whose max segment is 128 bytes, max segment lifetime is 30 sec, and has 8-bit sequence numbers, what is the maximum data rate per connection?

answered in Computer Networks Oct 14, 2019

1.3k views

1 vote

10

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 33 (Page No. 609)
A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line efficiency?

answered in Computer Networks Oct 14, 2019

1.0k views

1 vote

11

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 31 (Page No. 609)
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. How big will the window be if the next four transmission bursts are all successful? Assume that the maximum segment size is 1 KB.

answered in Computer Networks Oct 14, 2019

987 views

1 vote

12

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 28 (Page No. 608)
The maximum payload of a TCP segment is 65,495 bytes. Why was such a strange number chosen?

answered in Computer Networks Oct 14, 2019

1.0k views

1 vote

13

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 22 (Page No. 608)
What is the total size of the minimum TCP MTU, including TCP and IP overhead but not including data link layer overhead?

answered in Computer Networks Oct 14, 2019

870 views

2 votes

14

Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 2 (Page No. 370)
Translate the following arithmetic expression into: $a=b[i]+c[j]$ $a[i]=b\ast c-b\ast d$ $x=f(y+1)+2$ $x=\ast p + \&y$ A Syntax tree Quadruples Triples Indirect triples

answered in Compiler Design Oct 10, 2019

7.8k views

5 votes

15

Ullman (Compiler Design) Edition 2 Exercise 6.2 Question 1 (Page No. 370)
Translate the arithmetic expression $a + -(b + c)$ into: A syntax tree. Quadruples. Triples. Indirect triples

answered in Compiler Design Oct 10, 2019

10.5k views

0 votes

16

Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 1 (Page No. 362)
Construct the DAG for the expression $((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$

answered in Compiler Design Oct 10, 2019

2.5k views

4 votes

17

Andrew S. Tanenbaum Edition 5th Exercise 5 Question 33 (Page No. 492)
A router has the following (CIDR) entries in its routing table: Address/Mask Next hop 135.46.56.0/22 Interface 0 135.46.60.0/22 Interface 1 192.53.40.0/23 Router 1 default Router 2 For each of the following IP addresses, what does the router do if a ... 135.46.63.10 (b) 135.46.57.14 (c) 135.46.52.2 (d) 192.53.40.7 (e) 192.53.56.7

answered in Computer Networks Oct 6, 2019

5.0k views

1 vote

18

Andrew S. Tanenbaum Edition 5th Exercise 5 Question 30 (Page No. 492)
A large number of consecutive IP addresses are available starting at 198.16.0.0. Suppose that four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addresses, respectively, and in that order. For each of ... the first IP address assigned, the last IP address assigned, and the mask in the w.x.y.z/s notation.

answered in Computer Networks Oct 6, 2019

14.9k views

0 votes

19

Andrew S. Tanenbaum Edition 5th Exercise 5 Question 19 (Page No. 491)
A computer on a 6-Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 1 Mbps. It is initially filled to capacity with 8 megabits. How long can the computer transmit at the full 6 Mbps?

answered in Computer Networks Oct 6, 2019

7.3k views

0 votes

20

Andrew S. Tanenbaum Edition 5th Exercise 5 Question 18 (Page No. 491)
A token bucket scheme is used for traffic shaping. A new token is put into the bucket every 5 μsec. Each token is good for one short packet, which contains 48 bytes of data. What is the maximum sustainable data rate?

answered in Computer Networks Oct 6, 2019

6.4k views

4 votes

21

Andrew S. Tanenbaum Edition 5th Exercise 5 Question 6 (Page No. 490)
Consider the network of Figure. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0 ... , and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the cost.

answered in Computer Networks Oct 6, 2019

11.2k views

1 vote

22

Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 5 (Page No. 317)
This grammar generates binary numbers with a "decimal" point: $S\rightarrow L.L\mid L$ $L\rightarrow LB\mid B$ $B\rightarrow 0\mid 1$ Design an S-attributed SDD to compute $S.val$, the decimal-number value of an input string. For example, the translation of string $101.101$ should be the decimal number $5.625$.

answered in Compiler Design Sep 29, 2019

5.4k views

2 votes

23

Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 3 (Page No. 317)
Suppose that we have a production $A\rightarrow BCD$. Each of the four nonterminals $A, B, C,$ and $D$ have two attributes: $s$ is a synthesized attribute, and $i$ is an inherited attribute. For each of the sets of rules below, tell whether the rules are consistent ... $A.s=D.i,B.i=A.s+C.s,C.i=B.s,$ and $D.i=B.i+C.i.$

answered in Compiler Design Sep 29, 2019

7.9k views

0 votes

24

Ullman (Compiler Design) Edition 2 Exercise 5.1 Question 1 (Page No. 309 - 310)
For the SDD(SYNTAX-DIRECTED DEFINITIONS ) of Fig. $5.1$, give annotated parse trees for the following expressions: $(3+4)\ast(5+6)n.$ $1\ast2\ast3\ast(4+5)n.$ $(9+8\ast(7+6)+5)\ast 4n.$

answered in Compiler Design Sep 28, 2019

40.2k views

1 vote

25

Convert the following L-attributed definition to S-attributed definition .
E->TE' E'->*T { printf('*') ;} E' | epsilon T-> id {printf (id.name) ;} A) E->E*T | T {printf('*');} T->id {printf(id.name);} B) E->TE' E'->* ... ;T*E {printf('*');} E->T T->id {printf (id.name) ;} D) None of these Please explain precisely .

answered in Compiler Design Sep 26, 2019

1.7k views

1 vote

26

ISI2018-MMA-12
The rank of the matrix $\begin{bmatrix} 1 &2 &3 &4 \\ 5& 6 & 7 & 8 \\ 6 & 8 & 10 & 12 \\ 151 & 262 & 373 & 484 \end{bmatrix}$ $1$ $2$ $3$ $4$

answered in Linear Algebra Sep 23, 2019

1.5k views

7 votes

27

ISI2018-MMA-13
If $A =\begin{bmatrix} 2 &i \\ i & 0 \end{bmatrix}$ , the trace of $A^{10}$ is $2$ $2(1+i)$ $0$ $2^{10}$

answered in Linear Algebra Sep 23, 2019

891 views

0 votes

28

Andrew S. Tanenbaum Edition 5 Exercise 4 Question 7 (Page No. 351)
How long does a station, s, have to wait in the worst case before it can start transmitting its frame over a LAN that uses the basic bit-map protocol?

answered in Computer Networks Sep 18, 2019

2.0k views

0 votes

29

Andrew S. Tanenbaum Edition 5 Exercise 4 Question 6 (Page No. 351)
What is the length of a contention slot in CSMA/CD for (a) a 2-km twin-lead cable (signal propagation speed is 82% of the signal propagation speed in vacuum)?, and (b) a 40-km multimode fiber optic cable (signal propagation speed is 65% of the signal propagation speed in vacuum)?

answered in Computer Networks Sep 18, 2019

4.3k views

0 votes

30

Andrew S. Tanenbaum Edition 5 Exercise 4 Question 4 (Page No. 351)
A large population of ALOHA users manages to generate 50 requests/sec, including both originals and retransmissions. Time is slotted in units of 40 msec. (a) What is the chance of success on the first attempt? (b) ... of exactly k collisions and then a success? (c) What is the expected number of transmission attempts needed?

answered in Computer Networks Sep 18, 2019

1.7k views

Page:

1
2
3
4
next »