How To Exam?

a knowledge trading engine...


Bangalore University 2006 B.C.A Computer Application OPERATING SYSTEM - Question Paper

Friday, 22 March 2013 04:30Web

II SEMESTER B.C.A exam ,NOVEMBER /DECEMBER 2006
(NEW SCHEME)COMPUTER SCIENCE
OPERATING SYSTEM
TIME:3 HOURS
MAX MARKS:80

SECTION:A
1.EXPLAIN OS COMPONENTS IN BRIEF
2.EXPAND THE TERMS
a)WAITING TIME
b)TURN AROUND TIME
c)THROUGHPUT
3.COMPARE AND CONTRAST OVERLAYS AND THRASHING
4.EXPLAIN THE OPERATIONS OF MULTILEVEL SCHEDULING
5.WHAT IS STORAGE HIERARCHY?
6.EXPLAIN THE TERMS
a)LOGICAL MEMORY
b)PHYSICAL MEMORY
7.WHAT IS PAGE FAULT?EXPLAIN
8.DiscUSS ADVANTAGES AND DISADVANTAGES OF FILES ACCESS METHODS
10.EXPLAIN FILE MANAGEMENT SYSTEM IN WINDOWS NT OPERATING SYSTEM

SECTION-B
11a)DiscUSS FUNCTION OF OPERATING SYSTEM WITH EXAMPLE 6
b)EXPLAIN STATE TRANSITION OF PROCESS IN EXECUTION four
c)EXPLAIN THE NEED FOR THE SYNCHRONIZATION WITH EXAMPLES 4

12a)EXPLAIN THE TERMS PREEMPTIVE AND NON PREEMPTIVE SCHEDULING
STATE WHY STRICT NON PREEMPTIVE SCHEDULING ID UNLIKELY TO BE USED IN
COMPUTER CENTER 10
b)WHAT ARE a few SCHEDULING DECISION WHICH MUST BE TAKEN ABOVE THE LEVEL OF CPU SCHEDULING? 4

13.a)EXPLAIN THE ROLE OF SEMAPHORE AND ITS kind 6
b)WHEN TO RUN A DEAD LOCK DETECTION ALGORITHM?EXPLAIN WITH AN EXAMPLE 8

14a)EXPLAIN WHY FRAGMENTATION DOES NOT OCCUR IN PAGED SYSTEM 8
b)EXPLAIN THE TERMS 1st FIT,BEST FIT AND WORST FIT 6

15a)EXPLAIN DIRECTORY STRUCTURE 4
b)EXPLAIN ANY 3 DISK SCHEDULING ALGORITHMS 6
c)HOW DO YOU REFER TO AN I/O DEVICE IN DOS?IN UNIX? 4

16a)WRITE SHORT NOTES ON:
i)FREE SPACE MANAGEMENT 4
ii)SPOOLING AND BUFFERING four
A 32 BIT ADDRESS IS DIVIDED INTO 14-BIT SEGMENT NUMBER ,AN 8-BIT PAGE
NUMBER AND A 10 BIT DISPLACEMENT" 6
i)HOW MANY PAGES AN A SEGMENT HAVE?
ii)WHAT IS A PAGE SIZE
iii)HOW MANY SEGMENTS CAN BE ADDRESSED


( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Bangalore University 2006 B.C.A Computer Application OPERATING SYSTEM - Question Paper