Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for tanenbaum
0
votes
3
answers
1
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 15 (Page No. 253)
Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum (4-bit word). What is the value of the checksum?
Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum(4-bit word). What is the value of the checksum?
ajaysoni1924
7.3k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
tanenbaum
error-detection
checksum
+
–
4
votes
2
answers
2
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 32 (Page No. 254)
Frames of 1000 bits are sent over a 1-Mbps channel using a geostationary satellite whose propagation time from the earth is 270 msec. Acknowledgements are always piggybacked onto data frames. The headers are very short. Three-bit ... achievable channel utilization for (a) Stop-and-wait? (b) go back n? (c) selective repeat?
Frames of 1000 bits are sent over a 1-Mbps channel using a geostationary satellitewhose propagation time from the earth is 270 msec. Acknowledgements are alwayspiggybacke...
ajaysoni1924
17.0k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
tanenbaum
stop-and-wait
sliding-window
+
–
7
votes
4
answers
3
tanenbaum computer networks
A $3000$km-long T1 trunk having Transmission time $1.544$ Mbps is used to transmit $64$byte frames using Go back -N. If the propagation speed is $6$ μsec/km, how many bits should the sequence numbers be?
A $3000$km-long T1 trunk having Transmission time $1.544$ Mbps is used to transmit $64$byte frames using Go back -N.If the propagation speed is $6$ μsec/km, how many b...
anonymous
16.9k
views
anonymous
asked
Apr 1, 2017
Computer Networks
computer-networks
tanenbaum
+
–
0
votes
1
answer
4
ANDREW S. TANENBAUM, chapter 5
How many packets will be generated if you apply the simple flooding technique on the network in the above diagram fig-1 to make sure that each of the nodes receives at least one copy of the packet?
How many packets will be generated if you apply the simple flooding technique on the network in the above diagram fig-1 to make sure that each of the nodes receives at le...
irfan_cse
513
views
irfan_cse
asked
Mar 30, 2023
Computer Networks
tanenbaum
computer-networks
+
–
0
votes
1
answer
5
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 17 (Page No. 253)
A bit stream 10011101 is transmitted using the standard CRC method described in the text. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Suppose that the third bit from the left is inverted ... . Give an example of bit errors in the bit string transmitted that will not be detected by the receiver.
A bit stream 10011101 is transmitted using the standard CRC method described in thetext. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Supp...
ajaysoni1924
33.3k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
crc-polynomial
error-detection
data-link-layer
+
–
1
votes
2
answers
6
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 16 (Page No. 255)
You are given the following data about a virtual memory system: The $TLB$ can hold $1024$ entries and can be accessed in $1$ clock cycle $(1\: nsec).$ A page table entry can be found in $100$ ... $0.01\%$ lead to a page fault, what is the effective address-translation time?
You are given the following data about a virtual memory system:The $TLB$ can hold $1024$ entries and can be accessed in $1$ clock cycle $(1\: nsec).$ A page table entry c...
admin
618
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
translation-lookaside-buffer
descriptive
+
–
0
votes
2
answers
7
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 12 (Page No. 255)
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the virtual address space, $v,$ and the number of bytes of $RAM,\: r$. Give an expression for the worst-case disk-space requirements. How realistic is this amount?
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the virtual address space, $...
admin
1.1k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
2
votes
1
answer
8
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 8 (Page No. 430)
Suppose that a computer can read or write a memory word in $5 nsec.$ Also suppose that when an interrupt occurs, all $32$ CPU registers, plus the program counter and PSW are pushed onto the stack. What is the maximum number of interrupts per second this machine can process?
Suppose that a computer can read or write a memory word in $5 nsec.$ Also suppose that when an interrupt occurs, all $32$ CPU registers, plus the program counter and PSW ...
admin
398
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
interrupts
descriptive
+
–
4
votes
4
answers
9
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 19 (Page No. 256)
A computer with a $32-bit$ address uses a two-level page table. Virtual addresses are split into a $9-bit$ top-level page table field, an $11-bit$ second-level page table field, and an offset. How large are the pages and how many are there in the address space?
A computer with a $32-bit$ address uses a two-level page table. Virtual addresses are split into a $9-bit$ top-level page table field, an $11-bit$ second-level page table...
admin
2.5k
views
admin
asked
Oct 26, 2019
Operating System
tanenbaum
operating-system
memory-management
multilevel-paging
paging
descriptive
+
–
0
votes
2
answers
10
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 14 (Page No. 175)
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.
In Fig. $2-12$ the register set is listed as a per-thread rather than a per-process item. Why? After all, the machine has only one set of registers.
admin
1.1k
views
admin
asked
Oct 24, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
1
votes
2
answers
11
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 8 (Page No. 174)
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. What will be the CPU utilization?
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. ...
admin
2.7k
views
admin
asked
Oct 24, 2019
Operating System
tanenbaum
operating-system
process-and-threads
descriptive
+
–
0
votes
1
answer
12
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 9 (Page No. 174)
Assume that you are trying to download a large $2$-GB file from the Internet. The file is available from a set of mirror servers, each of which can deliver a subset of the file's bytes; assume that a ... request specifies the starting and ending bytes of the file. Explain how you might use threads to improve the download time.
Assume that you are trying to download a large $2$-GB file from the Internet. The file is available from a set of mirror servers, each of which can deliver a subset of th...
admin
831
views
admin
asked
Oct 24, 2019
Operating System
tanenbaum
operating-system
process-and-threads
threads
descriptive
+
–
0
votes
1
answer
13
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 45 (Page No. 494)
Write a function to do forwarding in an IP router. The procedure has one parameter, an IP address. It also has access to a global table consisting of an array of triples. Each triple contains three integers: an IP address, ... The function looks up the IP address in the table using CIDR and returns the line to use as its value.
Write a function to do forwarding in an IP router. The procedure has one parameter,an IP address. It also has access to a global table consisting of an array of triples.E...
ajaysoni1924
413
views
ajaysoni1924
asked
Mar 18, 2019
Computer Networks
computer-networks
tanenbaum
network-layer
program
+
–
3
votes
1
answer
14
Andrew S. Tanenbaum Edition 5 Exercise 4 Question 2 (Page No. 351)
A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a 1000-bit frame on average once every 100 sec, even if the previous one has not yet been sent (e.g., the stations can buffer outgoing frames). What is the maximum value of N?
A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a1000-bit frame on average once every 100 sec, even if the previous one has not yetbeen sen...
ajaysoni1924
15.4k
views
ajaysoni1924
asked
Mar 15, 2019
Computer Networks
computer-networks
tanenbaum
lan-technologies
mac-protocol
pure-aloha
+
–
1
votes
2
answers
15
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 24 (Page No. 334)
Free disk space can be kept track of using a free list or a bitmap. Disk addresses require $D$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space ... For $D$ having the value $16$ bits, express your answer as a percentage of the disk space that must be free.
Free disk space can be kept track of using a free list or a bitmap. Disk addresses require $D$ bits. For a disk with $B$ blocks, $F$ of which are free, state the conditio...
admin
1.0k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
0
votes
1
answer
16
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 13 (Page No. 82)
Consider a system that has two CPUs, each CPU having two threads (hyperthreading). Suppose three programs, $P0, P1,$ and $P2$, are started with run times of $5, 10$ and $20$ msec, respectively. How long will it ... all three programs are $100\%$ CPU bound, do not block during execution, and do not change CPUs once assigned.
Consider a system that has two CPUs, each CPU having two threads (hyperthreading). Suppose three programs, $P0, P1,$ and $P2$, are started with run times of $5, 10$ and $...
admin
302
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
threads
descriptive
+
–
0
votes
2
answers
17
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 36 (Page No. 494)
Describe a way to reassemble IP fragments at the destination.
Describe a way to reassemble IP fragments at the destination.
ajaysoni1924
467
views
ajaysoni1924
asked
Mar 18, 2019
Computer Networks
computer-networks
tanenbaum
network-layer
fragmentation
descriptive
+
–
0
votes
1
answer
18
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 56 (Page No. 434)
Write a program to implement the three disk-arm scheduling algorithms. Write a driver program that generates a sequence of cylinder numbers $(0–999)$ at random, runs the three algorithms for this sequence and prints out the total distance (number of cylinders) the arm needs to traverse in the three algorithms.
Write a program to implement the three disk-arm scheduling algorithms. Write a driver program that generates a sequence of cylinder numbers $(0–999)$ at random, runs th...
admin
420
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk-scheduling
descriptive
+
–
1
votes
3
answers
19
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 23 (Page No. 334)
Consider a $4-TB$ disk that uses $4-KB$ blocks and the free-list method. How many block addresses can be stored in one block?
Consider a $4-TB$ disk that uses $4-KB$ blocks and the free-list method. How many block addresses can be stored in one block?
admin
1.9k
views
admin
asked
Oct 27, 2019
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
4
votes
2
answers
20
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 5 (Page No. 429)
A DMA controller has five channels. The controller is capable of requesting a $32$-bit word every $40\: nsec.$ A response takes equally long. How fast does the bus have to be to avoid being a bottleneck?
A DMA controller has five channels. The controller is capable of requesting a $32$-bit word every $40\: nsec.$ A response takes equally long. How fast does the bus have t...
admin
2.2k
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
dma
descriptive
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register