|
|
|
|
|
|
|
|
|
|
|
|
|
Note: Bold Terms Are The Correct Answers 1) Tapping and Disclosure are categorized as _ _ _ _ _ _ _ _ _ _ _ _ _ threats. a) Active b) Passive c) None 2) In Tapping, the source party willingly or knowingly discloses the information to the third party. ( T / F ) (F) 3) In disclosure, the third party accesses the information without the knowledge of the two parties. ( T / F ) (F) 4) _ _ _ _ _ _ _ _ _ _ _ are the secret entry points left by the software programmer. ( Trap Doors ) 5) Timed software bomb explodes on _ _ _ _ _ _ _ _ _ _ _ _ _ _ _. a) specific time b) specific event c) specific place d) none of them
6) Ordinary software bomb and Timed software bomb are one or same thing. ( T / F ) (F) 7) Rabbit are the piece of code, when executed consumes the all resources of the System. ( T / F ) (F) 8) Worms when executed consumes system _ _ _ _ _ _ _ _ _ _ _ _ _. a) data b) speed c) resources d) a & c e) none
9) Virus is the piece of code that does not append but replaces the original executable programs. ( T / F ) (F) 10) Viral code can be inserted in the body of an executable code to carry out some undesirable action. ( T / F ) (T) 11) Viruses are transferred from system to system via _ _ _ _ _ _ _ _ _ _ _ _. a) floppy b) network c) none d) both a & b
12) Authentication in centralized environment can be achieved by a) password b) artifact c) human characteristics d) All e) b & c only
13) The best way of assigning the password is to a) allow user to select his/her password b) Administrator assigns password c) System assigns the password
14) Signature analysis method consumes _ _ _ _ _ _ _ _ _ _ _ _ time as compared to voice pattern method. a) less b) equal c) more
15) AOS/VS stands for _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _. a) Advanced Operating System / Visual System b) Application Oriented System / Virtual Services c) Application Oriented Services / Virtual System
16) Unix Operating System allows following access rights a) Read, Write & Execute b) Read, Delete & Append c) Read & Append only d) None of them
17) Encryption process must be _ _ _ _ _ _ _ _ _ _ _ _. a) readable b) restorable c) writeable
18) Every encryption has an _ _ _ _ _ _ _ _ _ _ & key. ( algorithm ) 19) Decryption means recovering the data in original form ( T / F ) (T)
20) DES stands for _ _ _ _ _ _ _ _ _ _ _ _. Data Encryption Standards 21) Rail fence Cipher is a popular and simple method of Substitution Ciphers ( T / F ) (F) 22) Caesar cipher is a popular and simple method of Transposition Ciphers. ( T / F ) (F) 23) In Transposition Ciphers, the letters in the message are not changed but their order is changed. ( T / F ) (T)
1. It acts as an interface between a user and the computer (a) os (b) memory management system © file management system
2. An _os_ is resource allocator.
3. Optimal usage of computing resources is the operating systems (a) primary goal (b) secondary goal (c) none of them
4. The user of an application is called (a) end user (b) system user (c) operator
5. Suspended states are the ___non active __ states.
6. A portion of the os which is always present in main memory is called (a) resource allocator (b) resident monitor (c) control program
7. The processor it self is a (a) resource (b) register (c) none of them
8. Program is also called a __job__.
9. Double buffering is faster than the _single buffering_.
10. The first operating system of any kind was developed in the (a) mid-50s (b) mid-60s (c) mid-70s
11. JCL stands for _job control language_.
12. Switching of processor among more then one processes is called (a) multiprogramming (b) multiprocessing (c) parallel processing
13. CTSS stands for _compatible time sharing system_.
14. The first time sharing system was developed in (a) 1971 (b) 1981 (c) 1961
15. A process is defined as a (a) program in execution (b) program in main memory (c) program in secondary memory
16. Considering single cpu system only one process may be _running_ at one time.
17. There is no universally agreed upon definition for a (a) processor (b) process (c) cpu
18. The term process was first used by the designers of the (a) multics system (b) windows system (c) unix system
19. It is also called as a dispatchable unit (a) processor (b) process (c) cpu (d) none of them
20. The os control structure is to maintain the different_tables_.
21. The simplest model for process behavior is a (a) two state model (b) three state model (c) five state model
22. The number of active states for a process is (a) two states (b) three states (c) five states
23. PCB stands for __process control block__.
24. It selects a new process from the ready queue to run (a) dispatcher (b) processor (c) time-out signal
25. The number of non active states for a process is (a) two states (b) three states (c) five states
26. Each process has a _LIFO_ system stack.
27. The not running state can further be classified in to (a) two states (b) three states (c) five states
28. The process spawned by the existing process is called a (a) child process (b) parent process (c) both of them
29. Swapping is one of the reasons for process (a) suspension (b) creation (c) termination
30.When more than two buffers are used the collection of buffers is called a __circular buffer__.
A process is defined as a program in execution (t / f)
The OS does not allocate the resources (t / f)
A PCB is known as PSW (t / f)
A memory resident part of the OS is called as resident monitor (t / f)
The process state transition is also known as the process switching (t / f)
In the blocked state the processes are maintained in the priority order (t / f)
When a process is in the blocked state it is swapped out of the main memory (t / f)
When a process normally completes it is called as a termination (t / f)
The state transition diagram of a process shows the process behavior (t / f)
PCB is a data structure which provides all the information needed by the os to manage the processes (t / f)
(01) These are placed at the lowest level of file system software architecture. (a) Device Drivers (b) Accessing Methods (c) Logical I/O
(02) It deals with blocking the data that are exchanged with disk or tape (a) Basic File System (b) Basic I/O Supervisor (c) Both of them
(03) The level of file system closest to the user is usually termed as (a) Access Methods (b) Basic File System (c) Logical I/O
(04) The least complicated file organization may be termed as (a) Pile File (b) Sequential File (c) Indexed File
(05) The most common form of file structure is the (a) Pile File (b) Sequential File (c) Indexed file
(06) Usually the first field in any record is referred to as a _Key Field_ in sequential file.
(07) In sequential file the records are stored in _Key_ sequence.
(08) A log file is also called as (a) Pile File (b) Transaction File (c) Both of Them
(09) The over flow file is similar to the (a) Pile File (b) Log File (c) Both of Them
(10) In this type of file accessing method two types of indexes are used (a) Indexed File (b) Indexed Sequential File (c) Both of Them
(11) Sequential file are typically used in (a) Batch Applications (b) Time-Sharing (c) None of Them
(12) This is capable to directly access any block of known address (a) Direct File (b) Hashed File (c) Both of Them
(13) Collection of files associated with any file management system is called a _File Directory_.
(14) This itself is a file owned by the operating system (a) File Directory (b) Any System File (c) Any User File
(15) These are typically granted by the owner of the file (a) Accessing Methods (b) Access Rights (c) None of Them
(16) The device on which a file is stored is called as (a) File Type (b) Volume (c) File Organization
(17) The difficulty of assigning unique names to the files is minimized by the (a) Single Level Directory (b) Two Level Directory (c) None of Them
(18) File sharing is always allowed in a (a) Single User System (b) Multi-User System (c) Both of Them
(01) It acts as an interface between a user and the computer (a) operating system (b) memory management system (c) file management system
(02) An _operating system_ is resource allocator.
(03) Optimal usage of computing resources is the operating systems (a) primary goal (b) secondary goal (c) none of them
(04) The user of an application is called (a) end user (b) system user (c) operator
(05) A portion of the operating system which is always present in main memory is called (a) resource allocator (b) resident monitor (c) control program
(06) the processor it self is a (a) resource (b) register (c) none of them
(07) Program is also called a _job.
(08) The first operating system of any kind was developed in the (a) mid-50s (b) mid-60s (c) mid-70s
(09) JCL stands for __job control language.
(10) switching of processor among more then one processes is called (a) Multiprogramming (b) multiprocessing (c) parallel processing
(11) CTSS stands for __compatible time-sharing systems.
(12) The first time sharing system was developed in (a) 1971 (b) 1981 (c) 1961
(13) A process is defined as a (a) program in execution (b) program in main memory (b) Program in secondary memory
(14) There is no universally agreed upon definition for a (a) processor (b) process (c) cpu
(15) The term process was first used by the designers of the (a) multics system (b) windows system (c) unix system
(16) It is also called as a dispatch able unit (a) processor (b) process (c) cpu (d) none of them
(17) The simplest model for process behavior is a (a) two state model (b) three state model (c) five state model
(18) The number of active states for a process is (a) two states (b) three states (c) five states
(19) It selects a new process from the ready queue to run (a) dispatcher (b) processor (c) time-out signal
(20) The number of non active states for a process is (a) two states (b) three states (c) five states
(21) The number of scheduling levels is (a) two (b) three (c) five
(22) It is the most complexed scheduling level (a) high level (b) medium level (c) low level
(23) A scheduling level which controls the admission of jobs into the system is called (a) high level (b) medium level (c) low level
(24) FCFS policy is also called as __non-preemptive policy.
(25) Shortest remaining time is preemptive version of (a) SJF (b) FCFS (c) HRRN
(26) HRRN policy is called as (a) aging technique (b) non-preemptive (c) none of them
(27) shortest job first favours (a) long jobs (b) short jobs (c) none of them
(28) FCFS policy is biased against (a) short jobs (b) long jobs (c) i/o bound jobs
(29) A fixed length of time slice allocated to all jobs is called (a) time quantum (b) time-out (c) none of them
(30) Round robin policy is a (a) fair chance policy (b) preemptive policy (c) Non preemptive policy 01) The access right in which the user may not even learn of the existence of a file is called (a) Knowledge (b) None (c) Both of Them
(02) These are termed as units of I/O with secondary storage (a) Accessing Methods (b) Blocks (c) Portions
(03) On most of the systems these are of fixed length (a) Portion (b) Blocks (c) Files
(04) The size of this unit can range from single block to entire file (a) Block (b) Portion (c) I/O Buffers
(05) In this allocation policy the size of a file must be declared at the time of creation. (a) Dynamic Allocation (b) Pre-Allocation (c) Both of Them
(06) Collection of similar records is called as (a) Field (b) File (c) Database
(07) A table which keep track of assigned Blocks/portions is called (a) Disk Allocation Table (b) File Allocation Table (c) Both of Them
(08) The first unused contiguous group of blocks of sufficient size are allocated in this policy (a) Best-Fit (b) First Fit (c) Nearest Fit
(09) It is also called a smallest information element (a) Record (b) Field (c) File
(10) The collection of fields is known as (a) File (b) Record (c) Database
(11) The unused part of the last block allocated to a file is known as (a) Segmentation (b) Fragmentation (c) Both of Them
(12) Programs and data need to be in main memory in order to be (a) Executed (b) Accessed (c) Referenced
(13) Programs or data not needed immediately may be kept on (a) Secondary Storage (b) primary Storage (c) Cache Memory
(14) The Storage hierarchy could be extended by one more level, it became clear in (a) 1970s (b) 1960s (c) 1980s
(15) It is a high speed and much faster storage (a) Primary Storage (b) Cache Storage (c) Secondary Storage
(16) The Storage management Strategies are divided into (a) 5 Categories (b) 2 Categories (c) 3 Categories
(17) It is possible to run programs larger than the main storage by using the (a) RAM (b) Cache (c) Overlays
(18) Protection is implemented by the use of a single boundary register in the (a) Single User System (b) Multi User System (c) Both of Them
(19) Several jobs are needed to reside in main memory at once in the (a) Multiprogramming (b) Multi User System (c) Both of Them
(20) A PHYSICAL Address is an actual location in main Memory.
(21) ANTICIPATORY fetching yields improved system performance.
(22) A Segment of Memory which going unused is called as (a) Compaction (b) Fragmentation (c) None of Them
(23) No fix boundaries are observed in (a) Fixed Partition MP (b) Variable Partition MP (c) Both of Them
(24) Merging adjacent holes to form a single large hole is called Coalescing.
(25) A job’s Partition is exactly the size of the job in (a) Fixed Partition MP (b) Variable Partition MP (c) None of them
(26) It involves moving all occupied areas of Memory to one end of the Main Memory. (a) Compaction (b) Coalescing (c) Both of Them
(27) A job is placed in a hole in the main Memory where it leaves smallest amount of unused space is called (a) First Fit (b) Best Fit (c) Worst Fit
(28) The entire storage is dedicated to one job for a brief period of time, and then it is removed and the next job is brought in, this technique is called as (a) Swapping (b) Overlaying (c) Both of Them
(29) In Contiguous Systems, Protection is often implemented with the (a) Bounds Registers (b) Processor Registers (c) Both of Them
(30) The measure of work, number of jobs per unit time is called (a) CPU Time (b) Throughput (c) Both of Them
(31) The time interval from submission to the completion of a job is called (a) Turnaround Time (b) Waiting Time (c) Response Time
(32) The value that indicates relative importance of the processes is called (a) Processing Time (b) Priority (c) Quantum
(33) It controls the admission of jobs into the system (a) High Level Scheduling (b) Low Level Scheduling (c) Medium Level Scheduling
(34) The first unused contiguous group of blocks of sufficient size are allocated in this policy (a) Best-Fit (b) First Fit (c) Nearest Fit
(35) HRRN is also known as (a) Aging Technique (b) Non Preemptive Policy (c) Both of them
(36) The RR Policy is known as (a) Fair Chance Policy (b) Preemptive Policy (c) None of Them
(37) This policy is rarely used as standalone policy. (a) FCFS (b) SRT (c) RR |
|
|
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||||
|
|
|
|||||
