Explore BrainMass
Share

# Data

### Hard Disk Access

A certain hard disk has 480 cylinders, 16 tracks, and 32 sectors of 512 bytes each. It spins at 4800 revolutions per minute, and has an adjacent cylinder seek time of 80 msec, and a max seek time of 100 msec. Switching between tracks in the same cylinder is instantaneous. Use this information to answer the following 4 questions.

### Functions of the Different Layers of the ISO-OSI

Briefly, what are the functions different layers of the International Standards Organization-Open Systems Interconnection (ISO-OSI) model?

### Edges and Graphs Cut Offs

The solution below got cut off. Please let me know what is the total solution: <b>problem:</b> The number of strongly connected components in a graph G is k. By how much can this number change if we add a new edge? <b>solution:</b> If we add an edge to a biconnected graph with k strongly connected components, then the

### Edges and graphs

The number of strongly connected components in a graph G is k. By how much can this number change if we add a new edge?

### UML notation solutions

1. The package on the left contains the classes in a payroll system. The package on the right is a payroll tax subsystem. a. What technique would you use to integrate the tax subsystem into the payroll system? b. Show how you would solve the problem. c. Show what modifications you would make to the existing classes or what

### transmission efficiency of the High-Speed Digital Transmission System

Suppose I have a multiplexer that is connected to a high-speed digital transmission system that can transfer 1,536,000 information bits per second. How many standard voice channels is the high-speed transmission system capable of carrying and how do you figure this out? What is the transmission efficiency of t

### Recurrence Running Time

Give asymptotic upper and lower running time bounds for T(n) for each of the recurrences. Assume that T(n) is constant for n <= 2. Make bounds as tight as possible, and justify solutions. a) T(n) = 2*T(n/2) + n^3 b) T(n) = T(9n/10) + n c) T(n) = 16*T(n/4)+n^2 d) T(n) = 7*T(n/3) + n^2 e) T(n) = 7*T(n/2) + n^2

### Excel S4-R1 Copy Worksheet

Excel S4-R1 Copy the Week 2 worksheet, positioning the new sheet after Week 3. 2. Rename the Week2 (2) worksheet as Week 4. 3. Delete the Week 3 worksheet 4. Copy the Week 2 worksheet, positioning the new sheet between Week 2 and Week 4. 5. Rename the Week2 (2) worksheet as Week3. 6. Insert a new worksheet positioned bef

### Inventory Units Purchase Reports

1. Dana Hirsch, manager of The Waterfront Bistro, has asked you to review the Inventory Units Purchased report and modify it to make it more readable and to view as much data as possible in one window. 2. Make the following changes: a. Freeze panes so you can scroll the worksheet without losing the column and row headings.

### Protocol should take into account the following situations: Messages

Design and describe an application-level protocol to be used between an automatic teller machine and a bank's centralized computer. Your protocol should allow a user's card and password to be verified, the account balance (which is maintained at the centralized computer) to be queried, and an account withdrawal to be made (that

### Comp Sci

1. Use Run-Length encoding to compress the following: 00110 00000 00000 10001 Note: Two different approaches to run length encoding were presented. You may use either approach for this problem. 2. Using front-end compression to reduce the data storage requirements for the following list. Uncompressed Compressed

### Order of Complexity Proof

Prove: f(n) + g(n) = θ(f(n)) if g(n) = o(f(n))

### Interchange Contents of Working Registers

Create a stack at 1000h. Use the stack to interchange the contents of all of the working registers. Exchange AX with DX, BX with CX, and DI with SI. Use unique data for each register to test the program.

### IT System of Any Company

Create a chart that shows the breakdown of the overall (big picture) IT systems at a big (any) company or breakdown a particular aspect of the IT systems such as the network or the business applications systems.

### Pure Aloha Question

A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a 1000-bit frame on an average of once every 100 secs, even if the previous one has not yet been sent (stations are buffered). What is the maximum value of N?

### Selective-Reject ARQ Systems

Consider a selective-reject ARQ system with a window size of 3. a) Circle (or shade or bold) the sender window after frames 0 through 3 have been sent and ACK 2 has been received 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 b) Circle (or shade or bold) the sender windows after frames 4 through 6 have been transmitted, ACK 5 and N

### Excel 3 questions

Please see attached excel sheet for div sheets. 1.In the Sales by Div sheet, only the Qtr subtotals should be displayed, Do not show the details. 2.In Totals & Averages sheet, please add average shown as belowPlease refer to word for questions and make correction to excel sheet. 3.In column C of the Div Awards sheet,

### INTRODUCTION TO mANAGEMENT

I LIKE THE HELP OF AN OTA PLEASE. The Fastgro Fertilizer Company distributes fertilizer to various lawn and garden shops. The company must base its quarterly production schedule on a forecast of how many tons of fertilizer will be demand from it. The company has gathered the following data for the past three years from its sale

### Hand Held Video Game

I need to design a control unit for a simple hand held video game in which a character on the display catches objects. I only need to show the transition diagram...NOT A CIRCUIT! The input to the control unit is a two-bit vector in which 00 means "move left", 01 means "move right", 10 means "do not move" and 11 means "halt."

### Adding five bit two's complement numbers

I need to show the results of adding the following pairs of five-bit(i.e., one sign bit and four data bits) two's complement numbers and indicate whether or not overflow occurs for each case a. 10110 + 10111 = b. 11110 + 11101 = c. 11111 + 01111 = Thanks so much!