Sunday, February 24, 2013
VU-MCS-MIT cs604 FINAL TERM Paper 23-02-2013
http://vuplanet.com/cs604-final-term-23-02-2013-11am/
--
---
You received this message because you are subscribed to the Google Groups "VU-MCS-MIT" group.
To unsubscribe from this group and stop receiving emails from it, send an email to vu-mcs-mit+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
Subscribe to:
Post Comments (Atom)
23-02-2013
ReplyDeleteSUBJECTIVE
QNo.1 Name of three major frame allocation schemes?
QNo.2 how to protection of files and giving access to be secured in UNIX ?
QNo.3 what is lazy analyzer that is use in virtual memory?
QNo.4 Differentiate between Cache and CPU Register ?
QNo.5 what is Index Allocation Method?
QNo.6 Define and briefly describe what is memory mapping system calls?
QNo.7 Hardware required for swapping, paging and demand paging
QNo.8 What are the file structures, define its protection.
QNo.9 Differentiate between logical and physical address.
Today Final Term Paper Fall 2012
On 21 Feb 2013
Total Questions: 52
Total Marks: 80
Total MCQs: 40 (Each of 1 Mark)
Total Short Questions: 4 (Each of 2 Mark)
Total Short Questions: 4 (Each of 3 Mark)
Total Long Questions: 4 (Each of 5 Mark)
1.Write the names of common file structures. (2)
2.Which part of compiler/assembler perform the task of taking one or more objects generated and assemble them in to a single executable program. (2)
3.Write the method through which Linus/Unix commands can communicate with each other. (2)
4.Consider a process having its segment 15 having 5096 bytes. The process generates a logical address (15, 3921). What page does the logical address refers to? (2)
5.What is mounting? Name its two types. (3)
6.Same question as question no 4. (3)
7.Which term is best suited for the situation where several process access and manipulate shared data concruntly and final value of data depends which process finishes last. (3)
8.What is difference between deadlock avoidance and deadlock prevention. (3)
9.name two schemes for keeping track of free blocks and one advantage of each. (5)
10.Differentiate between logical and physical address. (5)
11. identify the necessary information that must be stored in process control block during the execution of program. (5)
12.What steps are needed for page replacement. (5)
Today Final Term Paper Fall 2012
On 21 Feb 2013
Total Questions: 52
Total Marks: 80
Total MCQs: 40 (Each of 1 Mark)
Total Short Questions: 4 (Each of 2 Mark)
Total Short Questions: 4 (Each of 3 Mark)
Total Long Questions: 4 (Each of 5 Mark)
i) reentrant code?
ii) banker's algorithm
iii) copy-on-write w.r.t virtual memory
iv) diff b\w logical n physical adress
v) free frames allocation schemes
vi) sort w.r.t response time 0. Fisrt In First Out 1.priority based 2.multi level queue
vii) IPC tool BSD socket
viii) access modes n classes of users in UNIX
ix) file is volatile or nonvolatile?
x)FIFO page replacement algorithm
xi) Belady's anamoly
xii) structure of software based sceduling algorithms