OPERATING SYSTEM OCT/NOV-2011 (C-00)

C05-CM-306

2355

BOARD DIPLOMA EXAMINATION, (C-00)

OCT/NOV-2011

DCME THIRD YEAR EXAMINATION

OPERATING SYSTEMS

Time : 3 Hours]                                                               [Total Marks: 100

PART-A    10*4=40

Instructions: (1) Answer all questions and each question caries four marks. (2) Answers should be brief and straight to t the point and shall not exceed five simple sentences.

1.    Define an operating system. List any two operating systems. 2+2

2.    Define Li) process (ii) Thread

3.    List any four scheduling algorithms.

4.    What is a semaphore?

5.    Define swapping.

6.    What is segmentation?

7.    What is thrashing?

8.    List various allocation methods.

9.    List various file operations

10. List the advantages of macro

PART-B                                              5*12=60

Instructions: (1) Answer any five questions and each question caries twelve marks. (2) The Answers should be comprehensive and criteria for valuation is the Content but not the length of the answer.

11. (a) Explain multiprogramming and timesharing. (b) what is a system call and list various systems calls.

12. (a) explain process control block. (b) explain round robin scheduling algorithm.

13. (a) explain the necessary conditions for deadlocks. (b) explain techniques for deadlock prevention

14. Explain address binding, dynamic loading and dynamic linking.

15. (a) explain demand paging. (b) explain multiple partition allocation

16. Explain free space management

17. Explain various file access methods

18. (a) explain the functions of an assembler and its design. (b) explain the steps followed in designing an assembler

Home                   

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

OPERATING SYSTEM DCME-IV OCT/NOV 2011(C-05)

C05-CM-403

458

BOARD DIPLOMA EXAMINATION, (C-05)

OCTOBER/NOVEMBER-2011

DCME-IV SEMESTER EXAMINATION

OPERATING SYSTEMS

TIME: 3 HOURS]                                                      [TOTAL MARKS:100

PART A

Instructions: (1) Answer all questions and each question carries four marks.(2) Answer should be brief and straight to the point and shall not exceed five simple sentences.

1.    Explain briefly about timesharing.

2.    List any siz operating system services

3.    What is the purpose of multi-threading model? List any two models.

4.    What is the difference between preemptive and non-preemptive scheduling?

5.    Explain the wait and signal operations on a semaphore S

6.    What is address binding? Explain about compile time binding?

7.    Explain the concept of demand paging.

8.    When does a page-fault occur?

9.    Explain linked-list free space management technique.

10. Explain briefly about sequential file access method.

PART-B                     5*12=60

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

11. (a) expand “SPOOL”. Explain the concept of spooling with approapriate sketch. (b) define a system call. Explain any two types of system calls.

12. (a) explain the five states of a process. (b) explain any five pieces of information stored in PCB.

13. (a) Explain ready queue and I/O queue with appropriate sketch of queuing diagram. (b) discuss about message system in interprocess communication

14. (a) Define a deadlock state.(b) Explain the following two options used for recovery from a deadlock state. (i) process termination(ii) resource preemption.

15. (a) explain paging with appropriate diagrams. Give one example (b) Explain briefly the concept of virtual memory.

16. (a) Write the procedure for handling a page-fault. (b) Explain the cause for thrashing.

17. (a) explain linked and indexed file allocation methods. (b) Explain SSTF disk scheduling algorithm.

18. (a) explain in detail about the structure of tree structured directory. (b) explain any four basic file operations.

Home                   

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

D.C.M.E OPERATING SYSTEMS OCT/NOV 2011

C-09-CM-402

3452

BOARD   DIPLOMA   EXAMINATION,   (C-09)

OCTOER/NOVEMBER 2011

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?

2.      What is you mean of distributed systems?

3.      Write the differences between threads and processes.

4.      What does ‘preemptive” mean in the context of scheduling? Give an example.

5.      What is semaphore?

6.      Give examples of non-sharable resoures.

7.      When external fragmentation happens?

8.      What is the cause of thrashing? Briefly explain

9.      What is the problem with FCFS scheduling with disks?

10.  List steps you need to follow to delete a subdirectory in your account.

 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. Describe various types of operating systems.

12. Explain the queuing diagram, with respect to scheduling queues.

13. What is a process? Write about sequential and concurrent processes.

14. Explain the deadlock detection.

15. Explain the optimal page replacement algorithm, with an example.

16. Describe the page-to-frame translation, with appropriate example.

17. Compare the methods of the free disk space management

18. Explain the differences among the file acess methods.

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

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

Diploma OS QUESTION PAPER: Oct/Nov-2012

3456

BOARD DIPLOMA EXAMINATION, (C-09)

Oct/Nov-2012

DCME IV SEMESTER EXAMINATION

OPERATING SYSTEMS

Time : 3 Hours]                                                               [Total Marks: 80

PART-A    10*3=30

Instructions: (1) Answer all questions and each question caries four marks. (2) Answers should be brief and straight to t the point and shall not exceed five simple sentences.

1.       What do you mean by multiprocessor system?

2.       What do you mean by spooling and buffering?

3.       What is meant by shared memory in interprocessor communication?

4.       List the benefits of multithreading programming.

5.       What are the turnaround time and response time?

6.       Consider a system of four of the same type that are shared by the three processor each of the needs most two resources. show that the system is deadlock-free 

7.       How is the page number and offset numbers obtained?

8.       What is the cause of thrashing? How does the system detect threshing? Once it detects thrashing what can the system do to this problem?

9.       What information is needed for disk i/o?

10.   List operations to be performed on directories.

PART-B                                              5*10=50

Instructions: (1) Answer any five questions and each question caries twelve marks. (2) The Answers should be comprehensive and criteria for valuation is the Content but not the length of the answer.

11.   Explain the different types of system calls

12.   Explain  the multilevel queue scheduling

13.   Explain the processes of recovery from deadlocks?

14.   What is the process?

15.   Write about page replacement algorithms

16.   (a) write about the swapping

(b) Write about the single allocation

        17. Explain the disk structure

        18. What are the file operations? Explain them

  

       

What is spooling?

The term "spool" is an acronym of "Simultaneous Peripheral Off-line Output Listing". Spooling is a process of transferring data by placing it in a temporary working area and using it when necessary.

(or)


When a job is executed, the operating system satisfies its requests for cardreader 
input by reading from the disk and when the job requests the printer to 
output a line that line is copied into a system buffer and is written to the disk. 
When the job is completed, the output is actually printed. This form of processing 
is called spooling i.e. simultaneous peripheral operation on-line. Spooling, uses 
the disk as a huge buffer, for reading as far ahead as possible on input devices 
and for storing output files until the output devices are able to accept them. 
Spooling is also used for processing data at remote sites. The CPU sends the 
data via communications paths to a remote printer. The remote processing is 
done at its own speed, with no CPU intervention. The CPU just needs to be 
notified when the processing is completed, so that it can spool the next batch of 
data. 
Spooling overlaps the I/O of one job with the computation of other jobs. Spooling 
has a direct beneficial effect on the performance of the system. Spooling can 
keep both the CPU and the I/O devices working at much higher rates