The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions without answers
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
0
votes
0
answers
1
OS university exam
asked
1 day
ago
in
Operating System
by
saurabh rai
Boss
(
12.3k
points)
|
14
views
operating-system
descriptive
+1
vote
0
answers
2
Cormen Edition 3 Exercise 12.1 Question 5 (Page No. 289)
Argue that since sorting $n$ elements takes $\Omega (n\ lgn)$ time in the worst case in the comparison model, any comparison-based algorithm for constructing a $BST$ from an arbitrary list of n elements takes $\Omega (n\ lgn)$ time in the worst case.
asked
Nov 20
in
Algorithms
by
Kushagra गुप्ता
Active
(
2k
points)
|
102
views
cormen
algorithms
descriptive
binary-search-tree
binary-tree
trees
0
votes
0
answers
3
Cormen Edition 3 Exercise 22.2 Question 8 (Page No. 539)
The diameter of a tree $T= (V, E)$ is defined as $max_{u,v\ \epsilon\ V}\ \delta(u,v)$, that is, the largest of all shortest-path distances in the tree. Give an efficient algorithm to compute the diameter of a tree, and analyze the running time of your algorithm.
asked
Nov 12
in
Algorithms
by
Kushagra गुप्ता
Active
(
2k
points)
|
73
views
cormen
graph-algorithms
bfs
descriptive
0
votes
0
answers
4
Cormen Edition 3 Exercise 22.2 Question 7 (Page No. 539)
There are two types of professional wrestlers: babyfaces ( good guys ) and heels ( bad guys ). Between any pair of professional wrestlers, there may or may not be a rivalry. Suppose we have n professional wrestlers and we ... between a babyface and a heel. If it is possible to perform such a designation, your algorithm should produce it.
asked
Nov 12
in
Algorithms
by
Kushagra गुप्ता
Active
(
2k
points)
|
27
views
cormen
graph-algorithms
bfs
descriptive
0
votes
0
answers
5
Cormen Edition 3 Exercise 22.2 Question 6 (Page No. 539)
Give an example of a directed graph $G=(V, E)$, a source vertex $s\ \epsilon\ V$ , and a set of tree edges $E_{\Pi}\subseteq E$ such that for each vertex $v\ \epsilon\ V$ ... set of edges $E_{\Pi}$ cannot be produced by running BFS on G, no matter how the vertices are ordered in each adjacency list.
asked
Nov 12
in
Algorithms
by
Kushagra गुप्ता
Active
(
2k
points)
|
20
views
cormen
bfs
graph-algorithms
descriptive
+1
vote
0
answers
6
Variation on Birthday Problem
So, I have read the birthday paradox problem, and now I came across below question: Assuming the following: there are no leap years, all years have $n = 365$ days and that people's birthdays are uniformly distributed across the $n$ days of the year. (i) How many ... $n=23$, this works out to be 0.53 and Yes it seems to me I am done. Please correct me If I am wrong.
asked
Nov 12
in
Probability
by
Ayush Upadhyaya
Boss
(
27.8k
points)
|
80
views
probability
0
votes
0
answers
7
Data communication and networking by forouzan 12.7 Exercise
11. We have a pure ALOHA network with 100 stations. If $T_{fr} = 1 \mu s$, what is the number of frames each station can send to achieve the maximum efficiency. 12. Repeat Exercise 11 for slotted ALOHA.
asked
Nov 7
in
Computer Networks
by
Mk Utkarsh
Boss
(
35.7k
points)
|
52
views
computer-networks
slotted_aloha
pure_aloha
+2
votes
0
answers
8
The Interesting combination sum problems
Find the number of possible solutions for $x,y,z$ for each the following cases. $Case\ 1.$ Case of unlimited repetition. $x + y +z = 10$ and $x \geq 0\ , y \geq 0,\ z \geq 0 $ $Case\ 2 $ Case of unlimited repetition with variable lower bounds $x + y +z = 10$ and ... variable. $x + y +z = 10$ and $8 \geq x \geq 1\ , \ 20 \geq y \geq 2 \ , 12 \geq z \geq 3\ $
asked
Nov 1
in
Combinatory
by
Satbir
Boss
(
21.7k
points)
|
174
views
permutation-and-combination
0
votes
0
answers
9
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 43 (Page No. 470)
Write a program that detects if there is a deadlock in the system by using a resource allocation graph. Your program should read from a file the following inputs: the number of processes and the number of resources. ... system. In case there is, the program should print out the identities of all processes that are deadlocked.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
31
views
tanenbaum
operating-system
deadlock
resource-allocation
descriptive
0
votes
0
answers
10
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 42 (Page No. 470)
Write a program to implement the deadlock detection algorithm with multiple resources of each type. Your program should read from a file the following inputs: the number of processes, the number of resource types, the ... . In case there is, the program should print out the identities of all processes that are deadlocked.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
15
views
tanenbaum
operating-system
deadlock-detection-algorithm
descriptive
0
votes
0
answers
11
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 41 (Page No. 470)
Program a simulation of the banker’s algorithm. Your program should cycle through each of the bank clients asking for a request and evaluating whether it is safe or unsafe. Output a log of requests and decisions to a file.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
11
views
tanenbaum
operating-system
deadlock
deadlock-prevention-avoidance-detection
bankers-algorithm
descriptive
0
votes
0
answers
12
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 40 (Page No. 469)
Repeat the previous problem, but now avoid starvation. When a baboon that wants to cross to the east arrives at the rope and finds baboons crossing to the west, he waits until the rope is empty, but no more westward-moving baboons are allowed to start until at least one baboon has crossed the other way.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
4
views
tanenbaum
operating-system
deadlock
starvation
descriptive
0
votes
0
answers
13
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 39 (Page No. 469)
A student majoring in anthropology and minoring in computer science has embarked on a research project to see if African baboons can be taught about deadlocks. He locates a deep canyon and fastens a rope across ... . Do not worry about a series of eastward-moving baboons holding up the westward-moving baboons indefinitely.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
10
views
tanenbaum
operating-system
deadlock
semaphores
descriptive
0
votes
0
answers
14
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 38 (Page No. 469)
Cinderella and the Prince are getting divorced. To divide their property, they have agreed on the following algorithm. Every morning, each one may send a letter to the other's lawyer requesting one item of ... vacation, the computers are still negotiating. Why? Is deadlock possible? Is starvation possible? Discuss your answer.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
9
views
tanenbaum
operating-system
deadlock
descriptive
0
votes
0
answers
15
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 37 (Page No. 469)
A program contains an error in the order of cooperation and competition mechanisms, resulting in a consumer process locking a mutex (mutual exclusion semaphore) before it blocks on an empty buffer. The producer process ... the producer. Is this a resource deadlock or a communication deadlock? Suggest methods for its control.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
7
views
tanenbaum
operating-system
deadlock
descriptive
0
votes
0
answers
16
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 36 (Page No. 468 - 469)
Local Area Networks utilize a media access method called CSMA/CD, in which stations sharing a bus can sense the medium and detect transmissions as well as collisions. In the Ethernet protocol, stations requesting the ... or a livelock? Can you suggest a solution to this anomaly? Can starvation occur with this scenario?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
7
views
tanenbaum
operating-system
deadlock
descriptive
0
votes
0
answers
17
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 35 (Page No. 468)
Assume two processes are issuing a seek command to reposition the mechanism to access the disk and enable a read command. Each process is interrupted before executing its read, and discovers that the other has moved the ... . Is this a resource deadlock or a livelock? What methods would you recommend to handle the anomaly?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
5
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
0
votes
0
answers
18
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 33 (Page No. 468)
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these preemption methods were developed to handle resource deadlock or for other purposes? How high is their overhead?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
3
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
19
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 32 (Page No. 468)
A computer science student assigned to work on deadlocks thinks of the following brilliant way to eliminate deadlocks. When a process requests a resource, it specifies a time limit. If the process blocks because the resource ... allowed to run again. If you were the professor, what grade would you give this proposal and why?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
6
views
tanenbaum
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
20
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 31 (Page No. 468)
One way to prevent deadlocks is to eliminate the hold-and-wait condition. In the text it was proposed that before asking for a new resource, a process must first release whatever resources it already holds ( ... new resource but lose some of the existing ones to competing processes. Propose an improvement to this scheme.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
6
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
21
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 30 (Page No. 468)
In an electronic funds transfer system, there are hundreds of identical processes that work as follows. Each process reads an input line specifying an amount of money, the account to be credited, and the account to be ... , solutions that lock one account and then release it immediately if the other is locked are not allowed.)
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
8
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
22
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 29 (Page No. 468)
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if no message from that process is available, even though ... no shared resources, but processes need to communicate frequently about other matters. Is deadlock possible? Discuss.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
3
views
tanenbaum
operating-system
deadlock
descriptive
0
votes
0
answers
23
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 28 (Page No. 468)
Two processes, $A$ and $B,$ each need three records, $1, 2,$ and $3,$ in a database. If $A$ asks for them in the order $1, 2, 3,$ and $B$ asks for them in the same order, deadlock ... or six possible combinations in which each process can request them. What fraction of all the combinations is guaranteed to be deadlock free?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
12
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
24
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 27 (Page No. 467)
One way to eliminate circular wait is to have rule saying that a process is entitled only to a single resource at any moment. Give an example to show that this restriction is unacceptable in many cases.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
6
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
25
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 25 (Page No. 467)
The banker’s algorithm is being run in a system with $m$ resource classes and $n$ processes. In the limit of large $m$ and $n,$ the number of operations that must be performed to check a state for safety is proportional to $m^{a} n^{b}.$ What are the values of $a$ and $b?$
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
8
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
26
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 24 (Page No. 467)
Suppose that process $A$ in Fig. 6-12 requests the last tape drive. Does this action lead to a deadlock?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
5
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
27
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 23 (Page No. 467)
Consider the previous problem again, but now with $p$ processes each needing a maximum of $m$ resources and a total of $r$ resources available. What condition must hold to make the system deadlock free?
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
11
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
28
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 22 (Page No. 467)
A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
5
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
29
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 21 (Page No. 467)
Take a careful look at Fig. 6-11(b). If $D$ asks for one more unit, does this lead to a safe state or an unsafe one? What if the request came from $C$ instead of $D?$
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
4
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
0
votes
0
answers
30
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 20 (Page No. 467)
Can a system be in a state that is neither deadlocked nor safe? If so, give an example. If not, prove that all states are either deadlocked or safe.
asked
Oct 30
in
Operating System
by
Lakshman Patel RJIT
Veteran
(
55k
points)
|
4
views
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
deadlock
descriptive
Page:
1
2
3
4
5
6
...
510
next »
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
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
All categories
General Aptitude
Engineering Mathematics
Digital Logic
Programming and DS
Algorithms
Theory of Computation
Compiler Design
Operating System
Databases
CO and Architecture
Computer Networks
Non GATE
Others
Admissions
Exam Queries
Tier 1 Placement Questions
Job Queries
Projects
Follow @csegate
Recent questions without answers
Recent Blog Comments
Is IT eligible to apply in ECIL because they only...
@`JEET No brother, I don't have. These points I...
Brother post after $\mathbf 1$ year?
Congratulations :)
Lakshman Patel RJIT Do you have such notes...
50,645
questions
56,578
answers
195,772
comments
101,772
users