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 _Bash_
3
answers
1
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
Consider the following grammars. Names representing terminals have been specified in capital letters.$$\begin{array}{llll}\hline \text{$G1$ :} & \text{stmnt} & \text{$\...
12.8k
views
commented
May 20, 2019
Theory of Computation
gateit-2007
theory-of-computation
context-free-language
normal
+
–
1
answer
2
UGC NET CSE | June 2010 | Part 2 | Question: 3
"My Laughter Machine (MLM) recognizes the following strings : (i) $a$ (ii) $aba$ (iii) $abaabaaba$ (iv) $abaabaabaabaabaabaabaabaaba$ Using this as an information, how would you compare the following regular expressions ? (i) $(aba)^{3x}$ ... $(i), (ii)$ and $(iii)$ are different. $(i), (ii)$ and $(iii)$ are same.
"My Laughter Machine (MLM) recognizes the following strings :(i) $a$(ii) $aba$(iii) $abaabaaba$(iv) $abaabaabaabaabaabaabaabaaba$Using this as an information, how would y...
1.0k
views
commented
May 3, 2019
Theory of Computation
ugcnetcse-june2010-paper2
theory-of-computation
regular-expression
+
–
1
answer
3
OS Kernel
Please explain each point. My assumptions are; 1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to save. 2.kernel must close the files. Explain this point in both the cases(the ... has not dealt with registers earlier.Thus, no need to restore. 4.kernel must save the content of memory onto disk. Explain this too.
Please explain each point.My assumptions are;1.kernel must save the register values.It should be FALSE as it can be the case if the process is terminated.Thus, no need to...
1.3k
views
commented
Apr 22, 2019
Operating System
operating-system
kernel
process
+
–
4
answers
4
GATE CSE 2005 | Question: 75
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-to-many and $R_2$ is many-to-many. $R_1$ and $R_2$ do not have ... of their own. What is the minimum number of tables required to represent this situation in the relational model? $2$ $3$ $4$ $5$
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-t...
18.5k
views
commented
Apr 19, 2019
Databases
gatecse-2005
databases
er-diagram
normal
+
–
3
answers
5
GATE CSE 2004 | Question: 56
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\text{TCP}$ layer prefixes $20$ byte header to the message. This passes ... $200$ $220$ $240$ $260$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\...
23.1k
views
commented
Apr 12, 2019
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
0
answers
6
self doubt
In this Question , it is said that S is serializable .. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, ... use topological sort to get a serial schedule .. then how come the answer is (A). Topological sort .. Please Help!!
In this Question , it is said that S is serializable….. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to ge...
277
views
commented
Apr 5, 2019
Databases
self-doubt
databases
+
–
0
answers
7
self doubt
What is the correct answer of this Question and what are the Minimized tables ???
What is the correct answer of this Question and what are the Minimized tables ???
450
views
edited
Apr 4, 2019
Databases
self-doubt
er-diagram
+
–
0
answers
8
self doubt
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent schedule equal to T2->T1 being calculated??It is very confusing please Help!!!!!
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent sch...
475
views
commented
Apr 2, 2019
Databases
conflict-serializable
databases
self-doubt
+
–
0
answers
9
Networks by Fourozon
I have just started reading "Data communication and networking by Forouzan", I can't understand which chapters and sub-chapters are important.Please help.
I have just started reading "Data communication and networking by Forouzan", I can't understand which chapters and sub-chapters are important.Please help.
1.7k
views
asked
Feb 7, 2019
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register