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 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.
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 compute...
470
views
answered
Jan 21, 2021
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
descriptive
+
–
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}.
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$}.(...
551
views
answered
Jun 7, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
regular-expression
+
–
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.
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$’...
1.6k
views
answered
Jun 7, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
+
–
0
votes
4
Gatebook Test
500
views
answered
Oct 22, 2019
0
votes
5
Gatebook Test
450
views
answered
Oct 22, 2019
1
votes
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.
The Diffie-Hellman key exchange is being used to establish a secret key betweenAlice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice’ssecret numbe...
1.7k
views
answered
Oct 21, 2019
Computer Networks
computer-networks
tanenbaum
network-security
cryptography
+
–
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?
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 thenumber n...
1.0k
views
answered
Oct 21, 2019
Computer Networks
computer-networks
network-security
rsa-security-networks
tanenbaum
+
–
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’’.
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...
2.3k
views
answered
Oct 21, 2019
Computer Networks
computer-networks
tanenbaum
network-security
rsa-security-networks
+
–
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?
In a network whose max segment is 128 bytes, max segment lifetime is 30 sec, andhas 8-bit sequence numbers, what is the maximum data rate per connection?
1.3k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
tanenbaum
transport-layer
+
–
1
votes
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?
A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel thathas a 10-msec one-way delay. What is the maximum throughput achievable? What isthe line ef...
1.1k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
tanenbaum
transport-layer
tcp
+
–
1
votes
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.
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. Howbig will the window be if the next four transmission bursts are all successful? Assumethat...
1.0k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
transport-layer
tanenbaum
congestion-control
+
–
1
votes
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?
The maximum payload of a TCP segment is 65,495 bytes. Why was such a strangenumber chosen?
1.0k
views
answered
Oct 14, 2019
Computer Networks
computer-networks
transport-layer
descriptive
tcp
tanenbaum
+
–
1
votes
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?
What is the total size of the minimum TCP MTU, including TCP and IP overhead butnot including data link layer overhead?
901
views
answered
Oct 14, 2019
Computer Networks
computer-networks
tanenbaum
transport-layer
tcp
descriptive
+
–
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
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 treeQuadruplesTriplesIndirect triples
8.0k
views
answered
Oct 10, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
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
Translate the arithmetic expression $a + -(b + c)$ into:A syntax tree.Quadruples.Triples.Indirect triples
11.0k
views
answered
Oct 10, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
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))$
Construct the DAG for the expression$((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$
2.6k
views
answered
Oct 10, 2019
Compiler Design
ullman
compiler-design
three-address-code
directed-acyclic-graph
descriptive
+
–
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
A router has the following (CIDR) entries in its routing table: Address/MaskNext hop135.46.56.0/22Interface 0135.46.60.0/22Interface 1192.53.40.0/23Router 1defaultRouter...
5.2k
views
answered
Oct 6, 2019
Computer Networks
computer-networks
tanenbaum
ip-addressing
subnetting
+
–
1
votes
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.
A large number of consecutive IP addresses are available starting at 198.16.0.0. Supposethat four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addres...
15.2k
views
answered
Oct 6, 2019
Computer Networks
computer-networks
tanenbaum
network-layer
ip-addressing
+
–
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?
A computer on a 6-Mbps network is regulated by a token bucket. The token bucket isfilled at a rate of 1 Mbps. It is initially filled to capacity with 8 megabits. How long...
7.4k
views
answered
Oct 6, 2019
Computer Networks
computer-networks
tanenbaum
network-layer
token-bucket
+
–
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?
A token bucket scheme is used for traffic shaping. A new token is put into the bucketevery 5 μsec. Each token is good for one short packet, which contains 48 bytes ofdat...
6.5k
views
answered
Oct 6, 2019
Computer Networks
computer-networks
tanenbaum
network-layer
token-bucket
+
–
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.
Consider the network of Figure. Distance vector routing is used, and the followingvectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12,6, 0...
11.5k
views
answered
Oct 6, 2019
Computer Networks
computer-networks
tanenbaum
data-link-layer
distance-vector-routing
+
–
1
votes
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$.
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 $...
5.5k
views
answered
Sep 29, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
parsing
+
–
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.$
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 ...
8.2k
views
answered
Sep 29, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
+
–
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.$
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)...
41.8k
views
answered
Sep 28, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
parsing
+
–
1
votes
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 .
E->TE'E'->*T { printf('*') ;} E' | epsilonT- id {printf (id.name) ;}A) E->E*T | T {printf('*');}T->id {printf(id.name);}B) E->TE'E'->*TME' | epsilonM->epsilon { printf('...
1.7k
views
answered
Sep 26, 2019
Compiler Design
compiler-design
syntax-directed-translation
+
–
1
votes
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$
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$
1.5k
views
answered
Sep 23, 2019
Linear Algebra
isi2018-mma
engineering-mathematics
linear-algebra
rank-of-matrix
+
–
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}$
If $A =\begin{bmatrix} 2 &i \\ i & 0 \end{bmatrix}$ , the trace of $A^{10}$ is$2$$2(1+i)$$0$$2^{10}$
914
views
answered
Sep 23, 2019
Linear Algebra
isi2018-mma
engineering-mathematics
linear-algebra
determinant
+
–
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?
How long does a station, s, have to wait in the worst case before it can start transmittingits frame over a LAN that uses the basic bit-map protocol?
2.0k
views
answered
Sep 18, 2019
Computer Networks
computer-networks
tanenbaum
mac-protocol
lan-technologies
bit-map-protocol
+
–
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)?
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...
4.4k
views
answered
Sep 18, 2019
Computer Networks
computer-networks
tanenbaum
lan-technologies
ethernet
csma-cd
+
–
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?
A large population of ALOHA users manages to generate 50 requests/sec, includingboth originals and retransmissions. Time is slotted in units of 40 msec.(a) What is the ch...
1.8k
views
answered
Sep 18, 2019
Computer Networks
computer-networks
tanenbaum
mac-protocol
slotted-aloha
lan-technologies
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register