Recent questions tagged operating-system / GATE Overflow for GATE CSE

2 votes

1 answer

2341

MadeEasy Subject Test: Operating System - Resource Allocation
i m calculating again n again but getting same ans.. what m i missing here pls varify once...

i m calculating again n again but getting same ans.. what m i missing here pls varify once...

S Ram

479 views

S Ram asked Feb 2, 2017

0 votes

0 answers

2342

Memory management

naveen81

1.1k views

naveen81 asked Feb 1, 2017

4 votes

1 answer

2343

MadeEasy Subject Test: Operating System - Process Synchronization
Consider the following code used by the classical readers and writers. Note: rc = rc+1; will execute in 3 instructions like load, increment and then store. Which of the below statement is true, regarding synchronizing the classical ... and (c) are true. I think it should be a but answet is d can somebody provide the simulation

Consider the following code used by the classical readers and writers.Note: rc = rc+1; will execute in 3 instructions like load, increment and then store.Which of the bel...

Pankaj Joshi

1.2k views

Pankaj Joshi asked Feb 1, 2017

0 votes

1 answer

2344

OS-Common Doubt
In Priority scheduling algorithm, higher value of priority gets higher priority or lower value of priority gets higher priority? Means, Priorities: 1,2,3 for Processes-A,B,C Now, execution order will be A-B-C or C-B-A

In Priority scheduling algorithm, higher value of priority gets higher priority or lower value of priority gets higher priority? Means, Priorities: 1,2,3 for Processes-A...

smartmeet

299 views

smartmeet asked Feb 1, 2017

1 votes

1 answer

2345

OS conceptual problem
In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.Time Quantam is 2 unit. So, how many context switch occurs to complete this remaining process?(Ignore previous and last context switch.) A. 0 B. 2 C. 3 D. 4

In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.T...

parthbkgadoya

360 views

parthbkgadoya asked Feb 1, 2017

1 votes

6 answers

2346

UGC NET CSE | January 2017 | Part 3 | Question: 49
A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: 14 and 15 14 and 29 15 and 14 16 and 32

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are ...

go_editor

7.9k views

go_editor asked Jan 31, 2017

0 votes

0 answers

2347

MadeEasy Subject Test: Operating System - Process Synchronization

jatinmittal199510

671 views

jatinmittal199510 asked Jan 31, 2017

6 votes

1 answer

2348

paging with segmentation
Consider a system using segmented paging architecture where both logical address space and physical address space is 64 MB. The logical address space is divided into 8 equal size segments, the segment is divided into equal size pages which are power of 2. The ... be the size of the page of segment in bytes so that the page table of segment exactly fits in one page frame?

Consider a system using segmented paging architecture where both logical address space and physical address space is 64 MB. The logical address space is divided into 8 eq...

DSMaurya

2.0k views

DSMaurya asked Jan 30, 2017

0 votes

0 answers

2349

what is Chandy Lamport's global State Algorithm
Somebody please explain in easy and understandable language what is this Chandy Lamport's global State Algorithm. What is Global state i am not even able to udnerstand . And what is this Lamport global clock somebody please explain in easy words?

Somebody please explain in easy and understandable language what is this Chandy Lamport's global State Algorithm. What is Global state i am not even able to udnerstand .A...

LavTheRawkstar

448 views

LavTheRawkstar asked Jan 30, 2017

1 votes

1 answer

2350

MadeEasy Subject Test: Operating System - Semaphores

vaishali jhalani

606 views

vaishali jhalani asked Jan 30, 2017

0 votes

1 answer

2351

MadeEasy Subject Test: Operating System - Virtual Memory

vaishali jhalani

383 views

vaishali jhalani asked Jan 30, 2017

0 votes

2 answers

2352

Ace Test Series: Operating System - Process Schedule

Meghashyam Sujay

683 views

Meghashyam Sujay asked Jan 30, 2017

0 votes

2 answers

2353

