SlideShare a Scribd company logo
2
Most read
BCA ( SEM. - 4th ) ,MAY -2008

                              OPERATING SYSTEM

                             SUBJECT CODE : BC-404

TIME-03 Hours                                            Maximum Marks : 60

Instruction to candidates:

   1) Section – A is Compulsory.
   2) Attempt any Four questions from Section – B.

                         SECTION-A                                 (10 X 2=20)

     1. (a) What are the two main functions of an operating system?
      (b) What is the principal advantage of multiprogramming ?
      (c) Differentiate user level threads from kernel level threads.
      (d) Which is the best condition to prevent from a deadlock?
      (e) Define the concept of dynamic linking.
      (f) What is compaction and why is it used?
      (g) What is the difference between local page replacement and global page
      replacement?
      (h) How interrupt differ from trap?
      (i) What is the purpose of system program?
      (j) What is the function of dispatcher?
                           SECTION-B                                 (4X10=40)
     2. (a) What is operating system? Explain simple batch processing,
          Multiprogramming, multitasking and distributed systems.
         (b) Explain different types of scheduling queues and types of schedulers.

     3. Consider the following set of processes, with the length of CPU – burst
time given in milliseconds:
Process                    Burst Time                Priority

P1                         10                        3

P2                         29                        1

P3                         3                         3

P4                         7                         4

P5                         12                        2

The processes are assumed to have arrived in the order P1, P2,P3,P4 and P5 all at
time 0.

     (a) What is turnaround time of each process for using FCFS, SJF, a non-
         preemptive priority (a smaller priority number implies a higher priority) and
         RR (quantum =10) scheduling.
     (b) What is waiting time of each process for each of the scheduling algorithm in
         part a?

4. (a) Explain Dining Philosopher problem in process synchronization.

(b) What are the four necessary conditions to occur a deadlock? Explain banker’s
algorithm.

5. (a) Why are page sizes always power of 2?

  (b) Consider a logical address space of eight pages of 1024 words each ,
mapped onto a physical memory of 32 frames . How many bits are there in the
logical address and physical address?

6. (a) What is the causes of thrashing ? How it occurs and explain different
methods to prevent from thrashing .

  (b) Explain the different operations performed on files .

7. Write short note on the following:

  (a) Operating system security threats. (b) Data encryption and decryption.
BCA ( SEM. - 4th ) ,MAY -2009

                              OPERATING SYSTEM

                             SUBJECT CODE : BC-404

TIME-03 Hours                                            Maximum Marks : 60



Instruction to candidates:

     3. Section – A is Compulsory.
     4. Attempt any Four questions from Section – B.

                         SECTION-A                               (10 X 2=20)

      1. (a) What is difference between logical address and physical address?
         (b) Give any one reason for the process to get blocked.
         (c) What is Semaphore?
         (d) What do you mean by simple batch processing system?
         (e) Explain virtual memory and associative memory.
         (f) List the three functions of resource management.
         (g) What do you mean by program threats?
         (h) What is indexed allocation?
         (i) What do you mean by Resource allocation?
         (j) Describe Critical Region?

                           SECTION-B                                (4X10=40)
         2. Explain First come ,first served(FCFS) and Round Robin scheduling
         algorithms.
         3. State and Discuss the differences between Multiprogramming and
         Multitasking.
         4. What do you mean by page -faults? When do page-faults occur?
         Describe the action taken by the O.S when page-fault occurs?
         5. Explain the need and various services provided by Operating System.
6. Write an algorithm to determine whether a given system is in a
deadlock and explain.
7. Write short notes on the following:
(a) Inter-process communication
(b) Real time system.

More Related Content

PDF
Neural Networks: Radial Bases Functions (RBF)
PPTX
Travelling Salesman Problem using Partical Swarm Optimization
PPT
Divide and conquer
PPTX
Sum of subset problem.pptx
PPTX
daa-unit-3-greedy method
PPT
backpropagation in neural networks
PPTX
Analysis and Design of Algorithms
PPTX
Lecture 25 hill climbing
Neural Networks: Radial Bases Functions (RBF)
Travelling Salesman Problem using Partical Swarm Optimization
Divide and conquer
Sum of subset problem.pptx
daa-unit-3-greedy method
backpropagation in neural networks
Analysis and Design of Algorithms
Lecture 25 hill climbing

What's hot (20)

