Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
3Activity
0 of .
Results for:
No results containing your search query
P. 1
NR 220503 Operating System

NR 220503 Operating System

Ratings: (0)|Views: 404|Likes:
Published by Srinivasa Rao G

More info:

Published by: Srinivasa Rao G on Jan 29, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

09/06/2012

pdf

text

original

 
Code No: 220503II B.Tech., II Semester Supplementary Examinations, November-2003OPERATING SYSTEMS(Common to Computer Science and Engineering, Computer Science and InformationTechnology, Computer Science and Systems Engineering)Time:3 hoursMax Marks:80Answer any Five QuestionsAll questions carry equal marks.-----
1.Mention the various registers and their functions under the following categories.(a) User-visible registers(b) Control and status registers.2.a) Explain the reasons for process termination.b)Describe the single blocked queue and multiple blocked queues with and example.3. Using an example get the solution to the mutual exclusion problem by usingSemaphore and explain the process clearly.4. What is deadlock avoidance? Explain process initiation denial and resource allocationdenial in detail with example.5.a) Consider a dynamic partitioning scheme. Prove that on an average the memorycontains half as many holes as segments.b) What are the steps involved in loading a program in memory.c) Compare and Contrast the different approaches to loading.6.a)Which type of process is generally favoured by a multi-level feed back queuingscheduler, a processor bound process or an I/O bound process ?. Briefly explain why? b)Consider a variation of round–robin that we will call priority round-robin. In priorityround-robin each process has a priority in the range of 1 to 10. When a process is given atime slice the length of quantum is basic constant (say 50 ms) times the priority of the job.Compare this system with an ordinary priority system.7.a)What do you understand by a file directory?b)Explain briefly the information elements of a file directoryc)Explain what is tree-structured directory.8.a)Explain the nature of viruses.b)Discuss about various types of viruses.c)Describe the anti-viruse approaches.!!!!!
Set No.
1
 
Code No: 220503II B.Tech., II Semester Supplementary Examinations, November-2003OPERATING SYSTEMS(Common to Computer Science and Engineering, Computer Science and InformationTechnology, Computer Science and Systems Engineering)Time:3 hoursMax Marks:80Answer any Five QuestionsAll questions carry equal marks.----
1.Describe the following :(a) Virtual Memory (b) Cache Memory (c) Auxiliary Memory.2.a)Describe various operations on threads.b)Discuss about threads synchronization.c)Write about Kernel level threads.3. What is a monitor? Compare it with semaphore. Explain in detail a monitor with notifyand broadcast using an example.4.What are the principles of deadlock and explain in detail the two categories oresources.5.a) Explain with a neat sketch.i. Address translation in a segmentation systemii. Address translation in a paging system.6.a)Describe about various disk performance parameters? b)We noted that successive requests are likely to be from the same cylinder. What does thisimply about the expected performance of the FCFS and SSTF disk schedulingalgorithms.7.a)Explain in detail the four terms field, record, file and database with respect to files. b)List the objectives and the requirements for a file management system8.Write notes on :(a) intrusion detection (b) password protection.!!!!!
Set No.
2
 
Code No: 220503II B.Tech., II Semester Supplementary Examinations, November-2003OPERATING SYSTEMS(Common to Computer Science and Engineering, Computer Science and InformationTechnology, Computer Science and Systems Engineering)Time:3 hoursMax Marks:80Answer any Five QuestionsAll questions carry equal marks.----
1.a) DMA access to main memory is given higher priority than processor access to mainmemory. Why? Explain with an example. b)Explain the characteristics of Two level memories.2.a) Define the following:(i) Process (ii) Program (iii) Process state (iv) Process control block (v) Process Scheduling.b)Explain the process State Transition diagram with examples.3. Explain the various mechanisms provided by UNIX for inter processor communication and synchronization in detail.4.a) What are the conditions that must satisfy for deadlock occurrence and explain them.b)Is the deadlocks problem preventable? Justify your answer with example and diagram.5.a) Explain the concept of page buffering. Substantiate its need in paging.b) Discuss the relation between Replacement policy and cache size.c) Enumerate the factors that influence when an Operating System decides thequantum of main memory to be allocated to a particular process.d) Write short notes on fixed allocation.6.Suppose we have a disk with 200 tracks. The disk head starts at track100, and moving inthe direction of decreasing track number. For the following sequence of disk track requests 27, 129, 110, 186, 147, 41, 10, 64, 120, compute the average seek time for thefollowing disk scheduling algorithms FIFO, SSTF, Scan, C-Scan. Queue contains thefollowing request in order at time 0, 27,129,110,186,147, 41, 20, 64, 120. Compute theaverage time to service a request for the disk head scheduling algorithm FCFS.7.Write short notes on:(a) Sequential file (b) Indexed file (c) Indexed sequential file (d) Direct file.8.Write short notes on:(a) Trojan Horse defense (b) Trojan horses.!!!!!
Set No.
3

Activity (3)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
khan.sakeena liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->