Computers and Technology, 21.10.2021 14:00 ehaynie

Suppose a 30-Mbit file is sent from a source host to a destination host. All links in the path between source and destination have a transmission rate of 100 Mbps. The signal propagation speed is 2.5 * 108 meters/sec, and the distance between source and destination is 25,000 km. Calculate the following values. (Your answers should be in the form of integer. fraction, where each part is indicated in minimum possible decimal digits or as 0 as appropriate.) The propagation delay is:

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 21.06.2019 20:00

2.)how does a graphical user interface (gui) on a touchscreen interface differ from a gui on a desktop or laptop? a.)a finger or stylus is used instead of a pointer. b.) a magic wand is used instead of a pointer. c.)users speak commands instead of using a pointer. d.)users visualize commands instead of using a pointer.

Answers: 1

Answer

Computers and Technology, 21.06.2019 23:00

Describe in pseudocode an algorithm that given an integer n and a linked list of elements increases the linked list by a factor of n by replacing each element in the original list with n copies of that element. for example, if l: [18, 7, 4, 24, 11] and n = 3 the resulting list should be l: [18, 18, 18, 7, 7, 7, 4, 4, 4, 24, 24, 24, 11, 11, 11]. if the value of n is less than or equal to 0, the list should be empty after the call. what’s the running time of your algorithm?

Answers: 3

Answer

Computers and Technology, 22.06.2019 10:00

Which of the following is true of operations within a spreadsheet program’s built-in functions? a. operations within parentheses, then multiplication and division, and then addition and subtraction are computed. b. operations within parentheses, then addition and subtraction, and then multiplication and division are computed. c. multiplication and division, then addition and subtraction, and then operations within parentheses are computed. d. addition and subtraction, then multiplication and division, and then operations within parentheses are computed

Answers: 2

Answer

Computers and Technology, 23.06.2019 10:20

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?

Answers: 1

Answer

You know the right answer?

Suppose a 30-Mbit file is sent from a source host to a destination host. All links in the path betwe...

Questions