0% found this document useful (0 votes)
17 views2 pages

TMP 0a5aa7e4

Uploaded by

Disha Davesar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views2 pages

TMP 0a5aa7e4

Uploaded by

Disha Davesar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.

Tech (4th Sem) DEPARTMENT OF


OPERATING SYSTEM COMPUTER SCIENCE AND
AGCS-21404 ENGINEERING
ASSIGNMENT-2

Question Sets

Set 1: Question Number 2,8,13,14,22,28,35,42,45


Set 2: Question Number 5,10,15,20,21,23,36,39,46
Set 3: Question Number 6,9,11,12,24,25,33,38,47

Allocation of Question Sets to students

Set Uni. Roll No.


2233552,556,560,564,566,570,579,586,587,588,589,595,599,600,601,602,605,606,609,611,616,620,621,
1
626
2 2233561,563,568,572,573,575,581,594,612,619
2233550, 551, 554,555,557,558,562,565,567,571,574,576,577,578,580,582, 583,585, 590, 591, 592, 598,
3
603, 604,607, 608,610,613,615,617, 618,622,623,625

MAX MARKS = 24
Q.No Section- A (2 marks each) CO
1 Differentiate between Internal and External Fragmentation with example.
2 Why the page size has to be a power of two?
3 Differentiate between fixed and variable partitioning with example.
4 What are the advantages of virtual memory?
5 Explain Belady’s anomaly page replacement algorithms with example.
6 What is thrashing? How the system doesdetects thrashing? How is this problem eliminated?
7 Differentiate between paging and segmentation scheme of memory management.
8 Explain the TLB mechanism to speed up the process of paging.
Consider the following segment table:
Segment Base Length CO4
0 219 600
1 230 014
9 2 90 100
3 1327 580
4 1952 96
What are the physical addresses for the following logical addresses?
a. 0, 430 b. 1, 10 c. 2, 500 d. 3, 400 e. 4, 112
Calculate the number of bits required in the address for memory having size of 16GB. Assume
10
the memory is 4-byte addressable.
11 Discuss about various file operations?
12 Discuss various issues involved in selecting appropriate disk scheduling algorithm.
13 Differentiate between seek time and rotational latency.
14 Suppose a disk drive has 300 cylinders. The current position of head is 90. The queue of pending
request is 36, 79, 15, 120, 199, 270, 89, and 170. Calculate total head movement for LOOK
algorithms.
15 Explain various file accessing methods. CO5
16 What are the drawbacks in contiguous allocation disk space?
17 What is the primary goal of the SSTF algorithm?
18 Why is disk scheduling important?
19 What are the objectives of file system management?
20 Write a brief note on file system architecture.
21 Describe various security threats in operating system.
22 Differentiate between protection and security.
23 Differentiate between authentication and authorization.
24 Explain i) Trojan Horse and ii) Trap door threats.
25 Discuss about the access matrix model used for protection purpose.
26 Explain the terms ‘WORMS’ and ‘VIRUSES’ with reference to system threats.
27 Explain different methods used to solve the problem of security at the operating system level.
28 What are the main differences between capability list and access list? CO6
29 In a multiprogramming and time sharing system several users share the system simultaneously.
What are the various security problems in such system? Can we have same degree of security as
in a dedicated machine?
30 Explain the features of LINUX operating system.
Section-B (4 marks each)
31 What is paging? What is the role of page table in paging? Explain the conversion of virtual
address to physical address in paging with example.
32 Calculate the page fault rates for below reference string in case of FIFO and Optimal page
replacement algorithm. Assume the memory size is 4 page frames and all frames are initially
empty. 0,2,1,6,4,0,1,0,3,1,2,1
33 Consider the following page reference string:
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2
With four frames how many page faults would occur for Optimal and LRU page replacement
algorithms? Which algorithm is efficient? (assume all frames are initially empty)
34 Given six Partition of 300KB, 600KB, 350KB, 200KB, 750KB and 125KB(in order), how would
the first-fit, best-fit and worst-fit algorithms places processes of size 115 KB, 500KB, 358KB,
200KB and 375KB (in order)? Which of these algorithms is more efficient?
35 Explain the structure of a page table entry. If a machine has 48 bit virtual addresses and 32-bit CO4
physical addresses and pages are of 8 KB, how many entries are needed for the page table?
36 Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100 KB, S3=580 KB,
and S4 = 96 KB. Assume at that time, the available free space partitions of memory are
1200–1805, 50 – 150, 220-234, and 2500-3180. Find the following:
1. Draw logical to physical maps and segment table?
2. Allocate space for each segment in memory?
3. Calculate the external fragmentation and the internal fragmentation?
4. What are the addresses in physical memory for the following logical addresses?
(a) 0, 580 (b) 1, 17 (c) 2, 66 (d) 3, 82 (e) 4, 20
37 What do you mean by file management? Explain the various file allocation methods in detail.
38 Suppose a disk drive has 300 cylinders. The current position of head is 90. The queue of pending
request is 36,79,15,120,199,270,89,170 Calculate the head movement for the following
algorithms. 1. FCFS 2. SSTF
39 Suppose a disk drive has 5000 cylinders, numbered 0 to 4999. The current head position is at
cylinder 143. The queue of pending requests is: 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130.
What is the total distance that the disk arm moves to satisfy all the pending requests for LOOK
and SCAN?
40 Is disk scheduling, other than FCFS scheduling, useful in a single-user environment? Justify your CO5
answer.
41 Explain different free space management techniques in detail.
42 Consider the given track requests in the disk queue95, 180, 34, 119, 11, 123, 62, and 64.
Compute for the total head movement (THM) of the read/write head for a) First come first serve
b) C-SCAN
43 How does operating system prevent or detect malware infection and what measures can be take to
enhance malware protection?
44 Explain the security levels provided in Linux environment. How are permissions of a file
changed?
45 Discus about the structures of the UNIX file system and LINUX file system. Compare them. CO6
46 Explain protection mechanism illustrating use of protection domain and access control list.
47 Explain the security attacks on operating system.
48 Compare and contrast the terms external and operational security in context of operating systems.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy