Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by akash_chauhan
0
votes
1
#self doubt
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
620
views
answered
Jan 19, 2023
Operating System
process-scheduling
operating-system
+
–
0
votes
2
#MadeEasy
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How many ordered pairs (a,b) are possible, such that the system is deadlock free?
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How ma...
796
views
answered
Jan 17, 2023
Operating System
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
0
votes
3
Michael Sipser Edition 3 Exercise 1 Question 71 (Page No. 93)
Let $\sum = \{0,1\}$ Let $A=\{0^{k}u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$ Show that $A$ is regular. Let $B=\{0^{k}1u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$Show that $B$ is not regular.
Let $\sum = \{0,1\}$Let $A=\{0^{k}u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$ Show that $A$ is regular.Let $B=\{0^{k}1u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}....
508
views
answered
Jul 18, 2022
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
regular-language
proof
descriptive
+
–
0
votes
4
Michael Sipser Edition 3 Exercise 2 Question 44 (Page No. 158)
If $A$ and $B$ are languages, define $A \diamond B = \{xy \mid x \in A\: \text{and}\: y \in B \;\text{and} \mid x \mid = \mid y \mid \}$. Show that if $A$ and $B$ are regular languages, then $A \diamond B$ is a CFL.
If $A$ and $B$ are languages, define $A \diamond B = \{xy \mid x \in A\: \text{and}\: y \in B \;\text{and} \mid x \mid = \mid y \mid \}$. Show that if $A$ and $B$ are re...
291
views
answered
Jul 18, 2022
Theory of Computation
michael-sipser
theory-of-computation
regular-language
proof
+
–
0
votes
5
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
1.3k
views
answered
Jul 17, 2022
Theory of Computation
theory-of-computation
regular-language
pumping-lemma
context-free-language
+
–
0
votes
6
Michael Sipser Edition 3 Exercise 1 Question 20 (Page No. 86)
For each of the following languages, give two strings that are members and two strings that are not members-a total of four strings for each part. Assume the alphabet $Σ = \{a,b\}$ in all parts. $a^{*}b^{*}$ $a(ba)^{*}b$ ... $aba\cup bab$ $(\epsilon\cup a)b$ $(a\cup ba\cup bb)\Sigma^{*}$
For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the alphabet $...
2.1k
views
answered
Jul 16, 2022
Theory of Computation
michael-sipser
theory-of-computation
regular-language
regular-expression
+
–
0
votes
7
Recurrence Tree Method
T(n) = 5T(n/3) + T(2n/3) + 1. My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.
T(n) = 5T(n/3) + T(2n/3) + 1.My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.
628
views
answered
Jul 2, 2022
Algorithms
recurrence-relation
algorithms
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
