Test 2 Flashcards

1
Q

A synchronization problem between two processes that are vying for the same resource. In some cases, it may result in data corruption because the order in which the processes will finish executing cannot be controlled.

A

Race

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue

A

banker’s Algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

The result of conservative allocation of resources in which a single job is prevented from execution because it is kept waiting for resources that never become available. It is an extreme case of indefinite postponement.

A

Starvation and resources

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

The interface between the operating system, device drivers, and applications that reads and writes to devices connected to the computer through the USB port.

A

USB controller

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

slow: The time required to position the read/write head on the proper track from the time the I/O request is issued

A

Seek time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A scheduling strategy for direct access storage devices that is used to optimize seek time. The track requests are ordered so that the one closest to the currently active track is satisfied first and the ones farthest away are made to wait.

A

Shortest Seek Time First

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A device that uses a laser beam to read and/or write information on optical discs

A

Optical disc drive

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Blue ray disc formats

A

BD-R discs are write-only and BD-RE are rewriteable.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The temporary storage areas residing in main memory, channels, and control units. They are used to store data read from an input device before it is needed by the processor, and to store data that will be written to an output device.

A

Buffers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A logical storage unit that contains files.

A

Directories

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Any secondary storage unit, such as hard disks, CDs, DVDs, flash drives, or other removable media. When a volume contains several files, it is called a multi-file volume. When a file is extremely large and contained in several volumes it is called a multi-volume file.

A

Volume

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

A file’s shortest name and extension as given by the user without the inclusion of paths.

A

Relative filename

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A record that isn’t of uniform length, doesn’t leave empty storage space, and doesn’t truncate any characters, thus eliminating the two disadvantages of fixed-length records.

A

Variable-length records

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A record that always contains the same number of characters.

A

Fixed-length records

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A type of file storage in which all the information is stored in adjacent locations in a storage medium.

A

Contiguous file storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Compression that results in lost data and quality from the original version

A

Lossy compression

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

A computing system used in time-critical environments that require guaranteed response times, such as in navigation, rapid transit, and industrial control systems.

A

Real-time systems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

One of four conditions that results in deadlock in which only one process is allowed to have access to a resource

A

Mutual exclusion

19
Q

Came up with Directed Graph.

A

Holt

20
Q

Came up with Banker’s Algorithm.

A

Dijkstra

21
Q

The strategy of deadlock avoidance. It is a dynamic strategy, attempting to ensure that resources are never allocated in such a way as to place a system in an unsafe state.

A

Avoidance policy

22
Q

Shut everything down and restart, terminate programs.

A

Deadlock recovery methods

23
Q

A queuing policy used to ensure that jobs that have languished in the system for a long time in the lower-level queues will eventually complete their execution.

A

Aging

24
Q

Bytes per inch

A

Density of tape

25
Q

An algorithm used to reorder record requests within tracks to optimize search time

A

Rotational ordering

26
Q

A subdivision of a track on a magnetic disk or optical disc. Stores a fixed amount of user-accessible data, traditionally 512 bytes for hard disk drives and 2048 bytes for CD-ROMs and DVD-ROMs. Newer HDDs use 4096-byte sectors, which are known as the Advanced Format

A

Optical disc sector

27
Q

Tiny depressions on the reflective layer of an optical disc.

A

Pits

28
Q

A type of nonvolatile memory used as a secondary storage device that can be erased and reprogrammed in blocks of data.

A

Flash memory

29
Q

A data structure that contains information indicating the condition of the channel, including three bits for the three components of the I/O subsystem—one each for the channel, control unit, and device.

A

Channel Status Word

30
Q

Activate secondary storage device and load into memory.

A

Allocating a file

31
Q

A file stored immediately after the volume descriptor. It lists the names and characteristics of every file contained in that volume

A

Master file directory

32
Q

A file’s name preceded by the directory (or directories) where the file is found and, when necessary, the specific device or volume label.

A

Absolute filename

33
Q

The device must move through all information up to the location where it is attempting to read or write.

A

Sequential access

34
Q

Allows the program to read and write record rapidly. in no particular order.

A

Direct access

35
Q

A way of organizing data in a direct access storage device. An index is created to show where the data records are stored. Any data record can be retrieved by consulting the index first.

A

Indexed sequential access

36
Q

A type of file storage in which the information is stored in non-adjacent locations in a storage medium. Data records can be accessed directly by computing their relative addresses.

A

Noncontiguous storage allocation

37
Q

The way in which the File Manager physically allocates space to an indexed sequentially organized file.

A

Indexed storage pointers

38
Q

A security control method that lists each file, the names of the users who are allowed to access it, and the type of access each is permitted

A

Access control list

39
Q

(1) for a disk, it is the directory accessed by default when booting up the computer; (2) for a hierarchical directory structure, it is the first directory accessed by a user.

A

Root directory

40
Q

In noncontiguous storage, file extents point to each storage.

A

File extents

41
Q

controls information of a system. Communicates with multiple things.

A

Disk drive interfaces

42
Q

An error-detecting and error-correcting code that greatly improves the reliability of data, named after mathematician Richard Hamming.

A

Hamming code

43
Q

Flat surface areas on the reflective layer of an optical disc.

A

Lands