menu
search
Log In
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users 2021 Aug 02 - 08
  1. SarathBaswa

    6 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Recent questions and answers in Operating System

Recent questions and answers in Operating System

0 votes
1 answer 173 views
GATE CS 2013 | Question 65
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of ... 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797 KB is ... is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
answered 13 hours ago in Operating System asqwer 633 points 173 views
0 votes
1 answer 5 views
ISI Entrance
Let s and t be two semaphores initialised to 1 and 0, respectively. Two threads T1 and T2 each execute the code shown below. 1: P(s) 2: V(s) 3: P(t) 4: V(t) (i) Does there exist an interleaving for which at least one of the ... justify your answer. (ii) What change(s) in the initial values assigned to the semaphores will guarantee that both threads will always progress to completion?
Let s and t be two semaphores initialised to 1 and 0, respectively. Two threads T1 and T2 each execute the code shown below. 1: P(s) 2: V(s) 3: P(t) 4: V(t) (i) Does there exist an interleaving for which at least one of the ... Clearly justify your answer. (ii) What change(s) in the initial values assigned to the semaphores will guarantee that both threads will always progress to completion?
answered 13 hours ago in Operating System asqwer 633 points 5 views
0 votes
1 answer 29 views
Self doubt memory management
Logical add= segment no.+ Offset my question is offset calculation how does it
Logical add= segment no.+ Offset my question is offset calculation how does it
answered Jul 22 in Operating System asqwer 633 points 29 views
0 votes
1 answer 16 views
Scheduling algorithm in Operating System
How do we categorize a scheduling algorithm as CPU bound or I/O bound?
How do we categorize a scheduling algorithm as CPU bound or I/O bound?
answered Jul 20 in Operating System asqwer 633 points 16 views
0 votes
1 answer 33 views
Virtual memory - Self doubt
I have been studying the virtual memory concept in Operating Systems. I understand that : Each process is given its own virtual address space - which might be very larger than the physical address space - to execute. If the processes cannot accommodate its pages in the ... process is $2^{64}$), but obviously my secondary memory is not $2^{64}$ bytes. What am I missing?
I have been studying the virtual memory concept in Operating Systems. I understand that : Each process is given its own virtual address space - which might be very larger than the physical address space - to execute. If the processes cannot accommodate its pages in the main memory, we ... with each process is $2^{64}$), but obviously my secondary memory is not $2^{64}$ bytes. What am I missing?
answered Jul 20 in Operating System asqwer 633 points 33 views
0 votes
1 answer 37 views
Galvin 7th edition page 350
Using a page size of 4 bytes and a physical memory of 32 bytes (8 pages)! we show how the user's view of memory can be mapped into physical memory. Logical address 0 is page O! offset O. Indexing into the page table! we find that page 0 is in frame ... mapped to frame 6. Thus, logical address 4 maps to physical address 24 (= (6 x 4) + 0). This is from Galvin please xpln
Using a page size of 4 bytes and a physical memory of 32 bytes (8 pages)! we show how the user's view of memory can be mapped into physical memory. Logical address 0 is page O! offset O. Indexing into the page table! we find that page 0 is in frame 5. Thus! logical ... 1 is mapped to frame 6. Thus, logical address 4 maps to physical address 24 (= (6 x 4) + 0). This is from Galvin please xpln
answered Jul 20 in Operating System asqwer 633 points 37 views
0 votes
1 answer 30 views
#study-resource #self-doubt Concurrency In Operating systems
Hi where to study “concurrency in os” from ? cause in galvin i cant find concurrency topic so what chapter concurrency have in galvin. thank you please reply fast as possible i ma stuck in between
answered Jul 4 in Operating System afroze 7 points 30 views
0 votes
0 answers 18 views
OPERTING SYSTEM SELF RELOACTING
WHY SELF Relocating program LESS EFFICIENT THAN RELOCATABLE PROGRAM?
WHY SELF Relocating program LESS EFFICIENT THAN RELOCATABLE PROGRAM?
asked Jun 28 in Operating System NITESH 766 5 points 18 views
0 votes
0 answers 8 views
Galvin chapter -11 section 11.7 Recovery
hi this “recovery” topic in chapter 11 is necessary for os in gate or it is compulsory for doing for gate or can we skip this section. thank you
hi this “recovery” topic in chapter 11 is necessary for os in gate or it is compulsory for doing for gate or can we skip this section. thank you
asked Jun 24 in Operating System ykrishnay 103 points 8 views
0 votes
0 answers 11 views
I/O Scheduling in Operating system Gate 2021 Update #source #self-doubt
hi where to study I/O scheduling, I follow galvin so which chapter have I/O scheduling. or any other resource where i study I/O Scheduling thank you
asked Jun 24 in Operating System ykrishnay 103 points 11 views
0 votes
0 answers 16 views
self doubght
what is difference between preemption and inturrupts on process state diagram
what is difference between preemption and inturrupts on process state diagram
asked Jun 17 in Operating System Sachin85 5 points 16 views
0 votes
1 answer 18 views
1.GeeksforGeeks
operating-system cpu-scheduling . someone please guide me how to approach this problem.
operating-system cpu-scheduling . someone please guide me how to approach this problem.
answered Jun 16 in Operating System Pratiksha Hegde 11 points 18 views
0 votes
0 answers 17 views
Process management
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
asked Jun 12 in Operating System Vink7389 9 points 17 views
0 votes
0 answers 18 views
This question is related to Intrested Variable Mechnanism in Operating System.
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical Section */ wants1 = false; } /* ... IT IS WRITTEN PROGRESS IS THERE? In the case when both wants1 and wants2 are true it will indefinitely be postponed then why progress is there?
asked Jun 10 in Operating System anupam_12 5 points 18 views
0 votes
1 answer 28 views
Galvin chapter 4 threading issues
If one thread in program calls fork(), does the new process duplicate all threads or single thread
If one thread in program calls fork(), does the new process duplicate all threads or single thread
answered Jun 1 in Operating System Papun417 5 points 28 views
0 votes
0 answers 10 views
System calls are onto or one to one?
asked May 27 in Operating System afroze 7 points 10 views
0 votes
1 answer 24 views
virtual memory
i have one doubt regarding virtual memory. where does virtual address space reside is it in ram or hdd? if it is in ram then how does mapping happen?
i have one doubt regarding virtual memory. where does virtual address space reside is it in ram or hdd? if it is in ram then how does mapping happen?
answered May 18 in Operating System aryavart 73 points 24 views
0 votes
1 answer 27 views
Fixed Block File System
Using large file block size in a fixed block file system leads to better disk throughput but poor disk Space utilization. Is this statement true ?? What is the meaning of throughput here ??
Using large file block size in a fixed block file system leads to better disk throughput but poor disk Space utilization. Is this statement true ?? What is the meaning of throughput here ??
answered May 18 in Operating System aryavart 73 points 27 views
0 votes
1 answer 21 views
Exam operating system
When switching the CPU between two processes.. which of the following applies A. The PCB is both, saved and reloaded, only for the interrupted process that is existing the CPU B. The PCB is saved for the process that is scheduled for the CPU C. The PCB is reloaded for the process that is scheduled for the CPU D. No PCB is saved or reloaded E. None of the above
When switching the CPU between two processes.. which of the following applies A. The PCB is both, saved and reloaded, only for the interrupted process that is existing the CPU B. The PCB is saved for the process that is scheduled for the CPU C. The PCB is reloaded for the process that is scheduled for the CPU D. No PCB is saved or reloaded E. None of the above
answered May 6 in Operating System aryavart 73 points 21 views
0 votes
1 answer 35 views
CPU Scheduling
Is context switching time and dispatch latency same?
Is context switching time and dispatch latency same?
answered May 6 in Operating System aryavart 73 points 35 views
0 votes
0 answers 25 views
Gate previous year question
User level threads are transparent to the kernel. This statement true or false ? Os don't know about the user leval threads because it is treated as process then why this is true ?
User level threads are transparent to the kernel. This statement true or false ? Os don't know about the user leval threads because it is treated as process then why this is true ?
asked Apr 30 in Operating System Enolx.21 53 points 25 views
0 votes
1 answer 27 views
#Memory Management
1.In case of fixed partition/variable partition, suppose all holes(say 5 holes) are filled and one hole is of size 5kb and there we stored a 4kb process so here it will be of internal fragmentation of 1kb so can we also conclude here ... in memory then external fragmentation must be there but if there is external fragmentation in memory there need not be internal fragmentation??
1.In case of fixed partition/variable partition, suppose all holes(say 5 holes) are filled and one hole is of size 5kb and there we stored a 4kb process so here it will be of internal fragmentation of 1kb so can we also conclude here that ... fragmentation in memory then external fragmentation must be there but if there is external fragmentation in memory there need not be internal fragmentation??
answered Apr 28 in Operating System Enolx.21 53 points 27 views
0 votes
1 answer 33 views
Operation system self dout
Q. consider a system with 2k pages ,512 frames ,pa=22 bits. calculate the page table size in bytes?
Q. consider a system with 2k pages ,512 frames ,pa=22 bits. calculate the page table size in bytes?
answered Apr 28 in Operating System Shiva Sagar Rao 35 points 33 views
0 votes
0 answers 35 views
https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html
source: https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html The question : In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for ... that using my approach above I should get an answer that is at least close to the given answer. However that is not the case. Please help.
asked Apr 13 in Operating System Pranavapp 5 points 35 views
0 votes
0 answers 28 views
https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html
The question : In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for the first level and so on. What is the size of a page table ... 32. Which is way more than expected. Can someone please point out where I am making the mistake? Also can someone please clarify what does PTE hold?
asked Apr 13 in Operating System Pranavapp 5 points 28 views
0 votes
1 answer 43 views
Simple-paging
What happen if page size and frame size are not equal? will it failed to map logical address to physical address.
What happen if page size and frame size are not equal? will it failed to map logical address to physical address.
answered Apr 3 in Operating System aryavart 73 points 43 views
0 votes
0 answers 13 views
Gate 2019 Mining Question 19
If the time to failure of a machine component is exponentially distributed, the reliability of the same at Mean Time to Failure (MTTF) is ____
If the time to failure of a machine component is exponentially distributed, the reliability of the same at Mean Time to Failure (MTTF) is ____
asked Mar 22 in Operating System kartikb94 5 points 13 views
2 votes
0 answers 36 views
Paging. Self-Doubt
Here I solved this in this way .. Since the virtual address space is 32-bit long and the first 8 bit specifies the first-level index. Next is the Offset of the page which is 12 from the first line. Coincidently, 20 bit are still left here and it ... this might be the answer. For reference, the answer to the solution is given . Thanks in advance. Is my approach wrong or correct?
Here I solved this in this way .. Since the virtual address space is 32-bit long and the first 8 bit specifies the first-level index. Next is the Offset of the page which is 12 from the first line. Coincidently, 20 bit are still left here and it turns out ... thought this might be the answer. For reference, the answer to the solution is given . Thanks in advance. Is my approach wrong or correct?
asked Mar 20 in Operating System kirtipurohit 15 points 36 views
1 vote
0 answers 33 views
Process Synchronization - Test and Set Variable Method
I am making a simulator for the test and set variable method of process synchronization, where the user enters the number of processes and their progression is shown. It works by making a thread for each process which progress simultaneously and pass through a critical ... not clear about that concept. I don't understand why it does not progress even though there is no other thread executing.
asked Mar 17 in Operating System nikhil189 9 points 33 views
0 votes
0 answers 14 views
Process Synchronization
Does starvation mean that the thread has to keep waiting but it will eventually get executed, or does it mean that it will stop trying to execute after a certain point?
Does starvation mean that the thread has to keep waiting but it will eventually get executed, or does it mean that it will stop trying to execute after a certain point?
asked Mar 17 in Operating System nikhil189 9 points 14 views
0 votes
0 answers 19 views
#paging #operatingsystem #gateCSE #gateOperatingSystem
While paging, does frame size give -“d” (offset) or no. of frames give -“d” (offset) in Logical address generated by CPU, of format : p d and also is it applicable in concepts- multilevel paging, segmentation ?
asked Feb 21 in Operating System cheNavya 5 points 19 views
1 vote
1 answer 845 views
GATE CSE 2021 Set 2 | Question: 14 | Video Solution
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy can be used even when the $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support
asked Feb 18 in Operating System Arjun 1.5k points 845 views
2 votes
1 answer 855 views
GATE CSE 2021 Set 2 | Question: 21 | Video Solution
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}$. The size of a record pointer for this disk is $7$ bytes. Each student-record has ... disk. Assume that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________
asked Feb 18 in Operating System Arjun 1.5k points 855 views
1 vote
3 answers 1K views
GATE CSE 2021 Set 2 | Question: 42 | Video Solution
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a thread to execute foo() ... will print the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$
asked Feb 18 in Operating System Arjun 1.5k points 1K views
3 votes
1 answer 865 views
GATE CSE 2021 Set 2 | Question: 43 | Video Solution
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock $(L)$. The following scheme ... deadlocks will not occur The scheme may lead to live-lock The scheme may lead to starvation The scheme violates the mutual exclusion property
asked Feb 18 in Operating System Arjun 1.5k points 865 views
7 votes
3 answers 1.8K views
GATE CSE 2021 Set 2 | Question: 48 | Video Solution
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below: The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$)$ and page table entry size at every level is $8$ bytes. A process $P$ is currently ... $2\text{GB}$ of physical memory. The minimum amount of memory required for the page table of $P$ across all levels is _________ $\text{KB}$.
asked Feb 18 in Operating System Arjun 1.5k points 1.8K views
2 votes
2 answers 1.2K views
GATE CSE 2021 Set 1 | Question: 11 | Video Solution
In the context of operating systems, which of the following statements is/are correct with respect to paging? Paging helps solve the issue of external fragmentation Page size has no impact on internal fragmentation Paging incurs memory overheads Multi-level paging is necessary to support pages of different sizes
asked Feb 18 in Operating System Arjun 1.5k points 1.2K views
3 votes
3 answers 1.6K views
GATE CSE 2021 Set 1 | Question: 14 | Video Solution
Which of the following standard $C$ library functions will always invoke a system call when executed from a single-threaded process in a $\text{UNIX/Linux}$ operating system? $\textsf{exit}$ $\textsf{malloc}$ $\textsf{sleep}$ $\textsf{strlen}$
asked Feb 18 in Operating System Arjun 1.5k points 1.6K views
1 vote
1 answer 975 views
GATE CSE 2021 Set 1 | Question: 15 | Video Solution
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory $\textsf{foo}$. Which of ... file from $\textsf{foo}$ Renaming of an existing file in $\textsf{foo}$ Opening of an existing file in $\textsf{foo}$
asked Feb 18 in Operating System Arjun 1.5k points 975 views
To see more, click for all the questions in this category.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...