Deck 8: File Management

Question 1

Sequential record organization is by far the easiest to implement because records are stored and retrieved serially,one after the other.

Answer 1

True

Question 2

If the File Manager is required to provide detailed instructions for each system device (how to start it,get it to move to the correct place where the desired record is located,and when to stop),then the program is considered device dependent.

Answer 2

True

Question 3

A file extension is usually two to four characters in length and is separated from the relative name by a period.

Answer 3

True

Question 4

Within a file,variable-length records are easier to access directly than fixed-length records.

Question 5

Many systems force users to have their files organized for fixed-length records if the records are to be accessed directly.

Question 6

A field is a group of related records that can be identified by the user with a name,type,and size.

Question 7

The File Manager responds to the CREATE command by creating a new file.

Question 8

To support text compression,data in a fixed-length field that includes a short name followed by many blank characters can be replaced with a variable-length field and a special code to indicate how many blanks were truncated.

Question 9

A relative filename is a name that is selected by the File Manager when the file is created.

Question 10

A compressed image file can be reconstructed if a lossy compression algorithm is used because the compression process is reversible.

Question 11

A volume must contain a single file.

Question 12

A subdirectory is created when a user opens an account to access the computer system.

Question 13

In a file management system,information is passed from the Device Manager at the top of the hierarchy to the File Manager at the bottom.

Question 14

When using a contiguous file storage scheme,the File Manager keeps track of empty storage areas by treating them as files.

Question 15

Files cannot be converted from sequential to direct or vice versa.

Question 16

In a file directory tree structure,the "leaves" of the tree are subdirectories created by the user.

Question 17

When a user gives a command to modify the contents of a file,it's actually a command to access folders within the file.

Question 18

An indexed sequential file does not have overflow areas.

Question 19

Directories are special files that contain listings of filenames and their attributes.

Question 20

Although noncontiguous allocation schemes eliminate external storage fragmentation and the need for compaction,they don't support direct access because there's no easy way to determine the exact location of a specific record.

Question 21

When data is stored in fixed length fields,data that extends beyond the fixed size ____.

A) generates an operating system error
B) is truncated
C) is broken up and stored in more than one field
D) combines multiple fields to accommodate the data

Question 22

A UNIX or Linux system might identify a file as: /usr/imfst/flynn/inventory.doc.The first entry is a forward slash ( / )representing the master directory,called the ____ directory.

A) root
B) main
C) branch
D) working

Question 23

Many computer users and some operating systems call subdirectories ____.

A) folders
B) files
C) volumes
D) databases

Question 24

A(n)____ filename is the name that differentiates a file from other files in the same directory.

A) absolute
B) relative
C) short-form
D) directory

Question 25

In noncontiguous storage,one way to link file extents is at the storage level where each extent points to the ____.

A) current subdirectory
B) next file in the sequence
C) master directory entry
D) next extent in the sequence

Question 26

A file's ____ filename includes all path information for that file.

A) extended
B) absolute
C) relative
D) long-form

Question 27

When using indexed sequential record organization,each entry in the index file contains the ____ and the physical location of the data block where this record,and the records with smaller keys,are stored.

A) last record name
B) highest record key
C) lowest record key
D) first record name

Question 28

____ storage allocation allows files to use any storage space available on the disk.

A) Contiguous
B) Noncontiguous
C) Fragmented
D) Extended

Question 29

____ are special files with listings of filenames and their attributes.

A) Databases
B) Directories
C) Programs
D) Data files

Question 30

Each volume in a system has a volume descriptor followed by a ____ that lists the names and characteristics of every file contained in that volume.

A) file location
B) volume directory
C) subdirectory
D) master file directory

Question 31

The formula for computing the current byte address (CBA)for a direct access file with fixed record length is ____.

A) CBA = (RN - 1) * RL
B) CBA = RN * RL
C) CBA = RN / RL
D) CBA = (RN + 1) * RL

Question 32

On magnetic disks,files can be organized in one of three ways: ____.

A) indexed direct, indexed indirect, or random
B) sequential, indirect, or direct
C) sequential, random, or indirect
D) sequential, direct, or indexed sequential

Question 33

Although a user directory is treated as a file,it is flagged to indicate to the File Manager that this file is really a ____ whose records are filenames that point to files.

A) database
B) volume
C) subdirectory
D) master file directory

Question 34

A(n)____ contains a list of files,each of which is associated with the names of users who are allowed to access it and the type of access each user is permitted.

A) access control matrix
B) access control list
C) capability list
D) capability matrix

Question 35

In indexed storage,when a file is created,the pointers in the index block are all set to ____.

A) the end of the volume
B) the beginning of the volume
C) null
D) zero

Question 36

As long as users refer to files in the ____ directory,they can access the files without entering the absolute filename.

A) root
B) main
C) home
D) working

Question 37

The primary disadvantage of contiguous storage is that ____.

A) the file system is difficult to create, implement, and manage
B) a file can be spread in small pieces throughout the storage area
C) a file can't be expanded unless there is empty space available immediately following it
D) the file system cannot support direct access

Question 38

____ text compression builds on the previous data element.The first data element in a list is not compressed but each entry after that takes a given number of characters from the previous entry that they have in common and then adds the characters that make it unique.

A) Repeated-terms
B) Front-end
C) Repeated-characters
D) Lossy

Question 39

The computer system ____ a file by activating the appropriate secondary storage device and loading the file into memory while updating its records of who is using that file.

A) creates
B) formats
C) allocates
D) configures

Question 40

In a direct record organization scheme,the program used to store the data follows a set of instructions,called a ____ algorithm,that transforms each key into a number,the record's logical address.

A) hashing
B) grouping
C) translation
D) lookup