NPTEL-Operating Syste,-Week2-Quiz-1-Q1
Which of the following statements about Softwares is false? System Softwares provide an API that can be accessed by the Application Softwares. DBMS, Compilers, Assemblers are examples of System Software. OS Interface is used by the System Softwares to interact with the hardware/OS. System Softwares can control and coordinate the use of hardware.

Which of the following statements about Softwares is false?System Softwares provide an API that can be accessed by the Application Softwares.DBMS, Compilers, Assemblers a...

Dulqar

895 views

Dulqar asked Jan 30, 2017

4 votes

2 answers

2354

file system
In particular unix OS each data block is of size 1024 bytes each node has 10 direct data blocks and 2-additional addresses one for single indirect block and one for double indirect block. Each block is addressed with 64 byte. The maximum possible size of file in the file system (in KB) is ? My answer:282 answer given 256.? anyone help.

In particular unix OS each data block is of size 1024 bytes each node has 10 direct data blocks and 2-additional addresses one for single indirect block and one for doubl...

reena_kandari

1.7k views

reena_kandari asked Jan 29, 2017

3 votes

2 answers

2355

MadeEasy Subject Test: Operating System - Process Schedule

focus _GATE

532 views

focus _GATE asked Jan 28, 2017

1 votes

2 answers

2356

PTE- paging
consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The minimum size of page table with each entry need 2 protection bits is _____ (in GB) now what should be ... . should i round it to 3bytes and make answer as 48GB or shuld i keep it as it is and write the answer as 44GB?

consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The mi...

Anusha Motamarri

866 views

Anusha Motamarri asked Jan 28, 2017

1 votes

3 answers

2357

Semaphor-Blocked processes
Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. The number of blocked processes at the end are _________. 4 P, 6 V, 9 P, 13 V, 14 P Answer given is 13 How? I am getting 8.

Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed....

reena_kandari

6.2k views

reena_kandari asked Jan 28, 2017

9 votes

4 answers

2358

Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?

Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...

biranchi

4.7k views

biranchi asked Jan 25, 2017

1 votes

2 answers

2359

MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problem How is deadlock possible in this?

Reader Writer's problemHow is deadlock possible in this?

Kai

863 views

Kai asked Jan 24, 2017

1 votes

0 answers

2360

Virtual Gate Test Series: Operating System - Page Replacement
Consider the two-dimensional array A$:$ int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that manipulates the matrix resides in page 0 (locations 0 to 199). ... other two are initially empty? for(int j=0;j<100;j++) for(int i=0;i<100;i++) A[i][j]=0;

Consider the two-dimensional array A$:$int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process...

Samujjal Das

553 views

Samujjal Das asked Jan 24, 2017

2 votes

1 answer

2361

Consider a system with the main memory size of 32MB and each process size 4MB
Consider a system with the main memory size of 32MB and each process size 4MB, if each process spends 80% of its time in doing I/O, what is the CPU utilization percentage? (Assuming there is no virtual memory and ... can perform I/0 in parallel.so at that CPU will be free and therefore its utilisation will be only 20%.

Consider a system with the main memory size of 32MB and each process size 4MB, if each process spends 80% of its time in doing I/O, what is the CPU utilization percentage...

Akriti sood

1.8k views

Akriti sood asked Jan 24, 2017

2 votes

1 answer

2362

Test by Bikram | Mock GATE | Test 2 | Question: 34
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical address space. The system manages an inverted page table, where ... ). Then the size of the basic inverted page table, including page numbers and overhead bits is ________ $bytes$.

Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical ad...

Bikram

876 views

Bikram asked Jan 24, 2017

3 votes

2 answers

2363

Test by Bikram | Mock GATE | Test 2 | Question: 31
Consider the disk drive with the following specification: $16$ surfaces, $1024$ tracks/surface, $1024$ sectors/track, $1KB/sector$, rotation speed is $3000 rpm$ and the disk is operated in burst Mode. The processor runs at ... the size of transferred data is $20KB$. The percentage of processor time consumed for the transfer operation is ________.

