Operating System MCQ (Multiple Choice Questions) - SchoolingAxis

Operating System MCQ (Multiple Choice Questions)

 Que- The information about all files is kept in : 

a. swap space 

b. operating system 

c. seperate directory structure 

d. none of the mentioned 


Answer- seperate directory structure        


Que- A file is a/an _______ data type. 

a. abstract 

b. primitive 

c. public 

d. private 


Answer- abstract        


Que- The operating system keeps a small table containing information about all open files called : 

a. system table 

b. open-file table 

c. file table 

d. directory table 


Answer- open-file table        


Que- In UNIX, the open system call returns : 

a. pointer to the entry in the open file table 

b. pointer to the entry in the system wide table 

c. a file to the process calling it 

d. none of the mentioned 


Answer- pointer to the entry in the open file table        


Que- System wide table in UNIX contains process independent information such as : 

a. location of file on disk 

b. access dates 

c. file size 

d. all of the mentioned 


Answer- all of the mentioned        


Que- The open file table has a/an _______ associated with each file. 

a. file content 

b. file permission 

c. open count 

d. close count 


Answer- open count        


Que- The file name is generally split into two parts : 

a. name & identifier 

b. identifier & type 

c. extension & name 

d. type & extension 


Answer- extension & name        


Que- To organise file systems on disk, : 

a. they are split into one or more partitions 

b. information about files is added to each partition 

c. they are made on different storage spaces 

d. all of the mentioned 


Answer- information about files is added to each partition        


Que- The directory can be viewed as a _________ that translates file names into their directory entries. 

a. symbol table 

b. partition 

c. swap space 

d. cache 


Answer- symbol table        


Que- In the single level directory : 

a. All files are contained in different directories all at the same level 

b. All files are contained in the same directory 

c. Depends on the operating system 

d. None of the mentioned 


Answer- All files are contained in the same directory        


Que- In the single level directory : 

a. all directories must have unique names 

b. all files must have unique names 

c. all files must have unique owners 

d. all of the mentioned 


Answer- all files must have unique names        


Que- In the two level directory structure : 

a. each user has his/her own user file directory 

b. the system doesn't its own master file directory 

c. all of the mentioned 

d. none of the mentioned 


Answer- each user has his/her own user file directory        


Que- When a user job starts in a two level directory system, or a user logs in : 

a. the users user file directory is searched 

b. the system's master file directory is not searched 

c. the master file directory is indexed by user name or account number, and each entry points to the UFD for that user 

d. all of the mentioned 


Answer- the master file directory is indexed by user name or account number, and each entry points to the UFD for that user        


Que- When a user refers to particular file : 

a. system MFD is searched 

b. his own UFD is not searched 

c. both MFD and UFD are searched 

d. every directory is searched 


Answer- both MFD and UFD are searched        


Que- The disadvantage of the two level directory structure is that : 

a. it does not solve the name collision problem 

b. it solves the name collision problem 

c. it does not isolate users from one another 

d. it isolates users from one another 


Answer- it isolates users from one another        


Que- In the tree structured directories, 

a. the tree has the stem directory 

b. the tree has the leaf directory 

c. the tree has the root directory 

d. all of the mentioned 


Answer- the tree has the root directory        


Que- The current directory contains, most of the files that are : 

a. of current interest to the user 

b. stored currently in the system 

c. not used in the system 

d. not of current interest to the system 


Answer- of current interest to the user        


Que- An absolute path name begins at the : 

a. leaf 

b. stem 

c. current directory 

d. root 


Answer- root        


Que- A relative path name begins at the : 

a. leaf 

b. stem 

c. current directory 

d. root 


Answer- current directory        


Que- In tree structure, when deleting a directory that is not empty : 

a. The contents of the directory are safe 

b. The contents of the directory are also deleted 

c. contents of the directory are not deleted 

d. none of the mentioned 


Answer- The contents of the directory are also deleted        


Que- When two users keep a subdirectory in their own directories, the structure being referred to is : 

a. tree structure 

b. cyclic graph directory structure 

c. two level directory structure 

d. acyclic graph directory 


Answer- acyclic graph directory        


Que- A tree structure ______ the sharing of files and directories. 

a. allows 

b. may restrict 

c. restricts 

d. none of the mentioned 


Answer- restricts        


Que- With a shared file : 

a. actual file exists 

b. there are two copies of the file 

c. the changes made by one person are not reflected to the other 

d. the changes made by one person are reflected to the other 


Answer- the changes made by one person are reflected to the other        


Que- In UNIX, a link is : 