PPTX
Greedy Algorithms
PPTX
Fractional Knapsack Problem
PPTX
Radial basis function network ppt bySheetal,Samreen and Dhanashri
PPTX
Artificial Intelligence- TicTacToe game
PPTX
Region filling
PPTX
Multi dimensional turing machine
PPTX
Introduction to data structure and algorithms
PPTX
Deep Learning in Computer Vision
PPTX
Topological Sort Algorithm.pptx
PPTX
Greedy algorithms
PPT
Randomized algorithms ver 1.0
PDF
A* Search Algorithm
PPTX
04 Multi-layer Feedforward Networks
PPT
Pattern matching
PPTX
Non- Deterministic Algorithms
PPTX
Perceptron & Neural Networks
PPT
Graphs
PPTX
Discrete structures & optimization unit 1
PPTX
Adaptive Median Filters
Greedy Algorithms
Fractional Knapsack Problem
Radial basis function network ppt bySheetal,Samreen and Dhanashri
Artificial Intelligence- TicTacToe game
Region filling
Multi dimensional turing machine
Introduction to data structure and algorithms
Deep Learning in Computer Vision
Topological Sort Algorithm.pptx
Greedy algorithms
Randomized algorithms ver 1.0
A* Search Algorithm
04 Multi-layer Feedforward Networks
Pattern matching
Non- Deterministic Algorithms
Perceptron & Neural Networks
Graphs
Discrete structures & optimization unit 1
Adaptive Median Filters
Ad

Viewers also liked (20)