Consider the disk drive with the following specification:$16$ surfaces, $1024$ tracks/surface, $1024$ sectors/track, $1KB/sector$, rotation speed is $3000 rpm$ and the di...

Bikram

1.2k views

Bikram asked Jan 24, 2017

2 votes

1 answer

2364

Test by Bikram | Mock GATE | Test 2 | Question: 22
A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track. Consider the following statements: The average latency of the drive is under $6$ $milliseconds$. The burst data rate of the drive is ... . Which of the above statements is/are true? II and III only I, II, and III I and II only II only

A certain hard drive rotates at $6000$ $rpm$. It has $1 KB$ per sector and averages $128$ sectors per track.Consider the following statements:The average latency of the d...

Bikram

509 views

Bikram asked Jan 24, 2017

2 votes

1 answer

2365

Test by Bikram | Mock GATE | Test 2 | Question: 16
While designing a memory management subsystem, a computer hardware manufacturer must decide whether to utilize a partitioning, segmentation, or demand paging strategy. Which of the following statements is/are correct regarding the scenario ? I. Partitioning ... fragmentation. I only I and II only I and III only I, II, and III all are correct

While designing a memory management subsystem, a computer hardware manufacturer must decide whether to utilize a partitioning, segmentation, or demand paging strategy.Whi...

Bikram

590 views

Bikram asked Jan 24, 2017

3 votes

1 answer

2366

Test by Bikram | Mock GATE | Test 2 | Question: 7
While designing a preemptive job scheduling subsystem, an operating system manufacturer must select a scheduling strategy. Which of the following requirements is a reason why round-robin scheduling might be preferred over other scheduling strategies ? The ... must guarantee that if job $J1$ arrives before job $J2$, then $J1$ finishes before $J2$

While designing a preemptive job scheduling subsystem, an operating system manufacturer must select a scheduling strategy. Which of the following requirements is a reason...

Bikram

300 views

Bikram asked Jan 24, 2017

5 votes

3 answers

2367

Test by Bikram | Mock GATE | Test 2 | Question: 2
Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing processes. Deadlock can never occur if resources must be requested in the same order by processes ... then deadlock has certainly occurred. The Banker's algorithm for avoiding deadlock requires knowing resource requirements in advance

Which of the following statements is NOT true? Deadlock can never occur if all resources can be shared by competing proces...

Bikram

952 views

Bikram asked Jan 24, 2017

5 votes

1 answer

2368

Threading in OS [GateBook]

biranchi

711 views

biranchi asked Jan 24, 2017

0 votes

1 answer

2369

TestBook TestSeries
TLB lookup time (th) = 20 ns TLB hit ratio (ht) = 99% Memory access time (ts) = 100 ns Page fault rate (hp) =0.05% Swap page time (in or out) (tp) = 5000,000 ns What is the effective access time (EAT) if we assume that all pages currently in main memory are dirty? 5118.91 ns 51.21 ns 5120.9 ns None of the above

TLB lookup time (th) = 20 nsTLB hit ratio (ht) = 99%Memory access time (ts) = 100 nsPage fault rate (hp) =0.05%Swap page time (in or out) (tp) = 5000,000 nsWhat is the ef...

vnc

733 views

vnc asked Jan 23, 2017

1 votes

2 answers

2370

MadeEasy Subject Test: Operating System - Process Synchronization
Consider the following C' code Assume P1 and P2 are two concurrent processes and sharing the global variables x, y and z. Assignments and tests are atomic. Consider the following statements : S1 : P1 and P2 terminates S2 : ... terminates but P1 does not S4 : Neither P1 nor P2 terminates my answer S1 and S4 but solution is different

Consider the following ‘C’ codeAssume P1 and P2 are two concurrent processes and sharing the global variables x, y and z. Assignmentsand tests are atomic. Consider th...

Pankaj Joshi

1.5k views

Pankaj Joshi asked Jan 23, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true