Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged tbb-os-2
2
votes
1
answer
1
Test by Bikram | Operating Systems | Test 2 | Question: 30
Consider the following 3 processes with 3 binary semaphores with initial values $S_{0}=0, S_{1}=0, S_{2}=1$ ... $3$ processes? $211$ $200$ $210$ $201$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
270
views
tbb-os-2
2
votes
3
answers
2
Test by Bikram | Operating Systems | Test 2 | Question: 29
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns. The average time required to access a page is ________ ns
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
1.1k
views
tbb-os-2
numerical-answers
7
votes
1
answer
3
Test by Bikram | Operating Systems | Test 2 | Question: 28
Consider a program to be run on a computer system in round-robin CPU scheduling. The size of the program is $100K$. It is given that the hard disk has a transfer rate of $1$ megabyte per second. Assume that there are no head seeks ... acceptable time quantum for effective CPU utilization ? $2.048$ sec $0.216$ sec $0.108$ sec $0.100$ sec
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
828
views
tbb-os-2
1
vote
1
answer
4
Test by Bikram | Operating Systems | Test 2 | Question: 27
A counting semaphore is initialized to $10$. The $6$ P(wait) operations and $4$ V(signal) operations were completed in this semaphore. The resulting value of semaphore is: $0$ $8$ $10$ $12$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
203
views
tbb-os-2
0
votes
1
answer
5
Test by Bikram | Operating Systems | Test 2 | Question: 26
Consider a paging system with the page table in memory. Each memory reference takes $200$ ns. The TLB has hit ratio of $75 \%$ and the time to look for pages in TLB is almost negligible. What is the effective paged memory reference time in ns? $400$ $250$ $150$ $200$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
330
views
tbb-os-2
3
votes
1
answer
6
Test by Bikram | Operating Systems | Test 2 | Question: 25
What will be the output of the following piece of code? Void foo() { int i=1; fork(); i++; printf( %d ,i); fork(); i++; printf( %d ,i); fork(); i++; printf( %d ,i); } $2 \ 2 \ 3 \ 3 \ 3 \ 3 \ 4 \ 4 \ 4 \ 4 \ 4 \ 4 \ 4 \ 4$ ... $2 \ 3 \ 4 \ 2 \ 3 \ 4 \ 4 \ 3 \ 4 \ 4 \ 4 \ 3 \ 4 \ 4$ All of above three options are correct
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
621
views
tbb-os-2
2
votes
3
answers
7
Test by Bikram | Operating Systems | Test 2 | Question: 24
Suppose the page table for the process currently executing looks like the following. All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. The page size is $1024$ ... --- , $379$ $7196$, --------- , $5120$ -------, $2221$, --------
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
1.2k
views
tbb-os-2
0
votes
1
answer
8
Test by Bikram | Operating Systems | Test 2 | Question: 23
A moving arm disk-storage device has the following specifications. Number of tracks per recording surface - $200$ Disk - rotation speed - $2400$ rpm Track storage capacity - $62$, $500$ bits When sector control information ... Bytes and data area is formatted to $256$ bytes the average number of sectors possible in each track is __________
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
531
views
tbb-os-2
numerical-answers
2
votes
1
answer
9
Test by Bikram | Operating Systems | Test 2 | Question: 22
A uniprocessor system has two resources of type A and B shared by four processes. There are $4$ units of each resource type available after allocation. Let current indicate the resources allocated to each process and Need indicate the remaining number ... $P1$ $P0$ $P3$ No safe sequence exists
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
500
views
tbb-os-2
deadlock-prevention-avoidance-detection
1
vote
1
answer
10
Test by Bikram | Operating Systems | Test 2 | Question: 21
Suppose the disk drive has $200$ cylinders ( numbered $0$ to $199$). The drive is currently serving the request at cylinder $53$. The previous request was at cylinder $25$ ... Starting from the current head position. The total distance traveled by the disk arm in SCAN scheme _______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
551
views
tbb-os-2
numerical-answers
0
votes
1
answer
11
Test by Bikram | Operating Systems | Test 2 | Question: 20
Consider a demand-paging system with the following time-measured utilization: ... ? Increase the degree of multiprogramming Add pre paging to the page fetch algorithms Increase the page size none of the above
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
597
views
tbb-os-2
0
votes
1
answer
12
Test by Bikram | Operating Systems | Test 2 | Question: 19
Assume we have a demand-paged memory. The page table is held in registers. It takes $8$ milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and $20$ milliseconds if the ... The maximum acceptable page-fault rate for an effective access time of no more than $200$ ns is __________ $\%$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
841
views
tbb-os-2
numerical-answers
3
votes
1
answer
13
Test by Bikram | Operating Systems | Test 2 | Question: 18
Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T0$ ... $P1, P4, P2, P3, P0$ $P3, P1, P2, P4, P0$ $P1, P4, P3, P0, P2$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
724
views
tbb-os-2
1
vote
1
answer
14
Test by Bikram | Operating Systems | Test 2 | Question: 17
The address sequence generated by tracing a particular program, executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows: $560,\ 540, \ 430, \ 390, \ 350, \ 450, \ 102, \ 198, \ 754, \ 785$. The page fault rate is _______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
829
views
tbb-os-2
numerical-answers
3
votes
2
answers
15
Test by Bikram | Operating Systems | Test 2 | Question: 16
Which of the following statements are not true? All unsafe states are deadlocks A deadlock state is unsafe state A system is in safe state only if there exists a safe sequence A state is said to be safe if the system can allocate resources to few processes even if ... ; $4$ only $1$ & $4$ only $2$ & $3$ only $1$, $3$ & $4$ only
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
550
views
tbb-os-2
1
vote
1
answer
16
Test by Bikram | Operating Systems | Test 2 | Question: 15
There are $5$ processes which require resource instances of same type in quantities $23, \ 35, \ 12, \ 43, \ 15$ respectively. The minimum number of resource instances required for preventing deadlock is _______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
543
views
tbb-os-2
numerical-answers
1
vote
2
answers
17
Test by Bikram | Operating Systems | Test 2 | Question: 14
Consider the $2$ - process solution to the Critical Section problem (here i refers to the current process and j is the other process ) Process Pi repeat flag[i] = true; while ( flag[j] ) do ... and Bounded waiting are satisfied Only mutual exclusion is satisfied Mutual exclusion is violated Mutual exclusion and progress requirements are met
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
919
views
tbb-os-2
0
votes
1
answer
18
Test by Bikram | Operating Systems | Test 2 | Question: 13
The virtual memory system uses the demand paging for its implementation. The probability of getting page faults is $0.25$, the normal memory access time is $200$ nanoseconds. If it takes $2$ millseconds to service a page fault, then what is effective memory access time? $500000$ ns $500075$ ns $500150$ ns $500250$ ns
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
546
views
tbb-os-2
0
votes
1
answer
19
Test by Bikram | Operating Systems | Test 2 | Question: 12
A certain computer provides its users with a virtual-memory space of $2^{32}$ bytes. The computer has $2^{18}$ bytes of physical memory. The virtual memory is implemented by paging, and the page size is $4,096$ bytes or $4K$ bytes. A user process ... $0001 \ 0001 \ 0001 \ 0010 \ 0011$ $0010 \ 0011 \ 0100 \ 0101 \ 0110$ $0100 \ 0101 \ 0110$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
871
views
tbb-os-2
0
votes
1
answer
20
Test by Bikram | Operating Systems | Test 2 | Question: 11
Suppose that a disk drive has $5000$ cylinders, numbered $0$ to $4999$. The drive is currently serving a request at cylinder $143$, and the previous request was at cylinder $125$ ... $7081, \ 1745, \ 7081$ $1745, \ 1004, \ 9600$ $9769, \ 1745, \ 7081$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
716
views
tbb-os-2
1
vote
1
answer
21
Test by Bikram | Operating Systems | Test 2 | Question: 10
Consider a logical address space of eight pages of $1024$ words each mapped onto a physical memory of $32$ frames. The number of bits are there in the logical address is _______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
379
views
tbb-os-2
numerical-answers
0
votes
2
answers
22
Test by Bikram | Operating Systems | Test 2 | Question: 9
Assume that pages are $128$ words in size. Consider below code snippet whose function is to initialize to $0$ each element of a $128$ - by - $128$ array. Then number of page faults generated by the following Code snippet is: Assume the array is stored row major ... j++) for( int i=0; i<128; i++) A[i][j] = 0; $128$ $16384$ $0$ $16378$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
709
views
tbb-os-2
0
votes
1
answer
23
Test by Bikram | Operating Systems | Test 2 | Question: 8
The arrival time, burst time and priorities of five processes are given as: ... For the priority scheduling algorithm the average response time is ________ minutes . Ignore the context switching overhead.
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
408
views
tbb-os-2
numerical-answers
1
vote
1
answer
24
Test by Bikram | Operating Systems | Test 2 | Question: 7
A computer system has $6$ tape drives with n process competing for them. Each process may need up-to $2$ tape drives. The maximum value of n from which the system is guaranteed to be deadlock free is: $2$ $3$ $4$ $1$
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
653
views
tbb-os-2
0
votes
3
answers
25
Test by Bikram | Operating Systems | Test 2 | Question: 6
A system that uses a two-level page table has $2^{12}$ – byte pages and $32$ – bit virtual addresses. The first $8$ – bits of the address serve as the index into the first level page table. The number of bits specify the second level index is ________
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
1.1k
views
tbb-os-2
numerical-answers
2
votes
3
answers
26
Test by Bikram | Operating Systems | Test 2 | Question: 5
Let us initialize counting semaphore $X$ to $5$. Assume that processes $P_i$ where $i= 1$ to $15$ are coded as follows. while (1) { P (x); { critical section } V (x); } and suppose that $P_{16}$ is coded as follows: ... { critical section } P (x); } The number of processes can be in the critical section at most at any point of time is ______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
781
views
tbb-os-2
numerical-answers
process-synchronization
4
votes
2
answers
27
Test by Bikram | Operating Systems | Test 2 | Question: 4
Consider a situation, in which several people are executing copies of a mail program. Which of the following statements is/are not correct: All the users share one program counter and stack for mail program. All the users share the ... the users share same text section, but data section varies necessarily. I and II only I only II only III
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
1.0k
views
tbb-os-2
1
vote
1
answer
28
Test by Bikram | Operating Systems | Test 2 | Question: 3
Given memory partition of $100K, \ 500K, \ 200K, \ 300K$ and $600K$ in order, if we have processes needing memory of $212K, \ 417K, \ 112K$ and $405K$ respectively, which of the following memory allocation technique(s) will be ... to allocate memory for all the processes? First Fit Best Fit Worst Fit II only I and II II and III All three
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
270
views
tbb-os-2
1
vote
1
answer
29
Test by Bikram | Operating Systems | Test 2 | Question: 2
Consider an operating system containing $n$ processes each requiring $4$ resources. The maximum number of processes that can be executed without any deadlock if there are $21$ resources is available ______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
407
views
tbb-os-2
numerical-answers
1
vote
1
answer
30
Test by Bikram | Operating Systems | Test 2 | Question: 1
Assume that a certain process executes the following code segment. for (i =0, i <=8, i++ ) fork() ; The number of new processes created is _______
Bikram
asked
in
Operating System
Dec 26, 2016
by
Bikram
525
views
tbb-os-2
numerical-answers
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged tbb-os-2
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...