PDF
Holography
DOCX
Curriculum vitae
PDF
2nd Semester M Tech: Computer Science and Engineering (Jun-2016) Question Pa...
PDF
2nd Semester M Tech: Computer Science and Engineering (June-2015) Question Pa...
PDF
4th Semester M Tech: Computer Science and Engineering (Jun-2016) Question Papers
PDF
PROPOSED SYSTEM FOR MID-AIR HOLOGRAPHY PROJECTION USING CONVERSION OF 2D TO 3...
PDF
1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers
PPTX
3D Holo Presentation for MIT 100K Business Plan Competition
PDF
2013-June: 3rd Semester Mechanical Engineering Question Paper
PDF
1st and 2nd Semester M Tech: Computer Science and Engineering (Dec-2015; Jan-...
PDF
3rd Semester Mechanical Engineering (2013-June) Question Papers
DOCX
Banker's note - Blackstone Synergy Pitch
PDF
PDF
4th Semester Mechanical Engineering (2013-June) Question Papers
PPT
Mca ii os u-3 dead lock & io systems
PPT
Introduction to Operating system
PPSX
Deadlock_SVVSDM_DWD
PPTX
TTT diagram of eutectoid steel and martensitic transformation
PPT
Lecture5
PPTX
Operating system Dead lock
Holography
Curriculum vitae
2nd Semester M Tech: Computer Science and Engineering (Jun-2016) Question Pa...
2nd Semester M Tech: Computer Science and Engineering (June-2015) Question Pa...
4th Semester M Tech: Computer Science and Engineering (Jun-2016) Question Papers
PROPOSED SYSTEM FOR MID-AIR HOLOGRAPHY PROJECTION USING CONVERSION OF 2D TO 3...
1st Semester M Tech Computer Science and Engg (Dec-2013) Question Papers
3D Holo Presentation for MIT 100K Business Plan Competition
2013-June: 3rd Semester Mechanical Engineering Question Paper
1st and 2nd Semester M Tech: Computer Science and Engineering (Dec-2015; Jan-...
3rd Semester Mechanical Engineering (2013-June) Question Papers
Banker's note - Blackstone Synergy Pitch
4th Semester Mechanical Engineering (2013-June) Question Papers
Mca ii os u-3 dead lock & io systems
Introduction to Operating system
Deadlock_SVVSDM_DWD
TTT diagram of eutectoid steel and martensitic transformation
Lecture5
Operating system Dead lock
Ad

Similar to 2009 Punjab Technical University B.C.A OPERATING SYSTEM Question paper (20)

PDF
Operating%20 system iii_201
PDF
Csa papers
DOCX
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
DOCX
Smu bca winter 2013
PDF
C O M P U T E R O R G A N I Z A T I O N J N T U M O D E L P A P E R{Www
PDF
Computer Organization Jntu Model Paper{Www.Studentyogi.Com}
PDF
Cs ep-sample jan2012-final
PDF
2009 Punjab Technical University B.C.A Object Oriented Proagramming Language ...
PDF
2009 Punjab Technical University B.C.A Database Management System Question paper
PPTX
Operating systems question bank
DOCX
SMU ,CA FALL 2014 ASSIGNMENTS
PDF
PDF
7th Semester (June; July-2015) Computer Science and Information Science Engin...
PDF
BPSC Previous Year Question for AP, ANE, AME, ADA, AE
PDF
C O M P U T E R N E T W O R K S J N T U M O D E L P A P E R{Www
PDF
Computer Networks Jntu Model Paper{Www.Studentyogi.Com}
PDF
SMU MCA SUMMER 2014 ASSIGNMENTS
DOCX
Smu bscit sem 2 fall 2014 assignments
PDF
05211201 Advanced Data Structures And Algorithms
PDF
05211201 A D V A N C E D D A T A S T R U C T U R E S A N D A L G O R I...
Operating%20 system iii_201
Csa papers
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
Smu bca winter 2013
C O M P U T E R O R G A N I Z A T I O N J N T U M O D E L P A P E R{Www
Computer Organization Jntu Model Paper{Www.Studentyogi.Com}
Cs ep-sample jan2012-final
2009 Punjab Technical University B.C.A Object Oriented Proagramming Language ...
2009 Punjab Technical University B.C.A Database Management System Question paper
Operating systems question bank
SMU ,CA FALL 2014 ASSIGNMENTS
7th Semester (June; July-2015) Computer Science and Information Science Engin...
BPSC Previous Year Question for AP, ANE, AME, ADA, AE
C O M P U T E R N E T W O R K S J N T U M O D E L P A P E R{Www
Computer Networks Jntu Model Paper{Www.Studentyogi.Com}
SMU MCA SUMMER 2014 ASSIGNMENTS
Smu bscit sem 2 fall 2014 assignments
05211201 Advanced Data Structures And Algorithms
05211201 A D V A N C E D D A T A S T R U C T U R E S A N D A L G O R I...

2009 Punjab Technical University B.C.A OPERATING SYSTEM Question paper

  • 1. BCA ( SEM. - 4th ) ,MAY -2008 OPERATING SYSTEM SUBJECT CODE : BC-404 TIME-03 Hours Maximum Marks : 60 Instruction to candidates: 1) Section – A is Compulsory. 2) Attempt any Four questions from Section – B. SECTION-A (10 X 2=20) 1. (a) What are the two main functions of an operating system? (b) What is the principal advantage of multiprogramming ? (c) Differentiate user level threads from kernel level threads. (d) Which is the best condition to prevent from a deadlock? (e) Define the concept of dynamic linking. (f) What is compaction and why is it used? (g) What is the difference between local page replacement and global page replacement? (h) How interrupt differ from trap? (i) What is the purpose of system program? (j) What is the function of dispatcher? SECTION-B (4X10=40) 2. (a) What is operating system? Explain simple batch processing, Multiprogramming, multitasking and distributed systems. (b) Explain different types of scheduling queues and types of schedulers. 3. Consider the following set of processes, with the length of CPU – burst time given in milliseconds:
  • 2. Process Burst Time Priority P1 10 3 P2 29 1 P3 3 3 P4 7 4 P5 12 2 The processes are assumed to have arrived in the order P1, P2,P3,P4 and P5 all at time 0. (a) What is turnaround time of each process for using FCFS, SJF, a non- preemptive priority (a smaller priority number implies a higher priority) and RR (quantum =10) scheduling. (b) What is waiting time of each process for each of the scheduling algorithm in part a? 4. (a) Explain Dining Philosopher problem in process synchronization. (b) What are the four necessary conditions to occur a deadlock? Explain banker’s algorithm. 5. (a) Why are page sizes always power of 2? (b) Consider a logical address space of eight pages of 1024 words each , mapped onto a physical memory of 32 frames . How many bits are there in the logical address and physical address? 6. (a) What is the causes of thrashing ? How it occurs and explain different methods to prevent from thrashing . (b) Explain the different operations performed on files . 7. Write short note on the following: (a) Operating system security threats. (b) Data encryption and decryption.
  • 3. BCA ( SEM. - 4th ) ,MAY -2009 OPERATING SYSTEM SUBJECT CODE : BC-404 TIME-03 Hours Maximum Marks : 60 Instruction to candidates: 3. Section – A is Compulsory. 4. Attempt any Four questions from Section – B. SECTION-A (10 X 2=20) 1. (a) What is difference between logical address and physical address? (b) Give any one reason for the process to get blocked. (c) What is Semaphore? (d) What do you mean by simple batch processing system? (e) Explain virtual memory and associative memory. (f) List the three functions of resource management. (g) What do you mean by program threats? (h) What is indexed allocation? (i) What do you mean by Resource allocation? (j) Describe Critical Region? SECTION-B (4X10=40) 2. Explain First come ,first served(FCFS) and Round Robin scheduling algorithms. 3. State and Discuss the differences between Multiprogramming and Multitasking. 4. What do you mean by page -faults? When do page-faults occur? Describe the action taken by the O.S when page-fault occurs? 5. Explain the need and various services provided by Operating System.
  • 4. 6. Write an algorithm to determine whether a given system is in a deadlock and explain. 7. Write short notes on the following: (a) Inter-process communication (b) Real time system.