Quick Links
| University Papers | University Syllabus | Entrance Exam |
| PSU Papers | Bank Papers | Placement Papers |
| VTU | Anna Univerity Syllabus | Anna Univerity Papers |
Anna University Question Paper
Computer Science and Engineering
CS2254-Operating Systems
Fourth Semester
May/June 2014 Question Paper
University Papers | Syllabus | Entrance Exam | Govt & PSU Papers | Bank Papers
Programming Questions | Travel Tips | Mobile Review | Placement Papers
ANNA UNIVERSITY SYLLABUS: CLICK HERE
PART-A
1.Can multiple user level threads achieve better performance on a multiprocessor system than a single processor system? Justify your answer.
2.Mention the circumferences that would a user be better off using a time-sharing system rather than a PC or a single user workstation ?
3.Write the four situations under which CPU scheduling decisions take place .
4.show that mutual exclusion may be violated if the signal and wait operations are not executed automatically.
5.Consider a logical address space of eight pages of 1024 words ach ,mapped on to a physical memory of 32 frames.Find the number of bits in the logical address and the physical address.
6.Define virtual memory.
7.List the attributes of a file.
8.What are the information contained in a boot control block and partition control block?
9.What is meant by polling?
10.State any three disadvantages of placing functionality in a device controller ,rather than in the kernel.
PART-B
11.a)1.Explain the purpose of system calls and discuss the calls related to device management and communications in brief. (8)
2.Discuss the different multithreading models along with their issues. (8)
Or
b)1.Explain the concept of virtual machines ,their implementation and benefits in detail. (8)
2)Discuss the execution of remote procedure call and remote method innovation within supporting diagrams. (8)
12.a)Discuss how scheduling algorithms are selected for a system.What are the criteria considered ? Explain different evaluation methods. (16)
Or
Consider the following system :
P0-P4 are 5 processes present and A,B,C,D are resources .The maximum need of a process and the allocated resources detailes are given in the table.
Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 5 0
P2 1 3 5 4 2 5 6
P3 0 6 3 2 0 5 2
P$ 0 0 1 4 0 5 6
Answer the following based on banker’s algorithm
1)What is the content of NEED matrix?
2)Is thesystem in a safe state?
3.Which processes may cause deadlock if the file system is not safe.
4)If a request from processes P1 arrives for (0,4,3,1) can the request be granted immediately?justify.
13.a.1)Why are transition look aside bufferes important? Explain the etailes stored in a TLBtable ntry?(8)
2)Explain the concept of demand paging in detail with neat diagrams. (8)
Or
b)1)Explain any two structures of the page table with neat diagrams. (8)
2)Consider the following pagereference string:
1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6 How many page faults would occur for the LRU,FIFO,LFU and optimal page replacement algorithms assuming two and five frames? (8)
14.a)1)Explain the common schemes for defining the logical structure of a directory.
(8)
2)Explain how file system management is done in Linux. (8)
Or
b)1)Explain the different file access methods in detail. (8)
2) Discuss how file system is implemented in Windows XP. (8
15.a)1)Write a brief note on the steps involved in DMA transfer. (8)
2)Explain the data structures supported by kernel I/O subsystem. (8)
Or
b)1)Describe any three disk scheduling algorithms with suitable illustrations. (12)
2)Write a brief note on tertiary storage devices. (4)
0 Comments