Questions Search

This website covers previous years question papers of various universities and colleges in India. Moreover, the information on admission to various courses from various universities/institutes/colleges are also available. Also the latest teaching faculty plus teachers jobs, Government jobs, Banking Jobs, and other jobs are regularly updated to help jobless candidates. Admit cards of various recruitment of Govt organisation are updated. Search your terms using the search box provided.

Follow by Email

Monday, December 28, 2015

Barkatullah University: BCA-304 Operating System 2010 Question Paper

Looking for BCA Barkatullah University Old Question Papers ? You can here download 2010 old question paper BCA Operating System of this university, Check out more details below:

Barkatullah University
Question Paper Code : AS-181
B.C.A. (Third Semester) EXAMINATION, 2009-10
Paper – BCA-304
Time: Three Hours
Maximum Marks : 35
Note : Attempt all questions
Section-A 1-each
(Objective Type Questions )
Q.1. Choose the correct answer-
(i) -------------- network can link buildings within a city:
a) LAN
b) WAN
c) MAN
d) SAN
(ii) In round robin scheduling , the ready queue is treated as a ---------
a) Closed queue
b) Circular queue
c) Dequeue
d) None
(iii) The address generated by the CPU in the paging scheme is in the form ---------- where ---------- stands for ------------ and -------- stands for ------------ .
(iv) FCB stands for ------------------- .
(v) The most common deadlock avoidance algorithm is ……………..

Section –B
Short Answer Type Questions 2 marks each
Q.I. Give a complete definition of operating system.
Define the following:
(a) Real time system
(b) Distributed system
Q.II. Name the three types of CPU schedulers and give function of each.
Give the queuing diagram representing process scheduling and show the action point for the different types of CPU schedulers.
Q.III. If it takes 20 nanoseconds to search the TLB ( translation look-aside buffer) and 100 nanoseconds to access the memory. How much total time is required to get the desired page if we fail to find the page number in the TLB.
What is re-entrant code? Name some heavily used programs that can be shared.
Q.IV. Define disk caching and disk mirroring.
What is seek time and rotational latency as related to a hard disk.
Q.V. Define virtual devices, shared devices and dedicated devices.
State the critical section problem.
Section –C
Long Answer Type Question 4 marks each
Q.I. Write a note on the evolution of operating system.
Compare client-server and peer-to-peer system stating their advantages and disadvantages.

Q.II. (i) Explain context switch along with a suitable diagram. 2
(ii) Name and briefly define the scheduling criteria. 2
(i) List out the circumstances under which a CPU scheduling decision may have to be taken by the CPU scheduler. 2
(ii) Assume, we have the workload as shown below. All 5 processes arrive at time 0, in the order given. The length of the CPU burst time is given in milliseconds
Process : P1 P2 P3 P4 P5
Burst time: 10 29 3 7 12
Considering the FCFS , SJF and RR (q=10ms) scheduling algorithms, which algorithm would give the minimum average turn around time. 2
Q.III (i) Do real time systems have virtual memory. 1
(ii) List out the advantages and disadvantages of having a big page size. 3
Explain in detail how a page fault is serviced under the virtual memory management schemes.
Support your answer with appropriate diagram.
Q.IV. Write in detail about disk driver and disk controller.
Enumerate the responsibilities of a file management system.
Q.V. (i) Define a deadlock. 1
(ii) Name and explain the four necessary conditions for a deadlock to occur. 3
(i) Name the three items on which user authentication is mainly based. Elaborates on the various method of user authentication. 2
(ii) Name the four level at which security measures must be implemented for full protection of a system. Explain each in brief. 2

No comments:

Post a Comment

Pen down your valuable important comments below