Exam Details
| Subject | Operating Systems | |
| Paper | ||
| Exam / Course | Post Graduate Diploma in Computer Application (PGDCA)/ Advance Diploma inComputer Applications (ADCA) / Masters in Computer Applications (MCA) | |
| Department | School of Computer and Information Sciences (SOCIS) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | June, 2016 | |
| City, State | new delhi, |
Question Paper
Differentiate amongst multiprogrammed, multiuser and multitasking operating systems. Also discuss the advantages and limitations of each operating system.
What is understood by the transparency issues in distributed operating system Explain all the transparency issues in brief.
Consider the following set of processes, with the lengths of the CPU burst time given in milliseconds
Processes Burst Time
P1 10
P2 6
P3 22
P4 13
P5 5
All five processes arrive at time in the order given. Draw Gantt charts illustrating the execution of the processes using FCFS, SJF, and RR (quantum scheduling. What is the turnaround time of each process for each of the scheduling algorithms Also find the average waiting time for each algorithm.
Explain FCFS and SSTF disk scheduling algorithms. Consider the following disk block created at a time:
53, 95, 143, 41, 125, 16, 138, 72, 58
Assuming the disk head initially at block number 60, draw the scheduling chart for FCFS and SSTF algorithms.
Explain the concept of memory management in Windows 2000 or higher.
illustrate a 3-dimensional hypercube system and describe its connection features.
Explain Ricart and Agrawala's mutual exclusion algorithm and how it is used to break the ties.
What is the difference between a loosely coupled system and a tightly coupled operating system? Explain with examples.
Why is a thread called a light weight process Differentiate between a process and a thread. List the data items associated with both process and thread.
What is the difference between security policy and security model Explain the access matrix model.
The following is the sequence of page requests
Assume that there are 3 frames in memory. Illustrate the number of page-faults with the following page replacement algorithms:
FIFO
LRU
OPT
List and explain the four necessary conditions that must hold simultaneously for a deadlock to occur. Explain different ways to prevent a deadlock.
Explain at least three techniques of implementing authentication. How is security ensured in Network OS
What are the different kinds of file permissions in UNIX OS? Explain in brief.
What is understood by logical and physical address? How does the memory separation help in forming a virtual memory system?
What is understood by the transparency issues in distributed operating system Explain all the transparency issues in brief.
Consider the following set of processes, with the lengths of the CPU burst time given in milliseconds
Processes Burst Time
P1 10
P2 6
P3 22
P4 13
P5 5
All five processes arrive at time in the order given. Draw Gantt charts illustrating the execution of the processes using FCFS, SJF, and RR (quantum scheduling. What is the turnaround time of each process for each of the scheduling algorithms Also find the average waiting time for each algorithm.
Explain FCFS and SSTF disk scheduling algorithms. Consider the following disk block created at a time:
53, 95, 143, 41, 125, 16, 138, 72, 58
Assuming the disk head initially at block number 60, draw the scheduling chart for FCFS and SSTF algorithms.
Explain the concept of memory management in Windows 2000 or higher.
illustrate a 3-dimensional hypercube system and describe its connection features.
Explain Ricart and Agrawala's mutual exclusion algorithm and how it is used to break the ties.
What is the difference between a loosely coupled system and a tightly coupled operating system? Explain with examples.
Why is a thread called a light weight process Differentiate between a process and a thread. List the data items associated with both process and thread.
What is the difference between security policy and security model Explain the access matrix model.
The following is the sequence of page requests
Assume that there are 3 frames in memory. Illustrate the number of page-faults with the following page replacement algorithms:
FIFO
LRU
OPT
List and explain the four necessary conditions that must hold simultaneously for a deadlock to occur. Explain different ways to prevent a deadlock.
Explain at least three techniques of implementing authentication. How is security ensured in Network OS
What are the different kinds of file permissions in UNIX OS? Explain in brief.
What is understood by logical and physical address? How does the memory separation help in forming a virtual memory system?
Other Question Papers
Departments
- Centre for Corporate Education, Training & Consultancy (CCETC)
- Centre for Corporate Education, Training & Consultancy (CCETC)
- National Centre for Disability Studies (NCDS)
- School of Agriculture (SOA)
- School of Computer and Information Sciences (SOCIS)
- School of Continuing Education (SOCE)
- School of Education (SOE)
- School of Engineering & Technology (SOET)
- School of Extension and Development Studies (SOEDS)
- School of Foreign Languages (SOFL)
- School of Gender Development Studies(SOGDS)
- School of Health Science (SOHS)
- School of Humanities (SOH)
- School of Interdisciplinary and Trans-Disciplinary Studies (SOITDS)
- School of Journalism and New Media Studies (SOJNMS)
- School of Law (SOL)
- School of Management Studies (SOMS)
- School of Performing Arts and Visual Arts (SOPVA)
- School of Performing Arts and Visual Arts(SOPVA)
- School of Sciences (SOS)
- School of Social Sciences (SOSS)
- School of Social Work (SOSW)
- School of Tourism & Hospitality Service Sectoral SOMS (SOTHSM)
- School of Tourism &Hospitality Service Sectoral SOMS (SOTHSSM)
- School of Translation Studies and Training (SOTST)
- School of Vocational Education and Training (SOVET)
- Staff Training & Research in Distance Education (STRIDE)
Subjects
- Accounting and Financial Management
- Advanced Database Design
- Advanced Discrete Mathematics
- Advanced Internet Technologies
- Artificial Intelligence and Knowledge Management
- Communication Skills
- Computer Graphics and Multimedia
- Computer Organisation & Assembly Language Programming
- Data and File Structure
- Data Communication and Computer Networks
- Database Management System
- Database Management Systems
- Design and Analysis of Algorithm
- Discrete Mathematics
- Elements of Systems Analysis & Design
- Numerical and Statistical Computing
- Object Oriented Analysis and Design
- Object Oriented Technologies and Java Programming
- Operating System Concepts and Networking Management
- Operating Systems
- Parallel Computing
- Principles of Management and Information Systems
- Problem Solving and Programming
- Software Engineering
- Systems Analysis and Design