a. a directory entry 

b. a pointer to another file or subdirectory 

c. implemented as an absolute or relative path name 

d. all of the mentioned 


Answer- all of the mentioned        


Que- The operating system _______ the links when traversing directory trees, to preserve the acyclic structure of the system. 

a. considers 

b. ignores 

c. deletes 

d. none of the mentioned 


Answer- ignores        


Que- The deletion of a link, ________ the original file. 

a. deletes 

b. affects 

c. does not affect 

d. none of the mentioned 


Answer- does not affect        


Que- When keeping a list of all the links/references to a file, and the list is empty, implies that : 

a. the file has no copies 

b. the file is deleted 

c. the file is hidden 

d. none of the mentioned 


Answer- the file is deleted        


Que- When a cycle exists, the reference count maybe non zero, even when it is no longer possible to refer to a directory or file, due to _______ 

a. the possibility of one hidden reference 

b. the possibility of two hidden references 

c. the possibility of self referencing 

d. none of the mentioned 


Answer- the possibility of self referencing        


Que- A mount point is : 

a. an empty directory at which the mounted file system will be attached 

b. a location where every time file systems are mounted 

c. is the time when the mounting is done 

d. none of the mentioned 


Answer- an empty directory at which the mounted file system will be attached        


Que- When a file system is mounted over a directory that is not empty : 

a. the system may not allow the mount 

b. the system must allow the mount 

c. the system may allow the mount and the directory's existing files will then be made obscure 

d. all of the mentioned 


Answer- the system may allow the mount and the directory's existing files will then be made obscure        


Que- In UNIX, exactly which operations can be executed by group members and other users is definable by : 

a. the group's head 

b. the file's owner 

c. the file's permissions 

d. all of the mentioned 


Answer- the file's owner        


Que- A process _____ lower the priority of another process, if both are owned by the same owner. 

a. must 

b. can 

c. cannot 

d. none of the mentioned 


Answer- can        


Que- In distributed file system, ______ directories are visible from the local machine. 

a. protected 

b. local 

c. private 

d. remote 


Answer- remote        


Que- In the world wide web, a ____ is needed to gain access to the remote files, and separate operations are used to transfer files. 

a. laptop 

b. plugin 

c. browser 

d. player 


Answer- browser        


Que- Anonymous access allows a user to transfer files : 

a. without having an account on the remote system 

b. only if he accesses the system with a guest account 

c. only if he has an account on the remote system 

d. none of the mentioned 


Answer- without having an account on the remote system        


Que- The machine containing the files is the _______ and the machine wanting to access the files is the ______ 

a. master, slave 

b. memory, user 

c. server, client 

d. none of the mentioned 


Answer- server, client        


Que- Distributed naming services/Distributed information systems have been devised to : 

a. provide information about all the systems 

b. provide unified access to the information needed for remote computing 

c. provide unique names to all systems in a network 

d. all of the mentioned 


Answer- provide unified access to the information needed for remote computing        


Que- Domain name system provides : 

a. host-name-to-network-address translations for the entire internet 

b. network-address-to-host-name translations for the entire internet 

c. binary to hex translations for the entire internet 

d. all of the mentioned 


Answer- host-name-to-network-address translations for the entire internet        


Que- To recover from failures in the network operations, ______ information may be maintained. 

a. ip address 

b. state 

c. stateless 

d. operating system 


Answer- state        


Que- The series of accesses between the open and close operations is a : 

a. transaction 

b. procedure 

c. program 

d. file session 


Answer- file session        


Que- Reliability of files can be increased by : 

a. keeping the files safely in the memory 

b. making a different partition for the files 

c. by keeping them in external storage 

d. by keeping duplicate copies of the file 


Answer- by keeping duplicate copies of the file        


Que- Protection is only provided at the _____ level. 

a. lower 

b. central 

c. higher 

d. none of the mentioned 


Answer- lower        


Que- The main problem with access control lists is : 

a. their maintenance 

b. their length 

c. their permissions 

d. all of the mentioned 


Answer- their length        


Que- Many systems recognize three classifications of users in connection with each file (to condense the access control list) : 

a. Owner 

b. Group 

c. Universe 

d. All of the mentioned 


Answer- All of the mentioned        


Que- All users in a group get _______ access to a file. 

a. different 

b. similar 

c. same 

d. none of the mentioned 


Answer- similar        


Que- Universe consists of : 

a. all users that aren't included in the group or owners 

b. all users that are not owners 

c. all users in the system 

d. none of the mentioned 


