Register
Webpage for Operating System

Recent questions tagged operating-system

4
views
0 answers
0 votes
Paging/Mapping
If a page of a process is in secondary memory but not in main memory then what should be it's page table entry.Then how logical address is ... in calculating effective memory access time formula. This is problem of paging or mapping?
User Avatar
17
views
0 answers
0 votes
Unacademy test series
Consider a system with 4KB page size and 3-level paging is used. The virtual address space is 36 bits and the physical address space is 32 bits. The page table ... 8 bits for page table indexing and each page table fits one page-frame[NAT]
User Avatar
46
views
1 answers
0 votes
fork() system call
How many child processes will be created in the following code: main(){if(!fork()){ if(!fork()) fork();}fork();}
User Avatar
62
views
0 answers
0 votes
Operating-system: Scheduling Algorithms
six jobs are waiting to be run . the expected running times are 9,7,5,2,1 and x respectively. where 5<x<7 & the average comp.time is 13. find the value of x using sjf algorithm?
User Avatar
81
views
0 answers
1 votes
Operating System - Trap and Interrupts
Which of the following statements is/are true regarding how the trap instruction (e.g., int n in x86) is invoked when a trap occurs in a system? When ... , the trap instruction is invoked by the user process that raised the I/O request
User Avatar
71
views
0 answers
0 votes
#Operating System-GATE
Consider a process P in xv6 that invokes the wait system call. Which of the following statements is/are true? If P does not have any zombie children, then ... the wait system call reaps all the zombie children of P and returns immediately.
User Avatar
141
views
0 answers
2 votes
Memory Management
Consider a 32-bit computer with page size 2KB and physical memory of 32 GB. Each virtual page has additional 8 bits for hardware control. The computer has a two-level page table. The ... page table entry is: (A) 24 (B) 32 (C) 40 (D) 16
User Avatar
145
views
1 answers
0 votes
Test Series
User Avatar
109
views
1 answers
0 votes
Test Series
User Avatar
64
views
0 answers
0 votes
UGC NET CSE
Given as 4 GB (4.3X10^9 bytes) of virtual space and typical page size of 4KB and each page table entry is 5 bytes. How many virtual pages would this ... and 20480 bytes2. 215000 and 40960 bytes3. 10750 and 10240 bytes4. 43000 and 1024 bytes
User Avatar
103
views
0 answers
0 votes
operating system test series
why??
User Avatar
137
views
0 answers
0 votes
Operating System Concept
A system with 2-level page table, the frame size is 4KB; the address register is 32 bits, the row size of the page table is 4 bytes; the address register is divided into (p1, p2, ... Select one:(0, 1, 256)(1, 0, 256)(2, 0, 256)(0, 2, 256)
User Avatar
171
views
1 answers
0 votes
gate zeal
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others ... n. (d) The barrier implementation is correct for the set of n processes
User Avatar
195
views
1 answers
0 votes
Testbook question
Consider a computer C1 has n CPUs and k processes. Which of the following statements are False?a). The maximum number of processes in ready state is K.b). The ... running state is K.d). The maximum number of processes in running state is n.
User Avatar
284
views
2 answers
0 votes
virtual address translation
A paging system uses 16 bit address and 4K page. The following shows the page table of a process 1.Page No Frame No0 ... a virtual address 16064 the physical address of the process isA) 40968) 3712C) 8192D) 11,968
User Avatar
129
views
0 answers
1 votes
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory ... a) 9 and 7(b) 7 and 9(c) 10 and 12(d) 6 and 7
User Avatar
97
views
0 answers
0 votes
OS | File Management | Made Easy Q105
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum ... in the difference between I-Node disk block size and the given disk block size.
User Avatar
392
views
1 answers
0 votes
Segmentation
Consider the following segment table: Segment No.BaseLength02196001230014290100313275804195296 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
User Avatar
115
views
0 answers
0 votes
Memory Bottleneck
Describe the bottleneck between the main memory and the CPU, and state how the bottleneck is resolved
User Avatar
223
views
1 answers
0 votes
CPU Scheduling
Hi, All I have a question that in Process Scheduling topic most of the time we need to solve the problem using Gantt chart that's a bit time ... there any faster way to get solutions . Please provide any resource if available.Thanks
User Avatar
710
views
1 answers
1 votes
Contiguous memory allocation
Consider a system with 32 KB of physical memory and the following memory allocation requests from processes: Process P1 requests 10 KB of memory. Process P2 ... allocation techniques: 1. First Fit 2. Best Fit 3. Worst Fit
User Avatar
142
views
0 answers
1 votes
Andrew S. Tanenbaum (MOS) Edition 5 Exercise 3 Question 16 (Page No. 252)
The 32-bit Linux kernel supports a maximum of 32768 processes in the process table, and the kernel is allocated 1,073,741,824 (1 GiB) of the virtual ... allocated to each process at a minimum, with the maximum number of processes running?
User Avatar
429
views
1 answers
2 votes
fork() system call
Consider the following pieces of codes for fork( ) system call. Solve and explain how many child processes are created upon execution of this program? Snippet 1: ... 0; }Learning Outcomes. Understand the working of fork ( ) system call.
User Avatar
110
views
0 answers
0 votes
Operating system concepts 9th edition Abdraham Silberschatz
Write a monitor to solve the consumer-producer problem. Thebasic program structure is shown as follows.monitor ProducerConsumer {int in, out, count;Item ... {ProducerConsumer.get(next_consumed);/* consume the item in next_consumed */}
User Avatar
236
views
1 answers
1 votes
Paging
If Page size = Frame size is always true and offset in Logical address = offset in physical address holdsThen how/why Logical address size can come different than physical address size?
User Avatar
473
views
2 answers
1 votes
OS, Process Scheduling
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and ... nkx B) k(nx-1)C) k(nk+n)D) x(nk-n+1)
User Avatar
577
views
1 answers
0 votes
Three process P1, P2 and P3 arrive at time zero. Their total execution time is 10ms, 20ms, and 30ms respectively. They spent first 20% of their execution time in doing I/O, next 70% in CPU processing and the last 10% again doing I/O. For what percentage of time was the CPU free? Using SRTF algorithm
User Avatar
619
views
2 answers
2 votes
#OS-FORK Output
Q23. The following C program is executed on a Unix/Linux system: main(){ int i=0; while ( ... many number of processes will be created after executing the above program.Options:1.10232.Infinite3.10244.2048
User Avatar
Page: