Recent questions and answers in Operating System

0 votes

1 answer

1

made easy cbt
Consider a machine with byte addressable main memory of 30 bits, block size of 16 bytes and 4-way set associative cache of size 256 byte. For choosing the block to be replaced, use last recently used scheme. The number of cache misses for the following sequence of block addresses is 12, 28, 18, 15, 19, 31, 39, 15, 7, 15 is ________. what is last recently used?

answered 19 hours ago in Operating System by Piyush mishra (383 points) | 25 views

0 votes

2 answers

2

What is the type of loading?
Routine is not loaded until it is called.All routine are kept on disk in a relocatable load format.The main program is loaded into memory and is executed.This type of loading is called as _________ A)Static Loading B)Dynamic Loading C)Dynamic Linking D)Overlays Kindly give explanation /attach references if any.

answered 22 hours ago in Operating System by layan Eysa (11 points) | 467 views

0 votes

0 answers

3

Paging
What is the difference between present - absent bit and valid - invalid bit in a page table ?

asked 1 day ago in Operating System by vivek gupta 3 (31 points) | 29 views

0 votes

1 answer

4

Inter-process Communication
What is zero capacity queue in IPC (OS) ? Thanks!

answered 1 day ago in Operating System by Priyadrasta Raut (313 points) | 18 views

+1 vote

1 answer

5

Is priority inversion and spinlock same?

answered 1 day ago in Operating System by vivek gupta 3 (31 points) | 48 views

0 votes

1 answer

6

NIELIT 2018-48
Decreasing the RAM causes fewer page faults more page faults virtual memory gets increased virtual memory gets decreased

answered 3 days ago in Operating System by Asim Siddiqui 4 Junior (697 points) | 31 views

0 votes

1 answer

7

cpu scheduling
In which of the following case CPU utilization will be higher? (a) If all the processes are I/O bound (b) Is all the processes are equally CPU bound and I/O bound (c) If all the processes are CPU bound (d) Both (B) and (C)

answered 5 days ago in Operating System by pradeepchaudhary Active (1.1k points) | 39 views

0 votes

1 answer

8

#Made Easy Test Series.
Consider the system which has the virtual address of 36 bits and physical address of 30 bits and page size of 8 kb, page table entry contains 1 valid bit, 2 protection bit and 1 reference bit. Then the approximate page table size in MB is_________. My doubt ... entry as nearest bytes, or sometimes we consider it as bits also. If yes, then in what case we take it as bits.

answered 5 days ago in Operating System by manob (41 points) | 44 views

0 votes

3 answers

9

GATE2019-33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory word is addressible. The page size is $8$ kB and the word sixe is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path has $128$ ... any TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$

answered Feb 12 in Operating System by Tuhin Dutta Loyal (9.1k points) | 1.7k views

0 votes

3 answers

10

GATE2019-42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB

answered Feb 11 in Operating System by Tuhin Dutta Loyal (9.1k points) | 2k views

0 votes

2 answers

11

GATE2019-39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ can place a request for at most $Y_i$ additional ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$

answered Feb 11 in Operating System by Tuhin Dutta Loyal (9.1k points) | 1.5k views

+1 vote

2 answers

12

GATEBOOK-2019-OS1-14
The sequence A is an optimal non-preemptive scheduling sequence for the following jobs shown as following three tuples:(job, arrival time, burst time): $(Job_1, 0.0, 9)$ $(Job_2, 0.6, 5)$ $(Job_3, 1.0, 1)$ The schedule A leaves the processor idle for B amount of time. The values of A and B respectively are: $(1,2,3), 7.13$ $(3,2,1), 1$ $(3,2,1), 2.8$ $(1,3,2), 5.8$

answered Feb 10 in Operating System by KULDEEP SINGH 2 Junior (727 points) | 92 views

0 votes

0 answers

13

File System OS
I have completed all required topics of OS for gate. But i feel difficulty to solve problems on file system like file pointers and block size and all that .It's very important topic,i don't want to ignore it. Even i also cover file system from Galvin book, ... pointers and its numerical) . please tell me any link and any authentic pdf or ppt so that first i cover the basics of it.

