COUNCIL FOR TECHNICAL EDUCATION AND VOCATIONAL TRAINING COUNCIL FOR TECHNICAL EDUCATION AND VOCATIONAL TRAINING

Office of the Controller of Examinations Office of the Controller of Examinations

Sanaothimi, Bhaktapur Sanaothimi, Bhaktapur
Regular/Back Exam Chaitra 2069 Regular/Back Exam Chaitra 2070
Program: Diploma in Computer/ IT Engineering Full Marks: 40 Program: Diploma in Computer/ IT Engineering Full Marks: 80
Year/Part: III/I (New Course) Pass Marks: 16 Year/Part: III/I (New Course) Pass Marks: 32
Subject: Applied Operating System Time: 1.3 hrs Subject: Applied Operating System Time: 3 hrs
Candidates are required to give their answers in their own words as far Candidates are required to give their answers in their own words as far
as practicable. The figures in the margin indicate full marks. as practicable. The figures in the margin indicate full marks.
Attempt Any Eight questions.
Attempt (Any Five) Questions.
1. What is shell? Explain in detail OS as resources manager? [2+8=10]
1. Define Operating system. Why operating system is also called as
2. Define real time system and distribute system? Explain about
resource manager? Justify. [3+5=8]
operating system structure. [4+6=10]
2. Define process and thread. Describe about round robin
3. Define process? List the difference between process and threads?
algorithm. [2+2+4=8]
Explain critical region. [2+6+2=10]
3. Write Peterson's algorithm.
4. What is mutual exclusion? Explain how we can achieve mutual
4. Describe used page replacement and first in first out algorithm.
exclusion with suitable algorithm? [2+8=10]
[8]
5. Define process scheduling? List the scheduling objectives. Explain
5. Describe transaction look aside buffers (TBL).
FCFS algorithm. [2+5+3=10]
6. Write short note on: (Any Two) [4*2=8]
6. Define deadlock. List and explain the necessary condition of
a) I/O Request handling
deadlock. Also explain the recovery form deadlock? [2+4+4=10]
b) Swap space management
7. What is memory management? Explain memory management on
c) Deadlock detection and recovery
variable partition multi programming? [2+8=10]
8. Define virtual memory? Explain about least recently used
replacement algorithm? What is thrashing? [2+6+2=10]
9. Explain about Input/output software layer with diagram? [10]
"The End"
10. Write short notes on: [2*5=10]
a) Disk structure
b) Segmentation

"The End"

1 Diploma in Computer Engineering 2 -Prepared by Naresh Tharu

 COUNCIL FOR TECHNICAL EDUCATION AND VOCATIONAL TRAINING COUNCIL FOR TECHNICAL EDUCATION AND VOCATIONAL TRAINING
Office of the Controller of Examinations Office of the Controller of Examinations
Sanaothimi, Bhaktapur Sanaothimi, Bhaktapur
Regular/Back Exam Chaitra 2071 Back Exam Chaitra 2071
Program: Diploma in Computer/ IT Engineering Full Marks: 80 Program: Diploma in Computer/ IT Engineering Full Marks: 40
Year/Part: III/I (New Course) Pass Marks: 32 Year/Part: III/I (New Course) Pass Marks: 16
Subject: Applied Operating System Time: 3 hrs Subject: Applied Operating System Time: 1.3 hrs
Candidates are required to give their answers in their own words as far Candidates are required to give their answers in their own words as far
as practicable. The figures in the margin indicate full marks. as practicable. The figures in the margin indicate full marks.
Attempt Any Five questions. Attempt Any Five questions.
1. a) Define applied OS. Describe OS as virtual machine. [2+6=8] 1. What do you mean by applied operating system? Explain various
b) Describe monolithic system and layered system of operating operating system structure. [2+6=8]
system. [8] 2. Define parallel processing? Explain I/O software layer with
2. a) Define system call. Describe types of system call. [2+6=8] diagram. [2+6=8]
b) Define the term "process". Also explain process state and 3. What is deadlock? What are conditions for a deadlock to occur?
transitions. [2+6=8] Explain various deadlock prevention techniques. [2+3+3=8]
3. a) What is scheduling? Describe FCFS and round robin scheduling 4. Explain paging and TLB. Briefly explain clock page replacement
algorithm. [2+3+3=8] algorithm. [4+4=8]
b) Define deadlock. Explain deadlock recovery techniques. 5. Explain about FCFS, LRU and Round robin algorithm. [2+3+3=6]
[2+6=8] 6. Write short notes on: (Any Two) [2*4=8]
4. a) Define the term virtual memory. Describe optimal page a) Process control block (PCB)
replacement algorithm. [2+6=8] b) File system structure
b) Describe second chance page replacement algorithm and clock c) Segmentation
page replacement algorithm. [4+4=8]
5. a) What is segmentation? Describe segmentation with paging.
[2+6=8]
b) What is thread? What are benefits of using thread? [8] "The End"
6. Write short notes on: (Any Four) [4*4=16]
a) Fragmentation
b) Critical region, race condition
c) Memory hierarchy
d) Tertiary Storage Structure
e) Kernel

