0% found this document useful (0 votes)
143 views7 pages

Operating Systems - Set 6 - GeeksforGeeks

The document presents a set of questions related to operating systems, specifically from the GATE 2011 CS exam. It covers topics such as thread management, effective memory access time, disk access time for loading libraries, and scheduling algorithms for processes. Each question includes multiple-choice answers along with explanations for the correct solutions.

Uploaded by

jasmine
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)
143 views7 pages

Operating Systems - Set 6 - GeeksforGeeks

The document presents a set of questions related to operating systems, specifically from the GATE 2011 CS exam. It covers topics such as thread management, effective memory access time, disk access time for loading libraries, and scheduling algorithms for processes. Each question includes multiple-choice answers along with explanations for the correct solutions.

Uploaded by

jasmine
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

6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

Search...

Aptitude Engineering Mathematics Discrete Mathematics Operating System DBMS Computer N

Operating Systems | Set 6


Last Updated : 13 Dec, 2022

Following questions have been asked in GATE 2011 CS exam. 1) A


thread is usually defined as a 'light weight process' because an
operating system (OS) maintains smaller data structures for a thread
than for a process. In relation to this, which of the followings is
TRUE? (A) On per-thread basis, the OS maintains only CPU register
state (B) The OS does not maintain a separate stack for each thread (C)
On per-thread basis, the OS does not maintain virtual memory state (D)
On per thread basis, the OS maintains only scheduling and accounting
information. Answer (C) Threads share address space of Process.
Virtually memory is concerned with processes not with Threads. 2) Let
the page fault service time be 10ms in a computer with average
memory access time being 20ns. If one page fault is generated for
every 10^6 memory accesses, what is the effective access time for
the memory? (A) 21ns (B) 30ns (C) 23ns (D) 35ns Answer (B)

Let P be the page fault rate


Effective Memory Access Time = p * (page fault service time) +
(1 - p) * (Memory access time)
= ( 1/(10^6) )* 10 * (10^6) ns +
(1 - 1/(10^6)) * 20 ns
= 30 ns (approx)

3) An application loads 100 libraries at startup. Loading each library


requires exactly one disk access. The seek time of the disk to a
random location is given as 10ms. Rotational speed of disk is
6000rpm. If all 100 libraries are loaded from random locations on the
disk, how long does it take to load all libraries? (The time to transfer
data
We fromtothe
use cookies disk
ensure you block
have the once the head
best browsing hasonbeen
experience positioned
our website. By using ouratsite,
the you
acknowledge that you have read and understood our Cookie Policy
start of the block may be neglected) (A) 0.50s (B) 1.50s (C) 1.25s (D) & Privacy Policy
1.00s Answer (B) Since transfer Got
timeIt ! can be neglected, the average
https://www.geeksforgeeks.org/operating-systems-set-6/ 1/7
6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

access time is sum of average seek time and average rotational latency.
Average seek time for a random location time is given as 10 ms. The
average rotational latency is half of the time needed for complete
rotation. It is given that 6000 rotations need 1 minute. So one rotation
will take 60/6000 seconds which is 10 ms. Therefore average rotational
latency is half of 10 ms, which is 5ms.

Average disk access time = seek time + rotational latency


= 10 ms + 5 ms
= 15 ms
For 100 libraries, the average disk access time will be 15*100 ms

4. Consider the following table of arrival time and burst time for
three processes P0, P1 and P2.

Process Arrival time Burst Time


P0 0 ms 9 ms
P1 1 ms 4 ms
P2 2 ms 9 ms

The pre-emptive shortest job first scheduling algorithm is used.


Scheduling is carried out only at arrival or completion of processes.
What is the average waiting time for the three processes? (A) 5.0 ms
(B) 4.33 ms (C) 6.33 ms (D) 7.33 ms Answer: - (A) Process P0 is
allocated processor at 0 ms as there is no other process in ready queue.
P0 is preempted after 1 ms as P1 arrives at 1 ms and burst time for P1
is less than remaining time of P0. P1 runs for 4ms. P2 arrived at 2 ms
but P1 continued as burst time of P2 is longer than P1. After P1
completes, P0 is scheduled again as the remaining time for P0 is less
than the burst time of P2. P0 waits for 4 ms, P1 waits for 0 ms and P2
waits for 11 ms. So average waiting time is (0+4+11)/3 = 5. Please see
GATE Corner for all previous year paper/solutions/explanations,
syllabus, important dates, notes, etc. Please write comments if you
find any of the answers/explanations incorrect, or you want to share
more information about the topics discussed above.

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our Cookie Policy & Privacy Policy

https://www.geeksforgeeks.org/operating-systems-set-6/ 2/7
6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

Comment More info


Next Article
Advertise with us Operating Systems | Set 6

Similar Reads
Set Operations
A set is simply a collection of distinct objects. These objects can be
numbers, letters, or even people—anything! We denote a set using curly…

15+ min read

Types of Sets in Set Theory


In mathematics, a Set is a fundamental concept representing a collection
of well-defined objects or elements. Sets are typically denoted by capita…

