OPERATING SYSTEMS SYLLABUS

OPERATING SYSTEMS

SYLLABUS

1.0 Know about basics of O/S.

1.1 Define an O/S

1.2 History of O/S
HISTORY OF O/S PPT

BASICS OF OPERATING SYSTEMS

1.3 Know about various of O/S
Know about various operating systems ppt

1.4 Know about concept of spooling and buffering.
 Know about concept of spooling and buffering ppt

1.5 Explain the concepts like multiprogramming and timesharing
1.5 Explain the concepts like multiprogramming and timesharing ppt

1.6 Know about distributed and real time systems
 Know about distributed and real time systems ppts

1.7 Know about multiprocessor systems
Know about multiprocessor systems

1.8 Understand the O/S components

1.9 Discuss O/S services

1.10 Define system call with example

1.11 Know about different types of system calls.

1.12 Know about single, multi user O/S structure

2.0 Understand the process management.

2.1 Define processes.

 Process defination

2.2 Understand

a) sequential process
Process status video1

Process status video2

b) process state diagram

c)process control block

process control blocks ppt

2.3 Know process creation and termination

2.4 Understand the relation between process

2.5 Understand threads and multithreading

2.6 Know the scheduling process

2.7 Know about scheduling queues and schedulers

2.8 Explain C.P.U scheduling

2.9 Know the various scheduling algorithms

Alogorithms, FCFS

SJF
SJF VIDEO
Priority Scheduling

·          Priority scheduling video

Round Robin Scheduling
Round Robin scheduling video

            Multilevel queue scheduling

            Multilevel Feedback queue scheduling

2.10 Understand semaphores

2.11 Know about inter process communication

2.12 Define a deadlock

       Deadlock ppt
DeadLock video in operating systems

2.13 State the necessary conditions for deadlock prevention

2.14 Know the various techniques for deadlock prevention

2.15 Discuss briefly deadlock avoidance and detection

        Deadlock avoidance

        Deadlock detection

2.16 Know about recovering from deadlock

3.0 Understand the storage management

3.1 Discuss briefly address binding, dynamic loading & overlays
•          Address binding

•          Dynamic loading

•          Dynamic Linking and Overlays

3.2 Discuss briefly on swapping

  Logical vs Physical Address

  MMU swapping

3.3 Discuss single partition allocation

3.4 Discuss multiple partition allocation

3.5 Discuss briefly paging concept

3.6 Discuss briefly segmentation
Segmentation

Paged segmentation

3.7 Discuss briefly memory techniques

3.8 Describe briefly demand paging

3.9 Know about page replacement

3.10 Discuss briefly on page replacement algorithms FIFO, URL optimal
 FIFO
PAGE REPLACEMENT ALGORITHMS FIFO VIDEO
LRU PAGE REPLACEMENT ALGORITHM VIDEO
URL OPTIMAL

OPTIMAL PAGE REPLACEMENT ALGORITHM VIDEO

3.11 Know the concept of thrashing
Thrashing, Allocation of frames

3.12 Know working set model page fault frequency ppt
Working set model video
yleI � r i � � pm� 0in;margin-bottom:.0001pt;line-height: 13.5pt;background:white'>URL OPTIMAL

OPTIMAL PAGE REPLACEMENT ALGORITHM VIDEO

4.0 Understand the secondary storage management

4.1 Explain disk structure

4.2 Understand free space management

4.3 Know various allocations

Contiguous method

Index allocation method

Linked allocation method

4.4 Know about various disk scheduling algorithms FCFS, SST, Scan, Look
DISK SCHEDULING INTRODUCTION PPT

FCFS VIDEO
FCFS SCHDULING PPT
SST VIDEO
SCAN DISK ppt

C_SCAN SCHEDULING

C_LOOK SCHEDULING
Look scheduling ppt
SCAN DISK VIDEO

5.0 Understand the file system and protection

5.1 Define file management

5.2 List and explain various file operations

5.3 List and explain various access methods ppt

5.4 Understand directory structure organization

File operations on a directory

single level directory structure ppt

two level directory ppt

deleting a structure

advantages and disadvantages of tree structured directories ppt

acyclic graph directories ppt

issues in acyclic graph directories

5.5 Understand the concept of file protection

HOME    

OPERATING SYSTEMS PREVIOUS QUESTION PAPERS

• OCTOBER/NOVEMBER-2011 (C-05)
• OCT/NOV-2011
• OCTOER/NOVEMBER 2011 (C-09)
• OCT/NOV-2011 (C-00)
• Oct/Nov-2012 (C-09

OPERATING SYTEMS IMPORTANT QUESTIONS FOR POLYTECHNICA DIPLOMA

IMPORTANT QUESTIONS FOR BTECH

OPERATING SYSTEM PORTION FOR MTECH

  
C LANGUAGE  

C with DATA STRUCTURES

C++ TUTORIALS

JAVA

OPERATING SYSTEMS

SOFTWARE ENGINEERING

WEB DESIGNING

SYSTEM ADMINISTRATION

MICRO PROCESSOR

SAP

COMPUTER ARCHITECTURE

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS FOR DS THROUGH C

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS Computer hardware

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS WITH ANSWERS FOR CPP

POLYTECHNIC RDBMS PREVIOUS QUESTION PAPERS

   

   

      

 

MARCH/APRIL 2013 (C-09)

C-09-CM-402

3459

BOARD   DIPLOMA   EXAMINATION,   (C-09)

MARCH/APRIL 2013

D.C.M.E   -   IV SEMISTER EXAMINATION

OPERATING SYSTEMS

TIME: 3 Hours]                                                                     [Total Marks :80]

PART   - A                                          10*3=30

Instruction:  (1) answer all question and each question

                                           carries THREE marks

                    (2)  answer should be brief and   straight      to  the point and shall not exceed five simple sentences

1.   What is spooling?

Ans:   http://raj-os.blogspot.in/2012/12/what-is-spooling.html

2.  Define system call.

3.  List three overall strategies in handling deadlocks

4.  what is FCFS?

5.  List three examples of deadlocks that are not related to a computer-system environment.

6.  What are P and V operations with semaphore?

7.  How many frames are needed for each page? Why?

8.  What is the page-fault frequency strategy?

9.  Brief about disk structure.

10. List operations to be performed on directories

 PART- B                                    5*10=50

Instructions: (1) Answer any five questions and each question carries ten marks. (2) The answers should be comprehensive and the criteria for valuation is the content but not the length of the answer.

  

11. What are the services of operating system? Explain.

12. Explain the queuing diagram?

Refer to Question No (12) in Oct/Nov-2011(c-09)

http://raj-os.blogspot.in/2012/12/dcme-operating-systems-octnov-2011.html

13. Explain the process state diagram.

14. Explain the threads.

15. Write about page replacement algorithms

16. (a) write about the swapping. (b) Write about the single partition allocation

17. Compare the contiguous, linked and indexed disk space allocations.

18. Explain the differences among the file acess methods.

Refer to Question no 18 in Oct/Nov-2011(c-09)

http://raj-os.blogspot.in/2012/12/dcme-operating-systems-octnov-2011.html

MARCH/APRIL 2013 (C-05)

C-09-CM-403

458

BOARD   DIPLOMA   EXAMINATION,   (C-05)

MARCH/APRIL 2013

D.C.M.E   -   IV SEMISTER EXAMINATION

OPERATING SYSTEMS

TIME: 3 Hours]                                                                     [Total Marks :100]

PART   - A                                          10*4=40

Instruction:  (1) answer all question and each question

                                           carries 4 marks

                    (2)  answer should be brief and   straight      to  the point and shall not exceed five simple sentences

1.      Explain the concept of buffering.

2.      List any six components of operating system.

3.      Explain briefly the concept of a process

4.      Define waiting time and turnaround time.

5.      List the necessary conditions for deadlock.

6.      What is the concept of dynamic linking?

7.      What is paging? Write its purpose

8.      Define virtual memory.

9.      List the three file allocation methods

10.  What is a file? List any four file attributes.

 PART- B                                    12*5=60

Instructions: (1) Answer any five questions and each question carries 12 marks. (2) The answers should be comprehensive and the criteria for valuation is the content but not the length of the answer.

  

11.  (a) Explain the two types of operating systems each with two examples. (b) Explain briefly about distributed systems. List any two advantages.

12.  . (a) Explain the concept of cooperating processes with two examples. (b) Differentiate preemptive and non-preemptive scheduling each with one example.

13.  (a) Differentiate long-term and short-term schedulers. 9b) Define semaphore. Explain its operations

Home                    Next(Oct/Nov-2012(c-05)   previous

OPERATING SYSTEMS PREVIOUS QUESTION PAPERS

C LANGUAGE  

C with DATA STRUCTURES

C++ TUTORIALS

JAVA

OPERATING SYSTEMS

SOFTWARE ENGINEERING

WEB DESIGNING

SYSTEM ADMINISTRATION

MICRO PROCESSOR

SAP

COMPUTER ARCHITECTURE

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS FOR DS THROUGH C

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS Computer hardware

POLYTECHNIC DIPLOMA PREVIOUS QUESTION PAPERS WITH ANSWERS FOR CPP

POLYTECHNIC RDBMS PREVIOUS QUESTION PAPERS