Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Operating System
Recent questions tagged operating-system
4
votes
1
answer
2791
UGC NET CSE | December 2014 | Part 2 | Question: 39
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by $\frac{x}{2}$ $\frac{xz}{2}$ $\sqrt{2xz}$ $\frac{\sqrt{xz}}{2}$
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum ...
makhdoom ghaya
4.5k
views
makhdoom ghaya
asked
Jul 23, 2016
Operating System
ugcnetcse-dec2014-paper2
operating-system
paging
+
–
2
votes
1
answer
2792
UGC NET CSE | December 2014 | Part 2 | Question: 38
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the number of $CPU$'s. No two processes may be simultaneously inside ... running outside its critical section may block other processes. Processes do not wait forever to enter its critical section.
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the number of $CPU$'s. No t...
makhdoom ghaya
5.3k
views
makhdoom ghaya
asked
Jul 22, 2016
Operating System
ugcnetcse-dec2014-paper2
operating-system
critical-section
+
–
2
votes
4
answers
2793
UGC NET CSE | December 2014 | Part 2 | Question: 37
A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used? $1135 K$ $335 K$ $1065 K$ $320 K$
A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started simultaneous...
makhdoom ghaya
1.7k
views
makhdoom ghaya
asked
Jul 22, 2016
Operating System
ugcnetcse-dec2014-paper2
operating-system
process
+
–
2
votes
1
answer
2794
UGC NET CSE | December 2014 | Part 2 | Question: 36
Consider the following justifications for commonly using the two-level $CPU$ scheduling: I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the $FIFO$. III. Because it facilitates putting some set ... following is true ? $I, III$ and $IV$ $I$ and $II$ $III$ and $IV$ $I$ and $III$
Consider the following justifications for commonly using the two-level $CPU$ scheduling:I. It is used when memory is too small to hold all the ready processes.II. Because...
makhdoom ghaya
1.0k
views
makhdoom ghaya
asked
Jul 22, 2016
Operating System
ugcnetcse-dec2014-paper2
operating-system
process-scheduling
+
–
1
votes
2
answers
2795
UGC NET CSE | September 2013 | Part 3 | Question: 23
Match the following $:$ ... $\text{(a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)}$
Match the following $:$$\begin{array}{} \text{(a)} & \text{Dangling pointer} & \text{(i)} & \text{Buffer replacement policy} \\ \text{(b)} & \text{Page fault} & \text{(...
go_editor
1.4k
views
go_editor
asked
Jul 22, 2016
Operating System
ugcnetcse-sep2013-paper3
operating-system
page-fault
+
–
3
votes
2
answers
2796
UGC NET CSE | December 2014 | Part 2 | Question: 23
The directory can be viewed as _______ that translates filenames into their directory entries. Symbol table Partition Swap space Cache
The directory can be viewed as _______ that translates filenames into their directory entries.Symbol tablePartition Swap spaceCache
makhdoom ghaya
3.0k
views
makhdoom ghaya
asked
Jul 21, 2016
Operating System
ugcnetcse-dec2014-paper2
operating-system
file-system
directory-structure
+
–
1
votes
2
answers
2797
UGC NET CSE | September 2013 | Part 2 | Question: 50
The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ration: where $n \rightarrow$ no. of tasks $t_n \rightarrow$ time of completion of each tasks $k \rightarrow$ no. of segments of pipeline $t_p \rightarrow $ ... $S=\frac{n t_n}{(k-n+1)t_p}$ $S=\frac{(k+n-1)t_p}{n t_n}$
The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ration:where $n \rightarrow$ no. of tasks$t_n \rightarrow$ time of comp...
go_editor
2.6k
views
go_editor
asked
Jul 21, 2016
Operating System
ugcnetsep2013ii
operating-system
pipelining
+
–
1
votes
3
answers
2798
UGC NET CSE | September 2013 | Part 2 | Question: 47
Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one in direct block address and one double indirect block address. The file system has ... disk block address. The maximum possible size of a file in this system is 16 MB 16 KB 70 KB 71 KB
Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one in direct...
go_editor
3.0k
views
go_editor
asked
Jul 21, 2016
Operating System
ugcnetsep2013ii
operating-system
unix
+
–
5
votes
1
answer
2799
UGC NET CSE | September 2013 | Part 2 | Question: 46
Consider the input/output (I/O) request made at different instants of time directed at a hypothetical disk having $200$ tracks as given in the following table $:$ ... : $144$ and $123$ milliseconds $143$ and $123$ milliseconds $149$ and $124$ milliseconds $256$ and $186$ milliseconds
Consider the input/output (I/O) request made at different instants of time directed at a hypothetical disk having $200$ tracks as given in the following table $:$$\begin{...
go_editor
4.2k
views
go_editor
asked
Jul 21, 2016
Operating System
ugcnetsep2013ii
operating-system
disk-scheduling
+
–
1
votes
2
answers
2800
UGC NET CSE | September 2013 | Part 2 | Question: 45
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is _____ 36 ns 140 ns 122 ns 40 ns
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access ...
go_editor
4.8k
views
go_editor
asked
Jul 21, 2016
Operating System
ugcnetsep2013ii
operating-system
cache-memory
hit-ratio
+
–
1
votes
2
answers
2801
UGC NET CSE | September 2013 | Part 2 | Question: 44
Match the following $:$ ... $\text{a-iv, b-iii, c-i, d-ii}$ $\text{a-iii, b-iv, c-ii, d-i}$
Match the following $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ & \textbf{Process state} && \textbf{Reason for transition}\\ & \textbf{transiti...
go_editor
2.7k
views
go_editor
asked
Jul 21, 2016
Operating System
ugcnetsep2013ii
operating-system
process-scheduling
match-the-following
easy
+
–
2
votes
2
answers
2802
UGC NET CSE | June 2013 | Part 3 | Question: 66
The versions of windows operating system like Windows XP and Window Vista uses following file system: FAT-16 FAT-32 NTFS (NT File System) All of the above
The versions of windows operating system like Windows XP and Window Vista uses following file system:FAT-16FAT-32NTFS (NT File System)All of the above
go_editor
2.1k
views
go_editor
asked
Jul 19, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
windows
+
–
3
votes
2
answers
2803
UGC NET CSE | June 2013 | Part 3 | Question: 63
Working set model is used in memory management to implement the concept of Swapping Principal of Locality Segmentation Thrashing
Working set model is used in memory management to implement the concept ofSwappingPrincipal of LocalitySegmentationThrashing
go_editor
2.9k
views
go_editor
asked
Jul 19, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
process
+
–
5
votes
1
answer
2804
UGC NET CSE | June 2013 | Part 3 | Question: 61
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of ... safe and State 2 is unsafe Both State 1 and State 2 are safe Both State 1 and State 2 are unsafe
An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum reso...
go_editor
5.0k
views
go_editor
asked
Jul 19, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
bankers-algorithm
deadlock-prevention-avoidance-detection
+
–
1
votes
1
answer
2805
Tricky question: How a deadlock is detected from wait for graph?
There are multiple copies of resources are available in a system. A process can request for more than one copy of a resource. Suppose a process will be blocked till at least one copy of resource is granted, what is the ... b can be the conditions and equally powerful. d) Both a and b can be failed in given conditions in problem
There are multiple copies of resources are available in a system. A process can request for more than one copy of a resource. Suppose a process will be blocked till at le...
sh!va
907
views
sh!va
asked
Jul 19, 2016
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
1
votes
2
answers
2806
Which among the following is not a desirable condition for a system?
Which among the following is not a desirable condition for a system? I Exclusive access II Wait while hold. III No preemption IV Circular wait a. II only b. IV only c. I and III only d. I, II, III and IV
Which among the following is not a desirable condition for a system?I Exclusive access II Wait while hold. III No preemption ...
sh!va
985
views
sh!va
asked
Jul 19, 2016
Operating System
operating-system
+
–
4
votes
2
answers
2807
UGC NET CSE | June 2013 | Part 3 | Question: 60
Suppose $\text{S}$ and $\text{Q}$ are two semaphores initialized to $1.\;\text{P1}$ and $\text{P2}$ ... Their execution may sometimes lead to an undesirable situation called Starvation Race condition Multithreading Deadlock
Suppose $\text{S}$ and $\text{Q}$ are two semaphores initialized to $1.\;\text{P1}$ and $\text{P2}$ are two processes which are sharing resources.$\begin{array}{} \textbf...
go_editor
6.1k
views
go_editor
asked
Jul 18, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
semaphore
+
–
3
votes
1
answer
2808
UGC NET CSE | June 2013 | Part 3 | Question: 59
A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that the page interrupt occurs when a new page is brought in the main memory, ... number of page interrupts in FIFO and LRU page replacement algorithms are 9 and 7 7 and 6 9 and 8 8 and 6
A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order:ABACABDBACDAssuming that the page inte...
go_editor
2.7k
views
go_editor
asked
Jul 18, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
paging
+
–
2
votes
2
answers
2809
UGC NET CSE | June 2013 | Part 3 | Question: 58
Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored): Process A B C D Arrival time 0 1 2 3 CPU Cycle 8 4 9 5 The average turnaround time of these processes will be 19.25 milliseconds 18.25 milliseconds 19.5 milliseconds 18.5 milliseconds
Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored):ProcessABCDArrival time0123CPU Cycle8495The average turnaround time of these...
go_editor
3.8k
views
go_editor
asked
Jul 18, 2016
Operating System
ugcnetcse-june2013-paper3
operating-system
process-scheduling
+
–
0
votes
1
answer
2810
Disk Scheduling
The time to access the first word of a specific sector of a hard disk depends on rotational speed of the disk, the average seek time and the no. of sector per track.if we want not just the first word but the entire sector(assume a sector holds about 100 words).How much ... take? a)100 times longer b)10 times longer c)same amount of time d)50 times longer //Is the answer a) OR c)..
The time to access the first word of a specific sector of a hard disk depends on rotational speed of the disk, the average seek time and the no. of sector per track.if we...
Smriti Changulani
1.6k
views
Smriti Changulani
asked
Jul 18, 2016
Operating System
seek-time
disk
operating-system
+
–
1
votes
1
answer
2811
File System
Which of the following is not file attribute? a)read only flag b)password c)record length d)relocation bit Is the answer is relocation bit?
Which of the following is not file attribute?a)read only flagb)passwordc)record lengthd)relocation bit Is the answer is relocation bit?
Smriti Changulani
1.4k
views
Smriti Changulani
asked
Jul 18, 2016
Operating System
operating-system
file-system
+
–
2
votes
2
answers
2812
File system
A sequential access file has fixed-size M-byte records. Assuming the first record is record 1, the first byte of record N will be at what logical location? a) (n-1)m+1 b) (n-1)m-1 c) (n-1)m d) (n+1)m-1
A sequential access file has fixed-size M-byte records. Assuming the first record is record 1, the first byte of record N will be at what logical location?a) (n-1)m+1b) (...
Smriti Changulani
11.9k
views
Smriti Changulani
asked
Jul 18, 2016
Operating System
operating-system
file-system
+
–
2
votes
1
answer
2813
Write program using fork and join constructs for given precedence graph
I have few doubts: Is precedence graph, fork-join construct, parbegin-parend construct, cobegin-coend construct topics are in syllabus for Operating System for GATE exam. (They are related with parallel programming ... steps / stepwise procedure? Lastly write fork-join code for realizing following precedence graph: ​
I have few doubts:Is precedence graph, fork-join construct, parbegin-parend construct, cobegin-coend construct topics are in syllabus for Operating System for GATE exam. ...
GateAspirant999
2.9k
views
GateAspirant999
asked
Jul 17, 2016
Operating System
operating-system
+
–
2
votes
2
answers
2814
UGC NET CSE | December 2012 | Part 3 | Question: 40
Which of the following operating system is better for implementing client-server network? Windows 95 Windows 98 Windows 2000 All of these
Which of the following operating system is better for implementing client-server network?Windows 95Windows 98Windows 2000All of these
go_editor
2.4k
views
go_editor
asked
Jul 13, 2016
Operating System
ugcnetcse-dec2012-paper3
operating-system
computer-networks
non-gate
+
–
1
votes
2
answers
2815
UGC NET CSE | December 2012 | Part 3 | Question: 37
Everything below the system call interface and above the physical hardware is known as Kernel Bus Shell Stub
Everything below the system call interface and above the physical hardware is known asKernelBusShellStub
go_editor
3.1k
views
go_editor
asked
Jul 13, 2016
Operating System
ugcnetcse-dec2012-paper3
unix
operating-system
non-gate
+
–
1
votes
2
answers
2816
UGC NET CSE | December 2012 | Part 3 | Question: 35
In Win32, which function is used to create Windows Applications? Win APP Win API Win Main Win Void
In Win32, which function is used to create Windows Applications?Win APPWin APIWin MainWin Void
go_editor
2.1k
views
go_editor
asked
Jul 13, 2016
Operating System
ugcnetcse-dec2012-paper3
applications-in-windows
operating-system
non-gate
+
–
2
votes
2
answers
2817
UGC NET CSE | December 2012 | Part 3 | Question: 32
A thread is a light weight process. In the above statement, weight refers to time number of resources speed all of the above
A thread is a light weight process.In the above statement, weight refers totimenumber of resourcesspeedall of the above
go_editor
3.0k
views
go_editor
asked
Jul 12, 2016
Operating System
ugcnetcse-dec2012-paper3
operating-system
threads
+
–
1
votes
2
answers
2818
UGC NET CSE | December 2012 | Part 3 | Question: 7
Which of the following features will characterize an OS as multi-programmed OS? More than one program loaded into main memory at the same time. If a program waits for certain event another program is immediately scheduled If the execution of a program terminates, ... $\text{i and ii only}$ $\text{i and iii only}$ $\text{i, ii, and iii only}$
Which of the following features will characterize an OS as multi-programmed OS?More than one program loaded into main memory at the same time.If a program waits for certa...
go_editor
1.9k
views
go_editor
asked
Jul 12, 2016
Operating System
ugcnetcse-dec2012-paper3
operating-system
multiprogramming-os
+
–
0
votes
2
answers
2819
UGC NET CSE | December 2012 | Part 3 | Question: 3
Match the following : ... $\text{a-ii, b-iii, c-i, d-iv}$ $\text{a-i, b-iii, c-ii, d-iv}$
Match the following :$\begin{array}{clcl} & \textbf{List-I} & & \textbf{List-II} \\ \text{a.} & \text{Critical region} &\text{i.}& \text{Hoares Monitor} \\ \text{b.} & \...
go_editor
1.7k
views
go_editor
asked
Jul 12, 2016
Operating System
ugcnetcse-dec2012-paper3
operating-system
match-the-following
+
–
Page:
« prev
1
...
89
90
91
92
93
94
95
96
97
98
99
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register