15+ min read

Hasse Diagrams | Discrete Mathematics


A Hasse diagram is a graphical representation of the relation of elements
of a partially ordered set (poset) with an implied upward orientation. A…

15+ min read

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
Set Notation
acknowledge that you have read and understood our Cookie Policy & Privacy Policy

https://www.geeksforgeeks.org/operating-systems-set-6/ 3/7
6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

Set notation refers to the different symbols used in the representation and
operation of sets. Set notation is a fundamental concept in mathematics,…

15+ min read

Sets in LISP
A set is an unordered collection of items. A set is just like other data
structures. In C++ we have a similar data structure called a hash map.…

15+ min read

Output of Python Programs | Set 24 (Sets)


Prerequisite: Python-Sets 1. What is the output of the code shown below?
Python3 sets = {1, 2, 3, 4, 4} print(sets) Options: {1, 2, 3} {1, 2, 3, 4} {1, 2…

8 min read

Java BitSet | or()


Prerequisite : Java BitSet | Set 1BitSet is a class defined in the java.util
package. It creates an array of bits represented by boolean values. It…

9 min read

Set-Builder Notation
Set-builder Notation is a type of mathematical notation used to describe
sets by naming their components or highlighting the requirements that…

15+ min read

Ruby | Set divide() function


The divide() is an inbuilt method in Ruby returns a set of sets. It is divided
according to the condition that is given by the blocks. In case they donot…

5 min read

Representation of a Set
Sets are defined as collections of well-defined data. In Math, a Set is a
We use cookies to ensure you have the best browsing experience on our website. By using our site, you
tool that helps to classify and collect data belonging to the same…
acknowledge that you have read and understood our Cookie Policy & Privacy Policy
15+ min read

https://www.geeksforgeeks.org/operating-systems-set-6/ 4/7
6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

Corporate & Communications Address:


A-143, 7th Floor, Sovereign Corporate
Tower, Sector- 136, Noida, Uttar Pradesh
(201305)

Registered Address:
K 061, Tower K, Gulshan Vivante
Apartment, Sector 137, Noida, Gautam
Buddh Nagar, Uttar Pradesh, 201305

Advertise with us

Company Explore
About Us Job-A-Thon
Legal Offline Classroom Program
Privacy Policy DSA in JAVA/C++
Careers Master System Design
In Media Master CP
Contact Us Videos
Corporate Solution
Campus Training Program

Tutorials DSA
Python Data Structures
Java Algorithms
C++ DSA for Beginners
PHP Basic DSA Problems
GoLang DSA Roadmap
SQL DSA Interview Questions
R Language Competitive Programming
Android

We use cookiesData Science


to ensure & MLthe best browsing experience on our website.
you have Web Technologies
By using our site, you
Data Science
acknowledge thatWith
youPython HTMLPolicy
have read and understood our Cookie Policy & Privacy
Machine Learning CSS
ML Maths JavaScript
https://www.geeksforgeeks.org/operating-systems-set-6/ 5/7
6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

Data Visualisation TypeScript


Pandas ReactJS
NumPy NextJS
NLP NodeJs
Deep Learning Bootstrap
Tailwind CSS

Python Tutorial Computer Science


Python Examples GATE CS Notes
Django Tutorial Operating Systems
Python Projects Computer Network
Python Tkinter Database Management System
Web Scraping Software Engineering
OpenCV Tutorial Digital Logic Design
Python Interview Question Engineering Maths

DevOps System Design


Git High Level Design
AWS Low Level Design
Docker UML Diagrams
Kubernetes Interview Guide
Azure Design Patterns
GCP OOAD
DevOps Roadmap System Design Bootcamp
Interview Questions

School Subjects Databases


Mathematics SQL
Physics MYSQL
Chemistry PostgreSQL
Biology PL/SQL
Social Science MongoDB
English Grammar

Preparation Corner More Tutorials


Company-Wise Recruitment Process Software Development
Aptitude Preparation Software Testing
Puzzles Product Management
Company-Wise Preparation Project Management
Linux
Excel
All Cheat Sheets

Courses Programming Languages


IBM Certification Courses C Programming with Data Structures
DSA and Placements C++ Programming Course
We use cookies toWeb
ensure you have the best browsing experience on our website.
Development By using our
Java Programming site, you
Course
acknowledge that you
Data Science have read and understood our Cookie Policy & Privacy Policy
Python Full Course
Programming Languages

https://www.geeksforgeeks.org/operating-systems-set-6/ 6/7
6/7/25, 9:28 AM Operating Systems | Set 6 - GeeksforGeeks

DevOps & Cloud

Clouds/Devops GATE 2026


DevOps Engineering GATE CS Rank Booster
AWS Solutions Architect Certification GATE DA Rank Booster
Salesforce Certified Administrator Course GATE CS & IT Course - 2026
GATE DA Course 2026
GATE Rank Predictor

@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our Cookie Policy & Privacy Policy

https://www.geeksforgeeks.org/operating-systems-set-6/ 7/7

You might also like