Code No.311301 III/IV B.Tech. I-Semester Examination November 2002

Set No.

COMPUTER OPERATING SYSTEMS (Electronics Control Engineering)

Max.Marks:80 Answer any Five questions All questions carry equal Marks ---

.in

Time: 3 hours

Describe Operating System concepts.

2.

What is Multi Processor? Explain virtual machine.

3.

Describe SJN scheduling with example.

4.

Describe the page replacement algorithms.

5.

What is Device Scheduling?

6.

What is Deal lock? Describe detection and recovery?

7.

What is concurrent processes? Explain inter-processor communication.

8. a) b) c)

Write short note on the following: Semaphores Thrashing Swaping

uW

or ld

1.

nt

***

Aj

1

***

***

Code No.311301 III/IV B.Tech. I-Semester Examination November 2002 COMPUTER OPERATING SYSTEMS (Electronics Control Engineering)

2

Max.Marks:80 Answer any Five questions All questions carry equal Marks ---

.in

Time: 3 hours

Set No.

1.

What is file system? Describe File protection.

2.

What are the scheduling objectives? example.

3.

Describe scheduling in Multiprocessor Operating System.

4.

What is virtual memory? Explain virtual memory using paging.

5.

What is page replacement? Describe page replacement algorithms.

6.

What is scheduling? Describe scheduling algorithms.

7.

What is Semaphores? Explain critical section implementation with Semaphores.

8. a) b) c)

Write short note on the following: Demand Paging Thrashing Protection problems

uW

or ld

Describe Deadline Scheduling with

Aj

nt

***

***

***

Code No.311301 III/IV B.Tech. I-Semester Examination November 2002 COMPUTER OPERATING SYSTEMS (Electronics Control Engineering)

3

Max.Marks:80 Answer any Five questions All questions carry equal Marks ---

.in

Time: 3 hours

Set No.

Describe Multiprogramming and Time sharing.

2.

What is file system? Describe allocation methods.

3.

Describe Virtual Memory Management.

4.

Describe LRU page replacement with example.

5.

Define scheduling and notation. Explain FCFS scheduling with example.

6.

What is deadlock avoidance? Write Banker’s algorithm.

7.

What is critical section? Write Dekker’s algorithm.

8. a) b) c)

Write short note on the following: Bare machine Page segmentation Semaphores

uW

or ld

1.

Aj

nt

***

***

***

Code No.311301 III/IV B.Tech. I-Semester Examination November 2002

Set No.

COMPUTER OPERATING SYSTEMS (Electronics Control Engineering)

Max.Marks:80 Answer any Five questions All questions carry equal Marks ---

.in

Time: 3 hours

4

What is file system? Describe access methods.

2.

What is processor scheduling? Describe critical scheduling algorithms.

3.

What is page replacement? Describe optimal page replacement with example.

4.

What is Device scheduling? Describe characteristics of scheduling policies.

5.

Write Banker’s algorithm.

6.

What is critical section? Write Dekker’s algorithm.

7.

What is protection? Describe the protection problems.

8. a) b) c)

Write short notes on the following: Time sharing Multiprocessor scheduling Demand paging

uW

or ld

1.

Aj

nt

***

***

***