WorksheetsChapter 11: File Systems and Directories
Total questions: 33
Worksheet time: 31mins
A text file stores binary data that is organized into groups of 8 or 16 bits that are interpreted as characters.
True
False
A program written in a high-level language is stored in a text file that is also called a source file.
True
False
The type of a file determines which kinds of operations can be performed on it.
True
False
The current file pointer indicates the end of a file.
True
False
Sequential access and direct access take the same amount of time to retrieve data.
True
False
Some operating systems maintain a separate read pointer and write pointer for a file.
True
False
UNIX file permissions allow a group of users to access a file in various ways.
True
False
In most operating systems, a directory is represented as a file.
True
False
Two files in a directory system can have the same name if they are in different directories.
True
False
A relative path is relative to the root of the directory hierarchy.
True
False
An absolute path and a relative path will always be the same length.
False
True
A operating system is responsible for managing the access to a disk drive.
False
True
The seek time is the amount of time it takes for the heads of a disk to reach a particular cylinder.
True
False
The shortest-seek-time-first disk scheduling algorithm moves the heads the minimum amount it can to satisfy a pending request.
False
True
The first-come, first-served disk scheduling algorithm moves the heads the minimum amount it can to satisfy a pending request.
False
True
Match the file extension with the appropriate file
Audio File
mp3, au, and wav
Image File
gif, tiff, and jpg
Program Source File
java, c, and cpp
Word Processing File
doc and wp3
Text Data File
txt
Match the symbol with its use.
Symbol used to separate the names in a path Windows environment
\
Symbol used to separate the names in a path in a UNIX environment
/
Symbol used to represent the parent directory in a relative path names.
. .
Match the following
The directory containing another directory
Parent directory
A directory inside another directory
Subdirectory
A program written in high level languages is stored as a text file, which is referred to as
Source file
(a) is the operating system's logical view of the files it manages.
(b) is a named group of file.
A file the contains characters is called (c) .
A file that contains data in a specific format, requiring special interpretation of it bits, is called (d) .
(e) is a named collection of data, used for organizing secondary memory.
The specific kind of information contained in a file, such as a Java program or a Microsoft Word document is called (a) .
(b) is part of a file name that indicates the file type.
The technique in which data in a file is accessed in a linear fashion is called (c) .
The technique in which data in a file is accessed directly by specifying logical record numbers is called (d) .
(e) is a structure showing the nested directory organization of the file system.
The topmost directory, in which all others are contained is called (a) .
The currently active subdirectory is called the (b) .
(c) is a text designation of the location of a file or subdirectory in a file system.
(a) is a path that begins at the root and includes all successive subdirectories.
The act of deciding which outstanding requests for a disk I/O to satisfy first is called (b) .
(c) is a path that begins at the current working directory.
What operations can a user perform to and with a file?
Create a file
Reposition the current file pointer in a file
All of these
Truncate a file
Match the following
Disk scheduling algorithm moves the heads by the minimum amount necessary to satisfy any pending request.
Shortest-Seek-Time-First Disk Scheduling
Disk scheduling technique where the requests are processed in the order they arrive, without regards to the current position of the heads.
First-Come, First-Served Disk Scheduling
Disk scheduling algorithm where the read/write heads in toward the spindle, then out toward the platter edge, then back towards the spindle, and so forth. Services the requests as appropriate.
SCAN Disk Scheduling
What is the set of corresponding tracks on all platters called? (do not capitalize)
(a)
In Shortes-Seek-Time-First disk scheduling, lets suppose requests for cylinders continue to build up while existing ones are being satisfied. Also, suppose that new requests are always closer to the current position than an earlier request and those requests are getting processed before the earlier requests. What is this called? (do not capitalize)
(a)
Supposing the following cylinder requests have been made, in this order: 94, 16, 23, 8, 35. Also, suppose that the read/write heads are currently at cylinder 26. What order will the requests be processed under First-Come, First-Served Disk Scheduling?
94
16
23
8
35
Supposing the following cylinder requests have been made, in this order: 94, 16, 23, 8, 35. Also, suppose that the read/write heads are currently at cylinder 26. What order will the requests be processed under Shortest-Seek-Time-First Disk Scheduling?
23
16
8
35
94
Supposing the following cylinder requests have been made, in this order: 94, 16, 23, 8, 35. Also, suppose that the read/write heads are currently at cylinder 26, moving towards cylinder 1. What order will the requests be processed under SCAN Disk Scheduling?
23
16
8
35
94
(a) is the amount of time it takes for the heads to reach the appropriate cylinder.
(b) is the additional time it takes the platter to rotate in to the proper position so that the data can be read or written
The root directory for Microsoft Windows is (a) .
The root directory for UNIX is (b) .
Is the following path an example of an absolute path?
C:\My Documents\letters\applications\vaTech.doc
False
True
Is the following an example of a relative path?
C:\My Documents\letters\applications\vaTech.doc
True
False