asked Feb 9 in Operating System by Aks9639 (255 points) | 36 views

+19 votes

5 answers

14

GATE2017-2-07
Which of the following is/are shared by all the threads in a process? Program counter Stack Address space Registers (I) and (II) only (III) only (IV) only (III) and (IV) only

answered Feb 8 in Operating System by Suneel Padala Junior (733 points) | 3.1k views

0 votes

1 answer

15

Minor Clarifications
OS: Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF? Which DISK scheduling algo gives the minimum seek time is it SSTF?

answered Feb 8 in Operating System by Aks9639 (255 points) | 49 views

0 votes

1 answer

16

Operating System :Deadlock :
We know that whenever a process needs i/o time it goes to block/wait state. At that time cpu is idle and it can run other processes. What happens during the deadlock ? In which state do the processes go, so that the cpu freezes ? If all the ... go into block state then why does the cpu freezes ? The cpu should stay idle, but it should not freeze . Can anyone clarify ?

answered Feb 7 in Operating System by superak96 (165 points) | 76 views

+1 vote

2 answers

17

GATE2019-41
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: ... Remaining Time First scheduling algorithm. If the average waiting time of the processes is $1$ millisecond, then the value of $Z$ is _____

answered Feb 7 in Operating System by Ram Swaroop Active (2.2k points) | 1.8k views

+1 vote

2 answers

18

GATE2019-23
Consider three concurrent processes $P1$, $P2$ and $P3$ as shown below, which access a shared variable D that has been initialized to $100$ ... maximum possible values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ____

answered Feb 7 in Operating System by Kaurbaljit Active (1.4k points) | 2.2k views

+1 vote

2 answers

19

Gate 2019- minimum D value in OS concurrent process question
Why the value of D is 80 in concurrent process question and not 0? The question didn't mention that each statement take 3 instruction to execute so why assume that?

answered Feb 6 in Operating System by rbvummadi (57 points) | 549 views

+1 vote

1 answer

20

Operation systems exam 2019
If the memory is 768 MB and the block’s size is 384 Bytes, what will be the size of the bitmap in Bytes? I think it should be 2^21 Bytes, but I’m not quite sure. Could you show me also your solution?

answered Feb 6 in Operating System by sai charan chakrala (265 points) | 110 views

+21 votes

5 answers

21

GATE2015-3-1
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is : $n$ $n^2$ $2^n$ Independent of $n$

answered Feb 6 in Operating System by ayoush chourasia (15 points) | 2.7k views

0 votes

1 answer

22

gate 2019
Value of Z, for SRTF ques? So that WT avg is 1ms?

answered Feb 4 in Operating System by Rakshit Aaryan (31 points) | 363 views

0 votes

0 answers

23

Operation systems 2019
If the memory is 768 MB and the block’s size is 384 Bytes, what will be the size of the bitmap in Bytes? I think it should be 2^21 Bytes, but I’m not quite sure. Could you show me also your solution?

asked Feb 4 in Operating System by Daniel Nikolov (19 points) | 55 views

0 votes

0 answers

24

Gradiance Online Accelerated Learning
Consider a demand-paging system in which a process is allocated three memory frames. When a page fault occurs in the process, let p1, p2 and p3 be the three pages of the process that are resident in memory. Let the timestamps of arrival (i.e., the time at which ... . a) r2 is earlier than a3 b) a3 is later than a1 c) r3 is later than a2 d) a1 is later than r2

asked Feb 4 in Operating System by KULDEEP SINGH 2 Junior (727 points) | 51 views

0 votes

0 answers

25

Gradiance Online Accelerated Learning
In a demand-paging system, let the memory frames be allocated in a global manner across all processes, using a global page-replacement scheme based on the First-In First-Out (FIFO) criterion. That is, whenever a process references a page that is not in memory, ... Reference #8 to page 2 of P1. c) Reference #9 to page 1 of P3. d) Reference #16 to page 1 of P2.

asked Feb 4 in Operating System by KULDEEP SINGH 2 Junior (727 points) | 61 views

0 votes

1 answer

26

GATEBOOK-2019 Mock Test1-17
Which of the following statements is FALSE? Each thread has its own stack Starvation implies deadlock Smaller page size increases the page table size User level process can not modify its own page table entries

answered Feb 4 in Operating System by hermione_3 (15 points) | 93 views

0 votes

0 answers

27

Gate 2019: File Size OS
Assume INODE contains 12 direct pointers, 1 Single Indirect pointers and 1 Doubly Indirect pointer. The block size is 4 kB and pointer size is 32 bits. What is the maximum possible file size?______GB (Round off to 1 decimal places)

asked Feb 4 in Operating System by HeartBleed (485 points) | 276 views

0 votes

1 answer

28

GATE 2019
There was one question of OS : TLB based : what is its answer : 256 x 2^10 ??

answered Feb 4 in Operating System by rakeshcoresoft (227 points) | 237 views

0 votes

0 answers

29

Gate 2019: TAG and Index Bits
Consider the cache memory size of 16 kB, and cache block size is 16 bytes. The processor generates the physical address of 32 bits. Assume the cache is fully associative. What are the TAG and index bits__________ (a) 28 and 4 bits (b) 24 and 4 bits (c) 28 and 0 bits (d) 24 and 0 bits

asked Feb 4 in Operating System by HeartBleed (485 points) | 358 views

0 votes

1 answer

30

Gate cse 2019
What is the answer for TLB question?

answered Feb 4 in Operating System by pream sagar Active (1.7k points) | 1.4k views

0 votes

1 answer

31

gate 2019
Consider the cache memory size of 16kb, and cache block size is 16 bytes. The processor generates the physical address of 32 bits. Assume the cache is fully associative. What are the TAG and index bits __________ (A) 28 and 4bits (B) 28 and 0bits (C) 24 and 4bits (D) 24 and 0bit

answered Feb 3 in Operating System by xdilwar (455 points) | 470 views

0 votes

0 answers

32

Last question please
Why they are not multiplying H1 with T1 And H2 with T2?? please clarify this ASAp

asked Feb 2 in Operating System by saif (427 points) | 66 views

0 votes

0 answers

33

Fork()

asked Feb 2 in Operating System by Na462 Loyal (8.6k points) | 126 views

0 votes

0 answers

34

made easy operating system
Answer is given as 8KB. but i am solving like this overhead = (size of outer level page table)+(size of inner level page table) = 2^12 B + 2^22 B what is wrong in this approach

asked Feb 1 in Operating System by Harshit Bajpai (339 points) | 29 views

0 votes

0 answers

35

#process scheduling
which of the following cause starvation? a->FCFS b->SJF c->RR d->priority

asked Feb 1 in Operating System by Bikash Singh (91 points) | 29 views

+2 votes

1 answer

36

Made Easy CBT
Consider simple paging with TLB. The TLB hit ratio is 60%. If there is hit, it takes 80ns for a memory reference otherwise it takes 130ns for a memory reference. If the Effective memory access time with TLB is 100ns, then the aceess time of TLB is ... is 30ns. They have taken TLB and Mem Access time as memory reference. But I think memory reference should not include TLB access time.

answered Feb 1 in Operating System by Arvnd (189 points) | 128 views

0 votes

0 answers

37

Internal fragmenatation
Memory with fixed partion-Only internal Mem with variable- Only external Paging-Both internal and external(If page size not perfectly diviblr with memory) seg- only external Are these stmts true?

asked Jan 31 in Operating System by Aravind Adithya 1 (213 points) | 14 views

0 votes

0 answers

38

Self dout
Does increasing number of threads decrease total waiting time of the process in terms of round robin scheduling or does it remain the same? Can you please explain why

asked Jan 31 in Operating System by sreenivas.s1995 (113 points) | 37 views

0 votes

2 answers

39

Self Doubt Disk Scheduling
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6, 38, 2, 40, 20. No of seeks in FCFS SSTF

answered Jan 31 in Operating System by Gopi Thawre (19 points) | 79 views

0 votes

1 answer

40

ACE Test Series OS Question
Is this correct? Counting Semaphore can be implemented using a binary semaphore and normal machine instructions.

answered Jan 30 in Operating System by Vignaneswarkrishna (167 points) | 102 views

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

Recent questions and answers in Operating System

Recent Posts

Recent Blog Comments