Deck 11: File Systems and Directories
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/49
Play
Full screen (f)
Deck 11: File Systems and Directories
1
Which of the following is the last part of the file name that gives an indication of what kind of data the file contains?
A) File name
B) File type
C) File system
D) File extension
E) Directory
A) File name
B) File type
C) File system
D) File extension
E) Directory
D
2
Which of the following is conceptually divided into logical records?
A) Binary file
B) Direct access file
C) Sequential access file
D) Text file
E) Directory
A) Binary file
B) Direct access file
C) Sequential access file
D) Text file
E) Directory
B
3
Which of the following shows the hierarchical organization of the file system?
A) Working directory
B) Directory tree
C) Root directory
D) Relative path
E) Absolute path
A) Working directory
B) Directory tree
C) Root directory
D) Relative path
E) Absolute path
B
4
Which of the following processes disk requests in the order in which they arrive?
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
5
Which of the following specifies a file or directory beginning with the current working directory?
A) Working directory
B) Directory tree
C) Root directory
D) Relative path
E) Absolute path
A) Working directory
B) Directory tree
C) Root directory
D) Relative path
E) Absolute path
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
6
The ˙gif, ˙tiff, and ˙jpg file extensions are generally used for which of the following?
A) Text data file
B) Audio file
C) Image file
D) Word processing document
E) Program source file
A) Text data file
B) Audio file
C) Image file
D) Word processing document
E) Program source file
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
7
A file system is the logical view of secondary memory that the operating system provides for the user.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
8
A file's extension dictates what type of data it contains.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
9
The SCAN disk-scheduling algorithm is similar to the algorithm used to manage elevators.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
10
As one moves around in the file system of an operating system, the current working directory remains the same.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
11
A(n) _______________ visualizes directories and subdirectories as a hierarchy.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
12
A file with _______________ access treats the file as a linear structure.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
13
Files with _______________ access have fast retrieval speeds, but are more complicated to implement.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
14
A file's _______________ is a text designation of the location of the file within the file system.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
15
The _______________ disk-scheduling algorithm moves the read/write heads the minimum amount necessary to satisfy any pending request.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
16
_______________ is the act of deciding which outstanding requests for disk I/O to satisfy first.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
17
What is a directory?
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
18
What is a subdirectory?
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
19
What is a disk cylinder?
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
20
Describe first-come, first-served (FCFS) disk scheduling.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
21
Which of the following is the logical view provided by the operating system to help users manage secondary memory?
A) File name
B) File type
C) File system
D) File extension
E) Directory
A) File name
B) File type
C) File system
D) File extension
E) Directory
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
22
The .txt file extension is generally used for which of the following?
A) Text data file
B) Audio file
C) Image file
D) Word processing document
E) Program source file
A) Text data file
B) Audio file
C) Image file
D) Word processing document
E) Program source file
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
23
Which of the following is the topmost directory, in which all others are contained?
A) Working directory
B) Directory tree
C) Root directory
D) Relative path
E) Absolute path
A) Working directory
B) Directory tree
C) Root directory
D) Relative path
E) Absolute path
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
24
Which of the following uses an elevator-like algorithm to service disk requests as it moves the heads from one extreme to the other?
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
25
Which of the following describes the amount of time it takes to move the read/write heads to the appropriate cylinder?
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
26
Which of the following begins at the root and specifies each step down the tree until it reaches the desired file or directory?
A) Working directory
B) Subdirectory
C) Parent directory
D) Relative path
E) Absolute path
A) Working directory
B) Subdirectory
C) Parent directory
D) Relative path
E) Absolute path
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
27
Which of the following is a disk-scheduling algorithm that moves disks heads by the minimum amount necessary to satisfy any pending request?
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
28
A file is a named collection of directories.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
29
A text file contains bytes of data that represent characters from a particular character set such as ASCII or Unicode.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
30
A relative path begins at the root of the directory tree.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
31
The working directory is the directory into which all temporary files are stored.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
32
First-come, first-served disk scheduling is relatively easy to implement, but is not the most efficient approach.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
33
At any point in time, a user is "in" the current working directory within the file system.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
34
Regarding magnetic disk drives, latency is the additional time it takes the platter to rotate into the proper position so that the data can be read or written.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
35
Which of the following is a named group of files?
A) File name
B) File type
C) File system
D) File extension
E) Directory
A) File name
B) File type
C) File system
D) File extension
E) Directory
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
36
Which of the following contains bits organized into groups of 8 or 16 that represent characters from a character set?
A) Binary file
B) Direct access file
C) Sequential access file
D) Text file
E) Directory
A) Binary file
B) Direct access file
C) Sequential access file
D) Text file
E) Directory
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
37
Which of the following specifies a file or directory beginning with the root directory?
A) Working directory
B) Directory tree
C) Relative path
D) Absolute path
A) Working directory
B) Directory tree
C) Relative path
D) Absolute path
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
38
In which disk-scheduling algorithm could starvation occur?
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
A) First-come, first-served
B) SCAN
C) Shortest-seek-time-first
D) Latency
E) Seek time
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
39
From the user's perspective, a file is the smallest amount of data that can be written to secondary memory.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
40
An absolute path begins at the current working directory.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
41
A disk-scheduling algorithm determines how the outstanding requests for disk access will be satisfied.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
42
A user's ability to perform certain operations on a file depend on the permissions that user has been granted.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
43
Most operating systems allow the user to specify a set of paths that are searched in a specific order to help resolve references to executable programs.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
44
A(n) _______________ is a named collection of related data.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
45
Files are often grouped into _______________ to help organize and manage them.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
46
A(n) _______________ path name begins from the current working directory.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
47
The _______________ disk-scheduling algorithm moves the disk heads from one extreme to the other, processing any outstanding requests as it reaches the appropriate cylinder.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
48
In a UNIX operating system, a file's protection settings are divided into three categories: Owner, Group, and _______________.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck
49
A word processing file is not a simple _______________ because in addition to characters it often contains data related to formatting, color, and graphics.
Unlock Deck
Unlock for access to all 49 flashcards in this deck.
Unlock Deck
k this deck