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 swami_9
0
votes
1
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
54.0k
views
answered
Oct 1, 2022
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
+
–
0
votes
2
GATE2014 EC-1: GA-4
The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four? ... $K$ $L$ $M$ $N$
The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four?$$\begin{array}{|c|c|c|} \...
5.5k
views
answered
Aug 18, 2022
Quantitative Aptitude
gate2014-ec-1
statistics
quantitative-aptitude
+
–
0
votes
3
GATE IT 2008 | Question: 33
Consider the following languages. $L_1 = \{a^i b^j c^k \mid i = j, k \geq 1\}$ $L_2 = \{a^i b^j \mid j = 2i, i \geq 0\}$ Which of the following is true? $L_1$ is not a CFL but $L_2$ is $L_1 \cap L_2 = \varnothing $ and $L_1$ is non-regular $L_1 \cup L_2$ is not a CFL but $L_2$ is There is a $4$-state PDA that accepts $L_1$, but there is no DPDA that accepts $L_2$.
Consider the following languages.$L_1 = \{a^i b^j c^k \mid i = j, k \geq 1\}$$L_2 = \{a^i b^j \mid j = 2i, i \geq 0\}$Which of the following is true?$L_1$ is not a CFL bu...
6.0k
views
answered
Aug 2, 2021
Theory of Computation
gateit-2008
theory-of-computation
normal
identify-class-language
+
–
0
votes
4
#ugc-2016 #question 56
Let L = {0n1n | n≥0} be a context free language. Which of the following is correct? (A) L' is context free and Lk is not context free for any k≥1 (B) L' is not context free and Lk is context free for any k≥1 (C) Both L' and Lk is for any k≥1 are ... free. (D) Both L' and Lk is for any k≥1 are not context free. Official answer given by UGC is C . according to me answer is B
Let L = {0n1n | n≥0} be a context free language.Which of the following is correct?(A) L’ is context free and Lk is not context free for any k≥1(B) L’ is not conte...
4.5k
views
answered
Aug 1, 2021
Theory of Computation
theory-of-computation
ugcnetjul2016iii
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register