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
Recent activity by akash_chauhan
2
answers
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
+
–
1
answer
2
MadeEasy Test Series: Operating System - Resource Allocation
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is _______.
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 reso...
1.2k
views
commented
Jan 18, 2023
Operating System
made-easy-test-series
operating-system
resource-allocation
+
–
2
answers
3
MadeEasy Workbook: Operating System - Resource Allocation
963
views
commented
Jan 18, 2023
Operating System
operating-system
resource-allocation
made-easy-booklet
+
–
2
answers
4
#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
comment moved
Jan 17, 2023
Operating System
operating-system
resource-allocation
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
4
answers
5
fork()
1)Consider the following pseudo code: for(i=1;i<=4;i++) { fork(); printf("X"); } How many times “X” is printed? 2) Consider the following pseudo code: void main() { fork(); fork(); fork(); fork(); printf("X"); } How many times “X” is printed?
1)Consider the following pseudo code:for(i=1;i<=4;i++){fork();printf("X");}How many times “X” is printed?2) Consider the following pseudo code:void main(){fork();fork...
1.4k
views
commented
Jan 17, 2023
Operating System
fork-system-call
operating-system
+
–
2
answers
6
C Programming
main() { if(fork()>0) sleep(100); } The given code results in the creation of: I) an orphan process II) a zombie process III) a process that executes forever IV) None of these Can someone explain this?
main(){if(fork()>0)sleep(100);}The given code results in the creation of:I) an orphan processII) a zombie processIII) a process that executes foreverIV) None of these Ca...
9.9k
views
commented
Jan 17, 2023
Programming in C
programming-in-c
programming
output
fork-system-call
+
–
2
answers
7
Operating System: Fork
A process executes the following segment of code: int main() { fork(); fork() && fork(); } The number of new processes created is __________ Can someone pls explain me the solution
A process executes the following segment of code:int main() { fork(); fork() && fork();}The number of new processes created is __________Can someone pls explain...
1.8k
views
commented
Jan 17, 2023
Operating System
operating-system
fork-system-call
+
–
1
answer
8
Ace Test Series: Operating System - Fork()
2.3k
views
commented
Jan 17, 2023
Operating System
operating-system
fork-system-call
ace-test-series
+
–
0
answers
9
Theory of Computation, Regular language
Need help , to identify the regular languages
Need help , to identify the regular languages
321
views
commented
Jul 22, 2022
Theory of Computation
theory-of-computation
test-series
+
–
3
answers
10
GATE CSE 2007 | Question: 7
Which of the following is TRUE? Every subset of a regular set is regular Every finite subset of a non-regular set is regular The union of two non-regular sets is not regular Infinite union of finite sets is regular
Which of the following is TRUE?Every subset of a regular set is regularEvery finite subset of a non-regular set is regularThe union of two non-regular sets is not regular...
15.4k
views
commented
Jul 21, 2022
Theory of Computation
gatecse-2007
theory-of-computation
easy
regular-language
+
–
1
answer
11
Self Doubt.
what is the difference between, r* and r^(*) can anyone please elaborate !
what is the difference between, r* and r^(*) can anyone please elaborate !
427
views
asked
Jul 20, 2022
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
12
why completeness problem in case of DCFL is decidable, & it is undecidable in case of CFL?
2.8k
views
commented
Jul 20, 2022
1
answer
13
GATE CSE 1996 | Question: 12
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for $M_1$ ... $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively.Display the transition diagram fo...
8.5k
views
commented
Jul 19, 2022
Theory of Computation
gate1996
theory-of-computation
finite-automata
normal
descriptive
+
–
2
answers
14
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
+
–
1
answer
15
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
+
–
7
answers
16
UGC NET CSE | January 2017 | Part 3 | Question: 20
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$? $\{\in \}$ $\{\in,1\}$ $\phi$ $1^{\ast}$
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$?$\{\in \}$$\{\in,1\}$$\phi$$1^{...
1.5k
views
commented
Jul 18, 2022
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
1
answer
17
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
+
–
2
answers
18
Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
248
views
commented
Jul 16, 2022
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
19
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
+
–
1
answer
20
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 4
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $ = p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by$T(n) = 8T(n/2) + qn,$ if $n>1$$ = p,$ if $n = 1$Where $p,q$ are constants. The or...
1.3k
views
commented
Jul 3, 2022
Algorithms
nielit2017oct-assistanta-cs
algorithms
recurrence-relation
time-complexity
master-theorem
+
–
1
answer
21
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