Answer- all users in the system        


Que- In UNIX, groups can be created and modified by : 

a. superuser 

b. any user 

c. a programmer only 

d. the people in the group only 


Answer- superuser        


Que- To control access the three bits used in UNIX are represented by : 

a. r 

b. w 

c. x 

d. all of the mentioned 


Answer- all of the mentioned        


Que- If each access to a file is controlled by a password, then the disadvantage is that : 

a. user will need to remember a lot of passwords 

b. it is not reliable 

c. it is not efficient 

d. all of the mentioned 


Answer- user will need to remember a lot of passwords        


Que- In a multi level directory structure : 

a. the same previous techniques will be used as in the other structures 

b. a mechanism for directory protection will have to applied 

c. the subdirectories do not need protection once the directory is protected 

d. none of the mentioned 


Answer- a mechanism for directory protection will have to applied        


Que- In UNIX, the directory protection is handled _________ to the file protection. 

a. different 

b. similar 

c. it is not handled at all 

d. none of the mentioned 


Answer- similar        


Que- Disks are segmented into one or more partitions, each containing a file system or ______ 

a. left 'raw' 

b. made into swap space 

c. made into backup space 

d. left 'ripe' 


Answer- left 'raw'        


Que- The three major methods of allocating disk space that are in wide use are : 

a. contiguous 

b. linked 

c. indexed 

d. all of the mentioned 


Answer- all of the mentioned        


Que- In contiguous allocation : 

a. each file must occupy a set of contiguous blocks on the disk 

b. each file is a linked list of disk blocks 

c. all the pointers to scattered blocks are placed together in one location 

d. none of the mentioned 


Answer- each file must occupy a set of contiguous blocks on the disk        


Que- In linked allocation : 

a. each file must occupy a set of contiguous blocks on the disk 

b. each file is a linked list of disk blocks 

c. all the pointers to scattered blocks are placed together in one location 

d. none of the mentioned 


Answer- each file is a linked list of disk blocks        


Que- In indexed allocation : 

a. each file must occupy a set of contiguous blocks on the disk 

b. each file is a linked list of disk blocks 

c. all the pointers to scattered blocks are placed together in one location 

d. none of the mentioned 


Answer- all the pointers to scattered blocks are placed together in one location        


Que- On systems where there are multiple operating system, the decision to load a particular one is done by : 

a. boot loader 

b. bootstrap 

c. process control block 

d. file control block 


Answer- boot loader        


Que- The VFS (virtual file system) activates file system specific operations to handle local requests according to their _______ 

a. size 

b. commands 

c. timings 

d. file system types 


Answer- file system types        


Que- The real disadvantage of a linear list of directory entries is the : 

a. size of the linear list in memory 

b. linear search to find a file 

c. it is not reliable 

d. all of the mentioned 


Answer- linear search to find a file        


Que- Contiguous allocation of a file is defined by : 

a. disk address of the first block & length 

b. length & size of the block 

c. size of the block 

d. total size of the file 


Answer- disk address of the first block & length        


Que- One difficulty of contiguous allocation is : 

a. finding space for a new file 

b. inefficient 

c. costly 

d. time taking 


Answer- finding space for a new file        


Que- _______ and ________ are the most common strategies used to select a free hole from the set of available holes. 

a. First fit, Best fit 

b. Worst fit, First fit 

c. Best fit, Worst fit 

d. None of the mentioned 


Answer- First fit, Best fit        


Que- The first fit and best fit algorithms suffer from : 

a. internal fragmentation 

b. external fragmentation 

c. starvation 

d. all of the mentioned 


Answer- external fragmentation        


Que- To solve the problem of external fragmentation, ________ needs to be done periodically. 

a. compaction 

b. check 

c. formatting 

d. replacing memory 


Answer- compaction        


Que- If too little space is allocated to a file 

a. the file will not work 

b. there will not be any space for the data, as the FCB takes it all 

c. the file cannot be extended 

d. the file cannot be opened 


Answer- the file cannot be extended        


Que- A device driver can be thought of as a translator. Its input consists of _____ commands and output consists of _______ instructions. 

a. high level, low level 

b. low level, high level 

c. complex, simple 

d. low level, complex 


Answer- high level, low level        


Que- The file organization module knows about : 

a. files 

b. logical blocks of files 

c. physical blocks of files 

d. all of the mentioned 


Answer- all of the mentioned        


Que- Metadata includes : 

a. all of the file system structure 

b. contents of files 

c. both file system structure and contents of files 

d. none of the mentioned 


Answer- both file system structure and contents of files        


