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 iamrohit
1
answer
1
UGC NET CSE | June 2005 | Part 2 | Question: 2
Identify the language which is not context – free. $L=\left \{ w w R\mid w \in \left \{ 0,1 \right \}* \right \}$ $L=\left \{ a^{n}b^{n}\mid n \geq 0 \right \}$ $L=\left \{ ww\mid w \in \left \{ 0,1 \right \}* \right \}$ $L=\left \{ a^{n}b^{m}c^{m}d^{n}\mid n,m \geq 0 \right \}$
Identify the language which is not context – free.$L=\left \{ w w R\mid w \in \left \{ 0,1 \right \}* \right \}$$L=\left \{ a^{n}b^{n}\mid n \geq 0 \right \}$$L=\left \...
1.4k
views
answered
Mar 26, 2020
Others
ugcnetcse-june2005-paper2
+
–
2
answers
2
UGC NET CSE | June 2005 | Part 2 | Question: 1
Which of the following is not true ? Power of deterministic automata is equivalent to power of non-deterministic automata Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata Power of deterministic turing machine is equivalent to power of non-deterministic turing machine All the above
Which of the following is not true ?Power of deterministic automata is equivalent to power of non-deterministic automataPower of deterministic pushdown automata is equiva...
3.5k
views
answered
Mar 26, 2020
Others
ugcnetcse-june2005-paper2
+
–
3
answers
3
GATE CSE 2020 | Question: 7
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s?$((0+1)^*1(0+1)^*1)^*10^*$$(0^*10^*10^*)^*0^*1$$10^*...
23.7k
views
commented
Feb 20, 2020
Theory of Computation
gatecse-2020
regular-expression
normal
theory-of-computation
1-mark
+
–
4
answers
4
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported ...
22.0k
views
answered
Feb 17, 2020
DS
gatecse-2020
data-structures
binary-search-tree
2-marks
+
–
4
answers
5
GATE CSE 2020 | Question: 43
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this processor. Overheads associated with pipelining force you to ... , the speedup achieved by the pipelined processor over the non-pipelined processor (round off to $2$ decimal places) is_____________.
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this p...
16.6k
views
commented
Feb 12, 2020
CO and Architecture
gatecse-2020
numerical-answers
co-and-architecture
pipelining
2-marks
+
–
3
answers
6
ISI2014-DCG-10
The number of divisors of $6000$, where $1$ and $6000$ are also considered as divisors of $6000$ is $40$ $50$ $60$ $30$
The number of divisors of $6000$, where $1$ and $6000$ are also considered as divisors of $6000$ is$40$$50$$60$$30$
1.0k
views
answered
Nov 15, 2019
Quantitative Aptitude
isi2014-dcg
quantitative-aptitude
number-system
factors
+
–
2
answers
7
UGC NET CSE | June 2019 | Part 1 | Question: 24
In a new budget, the price of petrol rose by $25\%$. By how much percent must a person reduce his consumption so that his expenditure on it does not increase? $10\%$ $15\%$ $20\%$ $25\%$
In a new budget, the price of petrol rose by $25\%$. By how much percent must a person reduce his consumption so that his expenditure on it does not increase?$10\%$$15\%$...
763
views
answered
Jul 4, 2019
Quantitative Aptitude
ugcnetcse-june2019-paper1
general-aptitude
quantitative-aptitude
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register