Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
tusharb
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by tusharb
1
answer
1
Need Solution manual
Where can I get the solution manual for An Introduction to Formal Languages and Automata by peter linz for the back exercises?
Where can I get the solution manual for An Introduction to Formal Languages and Automata by peter linz for the back exercises?
6.3k
views
answer selected
Jul 30, 2022
Theory of Computation
finite-automata
theory-of-computation
+
–
1
answer
2
Self Doubt
$L=\{wa^nw^Rb^n\mid w\in \left \{ a,b \right \}^\ast ,n\geqslant 0\}$ Can anyone give me step by step solution that shows this is not CFL by pumping Lemma?
$L=\{wa^nw^Rb^n\mid w\in \left \{ a,b \right \}^\ast ,n\geqslant 0\}$Can anyone give me step by step solution that shows this is not CFL by pumping Lemma?
479
views
commented
Jul 30, 2022
Theory of Computation
self-doubt
theory-of-computation
pumping-lemma
+
–
2
answers
3
GATE CSE 2019 | Question: 31
Which one of the following languages over $\Sigma=\{a, b\}$ is NOT context-free? $\{ww^R \mid w \in \{a, b\}^*\}$ $\{wa^nb^nw^R \mid w \in \{a,b\}^*, n \geq 0\}$ $\{wa^nw^Rb^n \mid w \in \{a,b\}^* , n \geq 0\}$ $\{ a^nb^i \mid i \in \{n, 3n, 5n\}, n \geq 0\}$
Which one of the following languages over $\Sigma=\{a, b\}$ is NOT context-free?$\{ww^R \mid w \in \{a, b\}^*\}$$\{wa^nb^nw^R \mid w \in \{a,b\}^*, n \geq 0\}$$\{wa^nw^Rb...
11.7k
views
commented
Jul 29, 2022
Theory of Computation
gatecse-2019
theory-of-computation
context-free-language
2-marks
+
–
6
answers
4
GATE CSE 2017 Set 1 | Question: 38
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$. Which of the following are context-free languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \le...
13.5k
views
commented
Jul 29, 2022
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
11
answers
5
GATE CSE 2017 Set 2 | Question: 16
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
Identify the language generated by the following grammar, where $S$ is the start variable.$ S \rightarrow XY$$ X \rightarrow aX \mid a$$ Y \rightarrow aYb \mid \epsilon$$...
18.3k
views
commented
Jul 29, 2022
Theory of Computation
gatecse-2017-set2
theory-of-computation
context-free-language
+
–
8
answers
6
GATE CSE 2016 Set 1 | Question: 42
Consider the following context-free grammars; $G_1 : S \to aS \mid B, B \to b \mid bB$ $G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$ Which one of the following pairs of languages is generated by $G_1$ and $G_2$ ... $\{ a^mb^n \mid m > 0 \text{ or } n>0\}$
Consider the following context-free grammars;$G_1 : S \to aS \mid B, B \to b \mid bB$$G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$W...
26.5k
views
comment edited
Jul 29, 2022
Theory of Computation
gatecse-2016-set1
theory-of-computation
context-free-language
normal
+
–
6
answers
7
GATE CSE 2006 | Question: 19
Let $L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$, $L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and $L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT context free? $L_1$ only $L_3$ only $L_1$ and $L_2$ $L_2$ and $L_3$
Let$L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$,$L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and$L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT c...
15.1k
views
commented
Jul 28, 2022
Theory of Computation
gatecse-2006
theory-of-computation
context-free-language
normal
+
–
1
answer
8
Self Doubt
Is the diagonalization language (Ld) countable?
Is the diagonalization language (Ld) countable?
789
views
commented
Jul 20, 2022
Theory of Computation
theory-of-computation
self-doubt
+
–
1
answer
9
Self Doubt
If for every RE there exist a TM that accepts it, is it possible that for 2 different RE languages there exists a single TM that accepts them?
If for every RE there exist a TM that accepts it, is it possible that for 2 different RE languages there exists a single TM that accepts them?
445
views
asked
Jul 20, 2022
Theory of Computation
theory-of-computation
self-doubt
+
–
6
answers
10
GATE CSE 2017 Set 2 | Question: 04
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is context-free $\overline{L_1}$ is context-free $L_1 - R$ is context-free $L_1 \cap L_2$ is context-free I, II and IV only I and III only II and IV only I only
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT?$L_1 \cup L_2$ is context-free$\overline{L_1}...
11.6k
views
commented
Jul 20, 2022
Theory of Computation
gatecse-2017-set2
theory-of-computation
closure-property
+
–
2
answers
11
GATE CSE 2016 Set 2 | Question: 18
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRUE ? $\overline{L_{3}} \cup L_{4}$ ... is context-free. I only. I and III only. I and IV only. I, II and III only.
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are TRU...
12.0k
views
commented
Jul 20, 2022
Theory of Computation
gatecse-2016-set2
theory-of-computation
regular-language
context-free-language
closure-property
normal
+
–
6
answers
12
GATE CSE 2013 | Question: 17
Which of the following statements is/are FALSE? For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... and intersection. $1$ and $4$ only $1$ and $3$ only $2$ only $3$ only
Which of the following statements is/are FALSE?For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.Turing recognizable lan...
20.9k
views
commented
Jul 20, 2022
Theory of Computation
gatecse-2013
theory-of-computation
normal
closure-property
+
–
5
answers
13
GATE CSE 2002 | Question: 2.14
Which of the following is true? The complement of a recursive language is recursive The complement of a recursively enumerable language is recursively enumerable The complement of a recursive language is either recursive or recursively enumerable The complement of a context-free language is context-free
Which of the following is true?The complement of a recursive language is recursiveThe complement of a recursively enumerable language is recursively enumerableThe complem...
11.3k
views
commented
Jul 20, 2022
Theory of Computation
gatecse-2002
theory-of-computation
easy
closure-property
+
–
1
answer
14
Self Doubt
I want to join the two tables of movies and actors and then output only those results that have gender =”F”, can you tell me where I am going wrong?
I want to join the two tables of movies and actors and then output only those results that have gender =”F”, can you tell me where I am going wrong?
660
views
commented
Apr 29, 2022
Databases
sql
databases
joins
+
–
2
answers
15
Self Doubt
Suppose we have priority-based processes. Which scheduler will replace a low priority process which is presently executing when a high priority process arrives in the ready queue? Also which scheduler is responsible for pulling out a process from CPU if it requests I/O?
Suppose we have priority-based processes. Which scheduler will replace a low priority process which is presently executing when a high priority process arrives in the rea...
543
views
answer selected
Apr 29, 2022
Operating System
self-doubt
operating-system
job
process-scheduling
+
–
3
answers
16
GATE CSE 2020 | Question: 25
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send $\textsf{HTTP}$ requests in non-persistent mode. The web ... small images.The minimum number of $\textsf{TCP}$ connections required to display the web page completely in your browser is__________.
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to s...
15.1k
views
commented
Apr 29, 2022
Computer Networks
gatecse-2020
numerical-answers
computer-networks
application-layer-protocols
1-mark
+
–
4
answers
17
GATE CSE 2014 Set 1 | Question: 19
Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders $30, 85, 90, 100, 105, 110, 135$ ... First (SSTF) is being used for scheduling the disk access, the request for cylinder $90$ is serviced after servicing ____________ number of requests.
Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders...
10.7k
views
commented
Apr 7, 2022
Operating System
gatecse-2014-set1
operating-system
disk-scheduling
numerical-answers
normal
+
–
1
answer
18
GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $$10, 7...
122k
views
commented
Apr 7, 2022
Operating System
gate1995
operating-system
disk-scheduling
normal
descriptive
+
–
2
answers
19
GATE CSE 2021 Set 2 | Question: 43
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock $(L)$. ... not occur The scheme may lead to live-lock The scheme may lead to starvation The scheme violates the mutual exclusion property
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and ...
9.6k
views
commented
Apr 7, 2022
Operating System
gatecse-2021-set2
multiple-selects
operating-system
deadlock-prevention-avoidance-detection
2-marks
+
–
5
answers
20
GATE CSE 2018 | Question: 24
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested a...
21.4k
views
commented
Apr 6, 2022
Operating System
gatecse-2018
operating-system
deadlock-prevention-avoidance-detection
easy
numerical-answers
1-mark
+
–
3
answers
21
GATE CSE 1999 | Question: 2.12
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$? Saving current register values and restoring saved register values for process $B$. Changing address translation tables. Swapping out the memory image of process $A$ to the disk. Invalidating the translation look-aside buffer.
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$?Saving current register value...
27.4k
views
commented
Apr 6, 2022
Operating System
gate1999
operating-system
context-switch
normal
+
–
1
answer
22
Programming Self Doubt
Suppose we have a 32-bit memory and we have to represent unsigned int a = -5 What will the memory representation look like? 000000…….1011 or 111…..1011
Suppose we have a 32-bit memory and we have to representunsigned int a = -5What will the memory representation look like?000000…….1011or 111…..1011
414
views
commented
Mar 2, 2022
2
answers
23
GATE CSE 2022
p,q,r,u,s,t are mid points and corners of a triangle such that 1) line joining p and r is parallel to q and s 2) p is on the side opposite to corner t 3) s and u can't be on same side Which of the following false? A) p can't be on corner B) r can't be on corner C) s can't be on corner D) u can't be a mid point
p,q,r,u,s,t are mid points and corners of a triangle such that1) line joining p and r is parallel to q and s2) p is on the side opposite to corner t3) s and u can't be on...
973
views
answer reshown
Feb 23, 2022
Others
quantitative-aptitude
+
–
6
answers
24
GATE CSE 2022 | Question: 52
Consider the queues $Q_{1}$ containing four elements and $Q_{2}$ containing none (shown as the $\textsf{Initial State}$ in the figure). The only operations allowed on these two queues are $\textsf{Enqueue (Q, element)}$ ... $\textsf{Final State}$ in the figure) without using any additional storage is________________.
Consider the queues $Q_{1}$ containing four elements and $Q_{2}$ containing none (shown as the $\textsf{Initial State}$ in the figure). The only operations allowed on the...
18.2k
views
answered
Feb 21, 2022
DS
gatecse-2022
numerical-answers
data-structures
queue
2-marks
+
–
1
answer
25
Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to reduce the time complexity to O(n)?
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...
654
views
commented
Feb 18, 2022
Algorithms
algorithms
self-doubt
sorting
time-complexity
+
–
2
answers
26
Self doubt CN
In the connection termination phase, suppose the FIN segment from the client-side contains data ranging from sequence no 100 to 200, So will the ACK no from the server start from 201 or 202? Will the FIN flag consume 1 extra sequence number at the end, ... context of my question, will that sequence number be 99, before the beginning of the data segment or 201, after the data segment
In the connection termination phase, suppose the FIN segment from the client-side contains data ranging from sequence no 100 to 200,So will the ACK no from the server sta...
994
views
answered
Jan 25, 2022
Computer Networks
computer-networks
self-doubt
tcp
ip-packet
sliding-window
+
–
10
answers
27
GATE IT 2005 | Question: 73
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte sent by the sender is LastByteSent = $10240$ and the last byte acknowledged by ... LastByteAcked = $8192$. The current window size at the sender is: $2048$ bytes $4096$ bytes $6144$ bytes $8192$ bytes
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte ...
25.9k
views
commented
Jan 25, 2022
Computer Networks
gateit-2005
computer-networks
congestion-control
normal
+
–
2
answers
28
Find the size of Sender's window if:
During a TCP connection, the size of the window advertised by the receiver is 20 KB. The last byte sent by the sender is 20480 and the last byte acknowledged by the receiver is 8384. If the current congestion window is 18 KB, then the current size of the sender's window is _______ (in KB).
During a TCP connection, the size of the window advertised by the receiver is 20 KB. The last byte sent by the sender is 20480 and the last byte acknowledged by the recei...
6.2k
views
answered
Jan 25, 2022
Computer Networks
computer-networks
tcp
+
–
5
answers
29
GATE CSE 2018 | Question: 55
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense based medium access protocol. A node that receives a ... allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s ongoing transmission is _______.
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the follow...
19.0k
views
commented
Jan 25, 2022
Computer Networks
gatecse-2018
computer-networks
congestion-control
numerical-answers
2-marks
+
–
3
answers
30
GATE CSE 2021 Set 1 | Question: 29
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$ ... $0$ and $y$ is $1$ $x$ is $1$ and $y$ is $0$ $x$ is $1$ and $y$ is $1$
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$, where the data bits and the check bits...
15.1k
views
answered
Jan 23, 2022
Computer Networks
gatecse-2021-set1
computer-networks
hamming-code
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register