Que- For each file there exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents. 

a. metadata 

b. file control block 

c. process control block 

d. all of the mentioned 


Answer- file control block        


Que- For processes to request access to file contents, they need to : 

a. they need to run a seperate program 

b. they need special interrupts 

c. implement the open and close system calls 

d. none of the mentioned 


Answer- implement the open and close system calls        


Que- During compaction time, other normal system operations _______ be permitted. 

a. can 

b. cannot 

c. is 

d. none of the mentioned 


Answer- cannot        


Que- When in contiguous allocation the space cannot be extended easily : 

a. the contents of the file have to be copied to a new space, a larger hole 

b. the file gets destroyed 

c. the file will get formatted and lost all its data 

d. none of the mentioned 


Answer- the contents of the file have to be copied to a new space, a larger hole        


Que- In the linked allocation, the directory contains a pointer to the :I. first blockII. last block 

a. I only 

b. II only 

c. Both I and II 

d. Neither I nor II 


Answer- Both I and II        


Que- There is no __________ with linked allocation. 

a. internal fragmentation 

b. external fragmentation 

c. starvation 

d. all of the mentioned 


Answer- external fragmentation        


Que- The major disadvantage with linked allocation is that : 

a. internal fragmentation 

b. external fragmentation 

c. there is no sequential access 

d. there is only sequential access 


Answer- there is only sequential access        


Que- If a pointer is lost or damaged in a linked allocation : 

a. the entire file could get damaged 

b. only a part of the file would be affected 

c. there would not be any problems 

d. none of the mentioned 


Answer- the entire file could get damaged        


Que- FAT stands for : 

a. File Attribute Transport 

b. File Allocation Table 

c. Fork At Time 

d. None of the mentioned 


Answer- File Allocation Table        


Que- By using FAT, random access time is __________ 

a. the same 

b. increased 

c. decreased 

d. not affected 


Answer- decreased        


Que- A better way of contiguous allocation to extend the file size is : 

a. adding an extent (another chunk of contiguous space) 

b. adding an index table to the first contiguous block 

c. adding pointers into the first contiguous block 

d. none of the mentioned 


Answer- adding an extent (another chunk of contiguous space)        


Que- If the extents are too large, then the problem that comes in is : 

a. internal fragmentation 

b. external fragmentation 

c. starvation 

d. all of the mentioned 


Answer- internal fragmentation        


Que- The FAT is used much as a _________ 

a. stack 

b. linked list 

c. data 

d. pointer 


Answer- linked list        


Que- A section of disk at the beginning of each partition is set aside to contain the table in : 

a. fat 

b. linked allocation 

c. hashed allocation 

d. indexed allocation 


Answer- fat        


Que- Contiguous allocation has two problems _________ and _________ that linked allocation solves. 

a. external - fragmentation & size - declaration 

b. internal - fragmentation & external - fragmentation 

c. size - declaration & internal - fragmentation 

d. memory - allocation & size - declaration 


Answer- external - fragmentation & size - declaration        


Que- Each _______ has its own index block. 

a. partition 

b. address 

c. file 

d. all of the mentioned 


Answer- file        


Que- Indexed allocation _________ direct access. 

a. supports 

b. does not support 

c. is not related to 

d. none of the mentioned 


Answer- supports        


Que- The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation. 

a. less than 

b. equal to 

c. greater than 

d. keeps varying with 


Answer- greater than        


Que- For any type of access, contiguous allocation requires ______ access to get a disk block. 

a. only one 

b. at least two 

c. exactly two 

d. none of the mentioned 


Answer- only one        


Que- _______ tend to represent a major bottleneck in system performance. 

a. CPUs 

b. Disks 

c. Programs 

d. I/O 


Answer- Disks        


Que- In UNIX, even an 'empty' disk has a percentage of its space lost to ______ 

a. programs 

b. inodes 

c. virtual memory 

d. stacks 


Answer- inodes        


Que- By preallocating the inodes and spreading them across the volume, we ___________ the system performance. 

a. improve 

b. decrease 

c. maintain 

d. do not affect 


Answer- improve        


Que- ____________ writes occur in the order in which the disk subsystem receives them, and the writes are not buffered. 

a. Asynchronous 

b. Regular 

c. Synchronous 

d. Irregular 


Answer- Synchronous        


Que- In ___________ writes, the data is stored in the cache. 

a. Asynchronous 

b. Regular 

c. Synchronous 

d. Irregular 


Answer- Asynchronous        


Previous Post Next Post

Responsive Ad