Model Test Paper 2013 BCA-I

Operating System Fundamentals OBJECTIVE PART- I

Time allowed : One Hour Maximum Marks : 20 The question paper contains 40 multiple choice questions with four choices and student will have to pick the correct one (each carrying mark). 1PCB stands for: (a) Program Control Block (c) Program Control Bus

(b) (d)

Process Control Bus Process Control Block

( )

2.

Which of the following is not a page replacement strategy? (a) FIFO (b) Second chance (c) Clock page (d) None of the above

( )

3.

While reading or writing on disks, the time taken to move the arm to the proper cylinder is known is: (a) Rotational delay (b) Access time (c) Translational delay (d) Seek time ( ) Operating system is required to manage: (a) Hardware (b) Memory (c) Various resources (d) All of the above Dynamic partitioning of main memory results into: (a) External fragmentation (b) Internal fragmentation (c) Both A & B (d) None of the above Al I/O device that delivers or accepts a stream of character is called: (a) Block device (b) Character device (c) Stream device (d) None of the above Long term scheduler is also called: (a) Job scheduler (b) Memory scheduler (c) CPU scheduler

4.

5.

( )

6.

( )

7.

(d) 8.

None of the above

( )

Round Robin scheduling is perfect in: (a) Batch processing (b) Time Sharing (c) Multiprogramming (d) All of the above

( )

9.

SIGNAL and WAIT operations are related to: (a) multi programming (b) semaphore (c) pre-emptive scheduling of processes (d) none of the above

( )

10.

"Degree of multiprogramming" means: (a) Number of processes running concurrently on the system (b) Number of process running versus terminating in a second (c) Number of process executed since the system start up (d) None of the above Swapping is also called us: (a) Roll out technique (b) Roll in technique (c) Roll out roll in technique (d) None of the above ( )

( )

11.

12.

Which of the following is not an operating system: (a) Windows 98 (b) Windows 95 (c) Windows 3.1 (d) Windows 2000 SJF is a: (a) CPU scheduling policy (b) Memory Management Scheme (c) Resources Management/Allotment Strategy (d) None of the above SIGNAL and WAIT operations are related to: (a) Multiprogramming (b) Semaphore (c) Preemptive scheduling of processes (d) None of the above Remote procedure call (RPC) is: (a) Communication in centralized system (b) Communication in distributed system (c) Both A & B (d) None of the above

( )

13.

( )

14.

( )

15.

( )

16.

The most common system security method is: (a) Password (b) Key card system (c) Mantrap (d) None of the above A CPU scheduling strategy where the process will run to its completion is : (a) Throughout (b) Real time (c) Non-preemptive (d) Preemptive Semaphores are used to solve the problem of: (a) Race condition (b) Process synchronization (c) Mutual exclusion (d) None of the above

( )

17.

( )

18.

( )

19.

Which of the following is also known as a "lightweight process" (a) Function (b) Application Module (c) Kernel (d) Thread A GUI is a : (a) Hardware (c) Kernel

( )

20.

(b) (d)

Language interpreter An operating system

( )

21.

Page fault occur when: (a) The page is corrupted by application software (b) The page is in main memory (c) The page is not in main memory (d) None of the above

( )

22.

Which of the following is a page replacement algorithm? (a) FIFO (b) LRU (c) Optima (d) All of the above Ready state means a process has: (a) All required resources except memory (b) All required resources except CPU (c) All required resources except I/o devices (d) All of the above FSCAN is a: (a) Disk checking mechanism (b) Disk clearing mechanism (c) Disk formatting mechanism (d) Disk scheduling mechanism

( )

23.

( )

24.

( )

25.

A job may be: (a) CPU bound (b) I/O bound (c) Both A and B (d) None of the above Which of the following conditions is not responsible for a deadlock to occur? (a) Mutual exclusion (b) Wait and Hold (c) No preemption (d) Semaphore Frequent page faults due to insufficient number of page frame is termed: (a) Trashing (b) Competition (c) Starvation (d) None of the above A set of adjacent tracks on a magnetic disk is: (a) Cluster (b) Surface (c) Band (d) None of the above

( )

26.

( )

27.

( )

28.

( )

29.

In real time operating system, which of the following is the most suitable scheduling scheme: (a) Round-Robin (b) Fist Come First Served (c) Pre-emptive scheduling (d) Random scheduling ( )

30.

If banker's Algorithm is to deadlock, then, Paging is to: (a) Memory Management (b) Scheduling (c) Threads (d) None of the above Long term scheduler is also called as: (a) Memory schedular (b) CPU schedulear (c) Job schedular (d) None of the above

( )

31.

( )

32.

Asynchronous data transfer is used when: (a) I/O devices and CPU speed matches (b) I/O devices are very show than CPU (c) I/O devices are very fast than CPU (d) None of the above ( ) Round-Robin scheduling is perfect in.operating system.

33.

(a) (b) (c) (d) 34.

Time sharing Multiprogramming Batch processing All of the above

( )

Which of the following scheduling algorithms in general gives minimum waiting time? (a) FCFS (b) SJF (c) Round-Robin (d) Priority ( )

35.

The address which CPU generates is called: (a) Physical address (b) (c) Logical address (d)

Actual address Primary address

( )

36.

Synchronous transfer is preferred when: (a) I/O devices and CPU speed matches (b) I/O devices and very show than CPU (c) I/O devices and very fast than CPU (d) None of the above ( ) In time sharing system the basic aim is: (a) To allow users to interact with the computer system at the same time (b) To allow many users to interact using punched cards (c) To share memory among the users (d) Multiprocessing system

37.

( )

38.

A technique that can be used when a very long program exceeds the storage capacity of memory is called: (a) Windowing (b) Timesharing (c) Linkage editing (d) Virtual memory ( ) In distributed system: (a) Each system has separate clock (b) Each system shares memory and clock (c) Each system has separate memory and clock (d) All of the above

39.

( )

40.

In time sharing system the basic aim is: (a) To allow users to interact with the computer system at the same time (b) To allow many users to interact using punched cards (c) To share memory among the users (d) Multiprocessing system

( )

DESCRIPTIVE PART-II
Time allowed : 2 Hours Maximum Marks : 30 Attempt any four questions out of the six. All questions carry 7 marks each. Q1 What is resource allocation graph? Describe its various entities. Also draw separate resource. Allocation graphs showing a deadlock and a cycle but no deadlock. Q2 Write short notes on any three: (a) Remote Procedure Calls (RPC) (b) Inter process communication (c) Round Robin scheduling (d) Distribution processing system Q3- What is the device management? Explain the various techniques used for device management? (b) Write short note on semaphores. Q4 Describe the deadlock with example. Why deadlock occur? Discuss various methods used for deadlock avoidance. (b) Can a system be is a state that is neither deadlock nor safe? If yes, give examples? Q5- What do you means by Operating System? Define the various categories of operating systems Q6 Discuss major security threats to computer based systems, as provided by their users and providers. (b) What is a virus in context of computer? .. Q7(a) What is the difference between memory mapped I/O and Direct Memory Access? (b) Name major files attributes and operations. or What is virtual memory? Discuss the two key techniques of virtual memory implementation-paging and segmentation. .