"The End"

3 Diploma in Computer Engineering 4 -Prepared by Naresh Tharu

COUNCIL FOR TECHNICAL EDUCATION AND VOCATIONAL TRAINING COUNCIL FOR TECHNICAL EDUCATION AND VOCATIONAL TRAINING
Office of the Controller of Examinations
Office of the Controller of Examinations Sanaothimi, Bhaktapur
Sanaothimi, Bhaktapur Regular/Back Exam 2073, Falgun
Regular/Back Exam 2073 Program: Diploma in Computer/ IT Engineering Full Marks: 80
Program: Diploma in Computer/ IT Engineering Full Marks: 80 Year/Part: III/I (New Course) Pass Marks: 32
Year/Part: III/I (New Course) Pass Marks: 32 Subject: Applied Operating System Time: 3 hrs
Subject: Applied Operating System Time: 3 hrs
Candidates are required to give their answers in their own words as far
Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.
as practicable. The figures in the margin indicate full marks. Attempt All questions.
Attempt Any Five questions. 1. a) What is operating system? Describe OS as “Extended Machine”.
1. a) Define OS. Describe Operating system as Resource Manager. [2+6]
[2+6=8] b) Describe: Any Two [2*4]
b) Describe Layered and client-server system. [2+6=8] i) Types of O.S ii) O.S structure
2. a) What is parallel processing? Describe PCB (Process Control iii) O.S as Resource Manager
Block). [2+6=8] 2. a) Define process. Write the difference between process and thread.
b) Define system call. Describe type of system call. [2+6=8] [6]
3. a) What is scheduling? Describe FCFS and round robin b) Write Peterson’s Algorithm [6]
scheduling. [2+6=8] c) Explain following: Critical section, Mutual exclusion, Race
b) What is mutual exclusion? Describe Peterson’s Algorithm. condition, Semaphores, with simple example. [8]
[2+6=8] 3. a) Define process scheduling and process synchronization with
4. a) Define paging. Describe the page table. [3+5=8] example. Describe following algorithm: [6+6]
b) Describe optimal page replacement and Clock page replacement i) Round Robin ii) FCFS
Algorithm. [2+6=8] b) Define system call and kernel. [4]
5. a) What is thread? Difference between thread and process. [2+6=8] 4. a) Define paging. Explain Fragmentation, Coalescing and
b) What is swap-space management? Describe Tertiary-storage Compaction. [8]
structure. [4+4=8] b) What do you mean by Virtual Memory? [4]
6. Write short notes on: (Any Four) [4*4=16] 5 a) Explain file-system structure. [5]
a) Virtual Memory b) Explain swap-space Management and Tertiary storage structure.
b) IPC [4]
c) Fragmentation 6. Explain deadlock condition and deadlock Recover Process. [7]
d) Deadlock Recovery Or
e) Distributed OS What is security? Write short notes on Linux.

"Good luck"
"The End"
5 Diploma in Computer Engineering 6 -Prepared by Naresh Tharu