The Message

USE ANY COMPUTER LANGUAGE to write the message "this is page 1" on page one, the message "this is page 2" on page 2, and so on until the message "this is page 7" is written to page 7. Center the messages on the pages, in exactly the same place. Have the program then alternate the messages and determine if you can detect the fact that each message is rewritten. Have the program terminate and return to DOS when the q key is pressed. Amplification: The words "this is page 1, 2, ...7 is written on the pages as numbering is in a book. Instead of just listing the page number, the phrase "this is page 1, 2,...7 must be written on each page.

Database & Sequential File Processing

I need to know the best way to answer these questions. I've read the chapters and am clueless to computers. Please provide examples. The book looks like jargon. Thanks. 1. Sequential File Processing: Give a brief definition of sequential file processing. Develop an example to illustrate your definition. (The example does not have to be as elaborate. Just a record with a simple explanation) Describe where sequential file processing might be used. Discuss the advantages and disadvantages of sequential file processing. 2. Database Processing: Give a brief definition of database processing. Develop an example to illustrate you definition. (The example does... click for more

process states

Please provide insight regarding the attached diagram and questions. Please provide references. Please explain the concept of process states and how you draw your conclusions for the three questions. --- The following diagram indicates process states. The arrows between the boxes indicate state transitions. (See attachment for diagram) a) For each transition, describe an event that could cause it b) Why is there no arrow from the wait to the running state? c) Why is there no arrow from the ready to the wait state? --- (See attached file for full problem description)

File space

Consider a disk holding files with an average file length of 5 KB. Each file is allocated contiguously on adjacent sectors. To better utilize the disk space, it must be periodically compacted, which involves reading each file sequentially and writing it back to a new location. Assuming the standard sector size of 512, an average seek time of 50 ms, 100 sectors per track, and a rotational speed of 5000 rpm, estimate, how long it will take to move 1000 files~?

Multiprogrammed systems

In most multiprogrammed systems, user programs access memory through virtual addresses, while the operating systems uses raw physical addresses to access memory. What are the implications of this design on the initiation of I/O operations by the user program and their execution by the operating system? Please provide a detailed explanation and include all references.