Dark Mode

Recent questions tagged process-and-threads

2 votes

1 answer

1

GATE CSE 2023 | Question: 12
Which one or more of the following need to be saved on a context switch from one thread $\text{(T1)}$ of a process to another thread $\text{(T2)}$ of the same process? Page table base register Stack pointer Program counter General purpose registers

admin asked in Operating System Feb 15

by admin

1.4k views

1 vote

0 answers

2

DRDO CSE 2022 Paper 2 | Question: 5
The figure shown below indicates a thread's movement between $3$ states (i.e., run, ready, and blocked). Explain what causes each arrow? Say $\text{N/A}$ if it doesn't happen.

admin asked in Operating System Dec 15, 2022

by admin

82 views

1 vote

0 answers

3

Fork System Call and Threads | OS | MSQ
MSQ Consider the following statements, which one of the following is/are TRUE In fork() system call, child process inherits all the open file descriptors of parent process In fork() system call, child process copies the code of the ... system call, child process shares the code of the parent process User level threads shares the code segment of the process

Souvik33 asked in Operating System Nov 28, 2022

293 views

3 votes

1 answer

4

Made easy test series
Consider a system using many-to-one pure user-level thread model in which Kernel is not aware of any user-level thread. Which of the following situations/states is/are possible for a process P with more than one user-level threads in above system? A)P is in running ... than one threads of P are in running state. D)P is in ready state and a thread of P is in running state. .

viral8702 asked in Operating System Oct 12, 2022

274 views

0 votes

2 answers

5

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 23
Which two are valid constructions for Thread? Thread(Runnable r, String name) Thread() Thread(int priority) Thread(Runnable r, ThreadGroup g) Thread(Runnable r, int priority) $1$ and $3$ $2$ and $4$ $1$ and $2$ $2$ and $5$

Lakshman Patel RJIT asked in Operating System Apr 1, 2020

by Lakshman Patel RJIT

510 views

0 votes

0 answers

6

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 65 (Page No. 180)
Implement a program to count the frequency of words in a text file. The text file is partitioned into $N$ segments. Each segment is processed by a separate thread that outputs the intermediate frequency ... the threads complete; then it computes the consolidated word-frequency data based on the individual threads' output.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

228 views

1 vote

0 answers

7

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 64 (Page No. 179 - 180)
The objective of this exercise is to implement a multithreaded solution to find if a given number is a perfect number. $N$ is a perfect number if the sum of all its factors, excluding itself, is $N;$ examples are ... can make the computation faster by restricting the numbers searched from $1$ to the square root of $N.)$

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

263 views

0 votes

0 answers

8

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 63 (Page No. 179)
A process can be put into a round-robin queue more than once to give it a higher priority. Running multiple instances of a program each working on a different part of a data pool can have the same effect. First write a ... but on a system with other processes, you should be able to grab a bigger share of the CPU this way.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

254 views

0 votes

0 answers

9

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 62 (Page No. 179)
Write a producer-consumer problem that uses threads and shares a common buffer. However, do not use semaphores or any other synchronization primitives to guard the shared data structures. Just let each thread access them when ... Do not print more than one number every minute because the I/O could affect the race conditions.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

599 views

0 votes

0 answers

10

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 61 (Page No. 179)
Rewrite the program of Fig. $2-23$ to handle more than two processes.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

160 views

0 votes

0 answers

11

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 60 (Page No. 179)
Suppose that a university wants to show off how politically correct it is by applying the U.S. Supreme Court's Separate but equal is inherently unequal'' doctrine to gender as well ... : woman_wants_to_enter, man_wants_to_enter, woman_leaves, man_leaves. You may use whatever counters and synchronization techniques you like.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

564 views

0 votes

0 answers

12

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 59 (Page No. 179)
Solve the dining philosophers problem using monitors instead of semaphores.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

227 views

0 votes

0 answers

13

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 58 (Page No. 179)
Assume that you have an operating system that provides semaphores. Implement a message system. Write the procedures for sending and receiving messages.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

253 views

0 votes

0 answers

14

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 57 (Page No. 178 - 179)
Write a shell script that produces a file of sequential numbers by reading the last number in the file, adding $1$ to it, and then appending it to the file. Run one instance of the script in the background and one in ... region? Modify the script to prevent the race. (Hint: use ln file file.lock to lock the data file.)

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

105 views

0 votes

0 answers

15

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 56 (Page No. 178)
The readers and writers problem can be formulated in several ways with regard to which category of processes can be started when. Carefully describe three different variations of the problem, each one favoring (or not ... reader or a writer becomes ready to access the database, and what happens when a process is finished.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

218 views

0 votes

0 answers

16

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 55 (Page No. 178)
Consider the procedure put forks in Fig. $2-47$. Suppose that the variable $state[i]$ was set to THINKING after the two calls to test, rather than before. How would this change affect the solution?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

117 views

0 votes

0 answers

17

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 54 (Page No. 178)
In the solution to the dining philosophers problem (Fig. $2-47$), why is the state variable set to HUNGRY in the procedure take_forks?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

137 views

0 votes

0 answers

18

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 53 (Page No. 178)
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

461 views

0 votes

1 answer

19

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 52 (Page No. 178)
A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each frame requiring $20$ msec of CPU time. Is this system schedulable?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

919 views

1 vote

0 answers

20

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 51 (Page No. 178)
In the dining philosophers problem, let the following protocol be used: An even-numbered philosopher always picks up his left fork before picking up his right fork; an odd-numbered philosopher always picks up his right fork before picking up his left fork. Will this protocol guarantee deadlock-free operation?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

369 views

1 vote

2 answers

21

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 50 (Page No. 178)
A soft real-time system has four periodic events with periods of $50, 100, 200,$ and $250$ msec each. Suppose that the four events require $35, 20, 10,$ and $x$ msec of CPU time, respectively. What is the largest value of $x$ for which the system is schedulable?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

1.9k views

1 vote

1 answer

22

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 49 (Page No. 178)
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the prediction of the next time?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

1.4k views

0 votes

0 answers

23

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 48 (Page No. 178)
For the above problem, can another video stream be added and have the system still be schedulable?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

203 views

0 votes

1 answer

24

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 47 (Page No. 178)
Consider a real-time system with two voice calls of periodicity $5$ msec each with CPU time per call of $1$ msec, and one video stream of periodicity $33$ ms with CPU time per call of $11$ msec. Is this system schedulable?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

816 views

1 vote

1 answer

25

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 46 (Page No. 178)
A process running on $CTSS$ needs $30$ quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

384 views

0 votes

0 answers

26

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 45 (Page No. 177 - 178)
Five batch jobs. $A$ through $E$, arrive at a computer center at almost the same time. They have estimated running times of $10, 6, 2, 4,$ and $8$ ... through $(d),$ assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound.

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

450 views

0 votes

1 answer

27

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 44 (Page No. 177)
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer will depend on $X.)$

Lakshman Patel RJIT asked in Operating System Oct 25, 2019

by Lakshman Patel RJIT

2.0k views

Page:

1
2
3
next »

Recent questions tagged process-and-threads