Exam Details
| Subject | operating system - i | |
| Paper | ||
| Exam / Course | b.c.a | |
| Department | ||
| Organization | Vardhaman Mahaveer Open University | |
| Position | ||
| Exam Date | June, 2016 | |
| City, State | rajasthan, kota |
Question Paper
BCA-07 DCA-102
June Examination 2016
BCA Pt. II DCA Examination
Operating System I
Paper BCA-07 DCA-102
Time 3 Hours Max. Marks 100
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. Limit to 30 words. All carries 2 marks.
Explain system cells.
Explain trashing.
Explain file attributes.
What is virtual memory?
What is first-fit, best-fit?
Explain swapping.
What is process?
(viii) Give necessary conditions of deadlock.
Explain about disk structure.
Explain about overlays.
426
BCA-07 DCA-102 200 2 (P.T.O.)
BCA-07 DCA-102 200 2
426
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Limit your answer to 200
words. All carries 10 marks each.
Explain various scheduling algorithms.
Discuss busy, wait implementation of semaphore.
Explain demand paging and segmentation.
Explain deadlock avoidance with bankers algorithm.
Explain all file allocation methods.
Explain the concept of virtual memory.
Explain different types of operating systems.
Describe Process State Transition diagram in detail.
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. Limit your answer to 500
words. All carries 20 marks.
10) Explain threading issues in detail.
11) Discuss any two page replacement algorithms.
12) Compare RR and FCFS scheduling algorithms.
13) Compare preemptive and non-preemptive scheduling.
June Examination 2016
BCA Pt. II DCA Examination
Operating System I
Paper BCA-07 DCA-102
Time 3 Hours Max. Marks 100
Section A 10 × 2 20
(Very Short Answer Questions)
Note: Answer all questions. Limit to 30 words. All carries 2 marks.
Explain system cells.
Explain trashing.
Explain file attributes.
What is virtual memory?
What is first-fit, best-fit?
Explain swapping.
What is process?
(viii) Give necessary conditions of deadlock.
Explain about disk structure.
Explain about overlays.
426
BCA-07 DCA-102 200 2 (P.T.O.)
BCA-07 DCA-102 200 2
426
Section B 4 × 10 40
(Short Answer Questions)
Note: Answer any four questions. Limit your answer to 200
words. All carries 10 marks each.
Explain various scheduling algorithms.
Discuss busy, wait implementation of semaphore.
Explain demand paging and segmentation.
Explain deadlock avoidance with bankers algorithm.
Explain all file allocation methods.
Explain the concept of virtual memory.
Explain different types of operating systems.
Describe Process State Transition diagram in detail.
Section C 2 × 20 40
(Long Answer Questions)
Note: Answer any two questions. Limit your answer to 500
words. All carries 20 marks.
10) Explain threading issues in detail.
11) Discuss any two page replacement algorithms.
12) Compare RR and FCFS scheduling algorithms.
13) Compare preemptive and non-preemptive scheduling.
Other Question Papers
Subjects
- basic electronics
- computer applications for office management
- computer applications in corporate world
- data base management system (theory and practical)
- data structures and algorithms
- discrete mathematics
- fundamental of computer networks
- general english
- introduction to computer science
- object orientated programming in c ++ (theory and practical)
- operating system - i
- operating system - ii
- programming in c
- programming in java (theory and practical)
- programming in visual basic (theory and practical)
- software engineering
- web authoring tools
- web technology (theory and practical)