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 raja11sep
3
votes
1
DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$} Is the above language DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?
739
views
answered
Dec 29, 2022
Theory of Computation
dcfl
context-free-language
theory-of-computation
identify-class-language
+
–
2
votes
2
Unacademy Test
Consider the language given below: L={P!=w | P is prefix of w and w <-{0,1}*} Which is TRUE about L? A.L is CFL B.L is DCFL C.L is CSL CORRECT ANSWER D.L is regular
Consider the language given below:L={P!=w | P is prefix of w and w <-{0,1}*}Which is TRUE about L?A.L is CFLB.L is DCFLC.L is CSL CORRECT ANSWERD.L is regular
288
views
answered
Dec 21, 2022
Theory of Computation
theory-of-computation
identify-class-language
+
–
1
votes
3
Self Doubt
Does BFS and DFS traversal sequence exist for disconnected graphs? Is yes can you please give a dry run of the algorithm on a disconnected graph? According to me it should not exist as there is no edge to visit certain vertices of a different graph component from the source vertex in a disconnected graph. There is no absolute answer I could find online to this question.
Does BFS and DFS traversal sequence exist for disconnected graphs? Is yes can you please give a dry run of the algorithm on a disconnected graph?According to me it should...
581
views
answered
Dec 20, 2022
Algorithms
graph-theory
graph-algorithms
+
–
1
votes
4
acacademy
CFG is not closed under complementation , but REC is?
CFG is not closed under complementation , but REC is?
387
views
answered
Nov 24, 2022
Theory of Computation
theory-of-computation
+
–
1
votes
5
toc decidablity
M is a Turing Machine and M is the only Turing Machine that accepts L(M) is decidable. TRUE/FALSE
M is a Turing Machine and M is the only Turing Machine that accepts L(M) is decidable. TRUE/FALSE
663
views
answered
Nov 8, 2022
Theory of Computation
theory-of-computation
decidability
true-false
+
–
0
votes
6
GO Classes Weekly Quiz 1 | General Aptitude | Question: 4
Find $d=\gcd(119,272).$
Find $d=\gcd(119,272).$
391
views
answered
Jul 6, 2022
Quantitative Aptitude
goclasses_wq1
numerical-answers
goclasses
quantitative-aptitude
number-system
1-mark
+
–
0
votes
7
Ace Test Series: Data Structures - Circular Linked List
948
views
answered
Mar 22, 2022
DS
ace-test-series
data-structures
linked-list
+
–
5
votes
8
Self Doubt
Could anyone please explain various tricks to find out wheather the given context free Grammar is ambiguous or not in an easier way?
Could anyone please explain various tricks to find out wheather the given context free Grammar is ambiguous or not in an easier way?
438
views
answered
Jan 22, 2022
3
votes
9
made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
907
views
answered
Jan 16, 2022
Compiler Design
context-free-language
context-free-grammar
parsing
made-easy-test-series
+
–
3
votes
10
program output - C
Consider the following program int find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; return a; } The value returned by find (9) is ______ .
Consider the following programint find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; ...
693
views
answered
Jan 15, 2022
Programming in C
programming-in-c
output
programming
+
–
5
votes
11
Live Variable Analysis | Made Easy Full Syllabus Test
A variable v is live at a program point p if some path from p to program exit contains an r-value occurrence of v which is not preceded by an l-value occurrence of v . That is, the variable should be referenced before ... zero as from the exit point there are no such definitions, to begin with? This is the solution they have provided :
A variable v is live at a program point p if some path from p to program exit contains an r-value occurrence of v which is not preceded by an l-value occurrence of v . Th...
1.2k
views
answered
Jan 11, 2022
Compiler Design
compiler-design
made-easy-test-series
live-variable-analysis
code-optimization
+
–
3
votes
12
#ACE test series
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} with a single variable is______.
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} with a single variable is______.
1.2k
views
answered
Jan 1, 2022
Theory of Computation
theory-of-computation
+
–
7
votes
13
Self doubt
How many ‘n’ state FA are possible with ‘m’ symbols with – (i) Designated initial state (ii) With designated initial and final state (iii) With no designated initial and final state How can I approach this?
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...
794
views
answered
Dec 28, 2021
Theory of Computation
self-doubt
theory-of-computation
finite-automata
+
–
5
votes
14
regular and cfl
if L1 and L2 are not regular language then L1 union L2 is not regular. this statement is true or false? my approach is::: true let suppose L1= a^n b^n AND L2= a^k b^k both are cfl but if we do union then that also be cfl and what happened if union is replaced by concatenation L1 . L2
if L1 and L2 are not regular language then L1 union L2 is not regular.this statement is true or false?my approach is:::true let suppose L1= a^n b^n AND L2= a^k b^kbot...
1.2k
views
answered
Dec 23, 2021
Theory of Computation
context-free-language
finite-automata
theory-of-computation
+
–
6
votes
15
Topic - Number Systems (Digital Logic)
What is the difference between 2’s complement and 2’s complement representation of a number? Please can you do 2’s complement of (43) and (-43) and also represent 43 and (-43) in two’s complement form. Also, write binary of 43 and (-43).
What is the difference between 2’s complement and 2’s complement representation of a number? Please can you do 2’s complement of (43) and (-43) and also represent 4...
4.1k
views
answered
Dec 18, 2021
Digital Logic
number-representation
number-system
digital-logic
+
–
2
votes
16
NPTEL Assignment Question
326
views
answered
Dec 7, 2021
Algorithms
nptel-quiz
bellman-ford
time-complexity
+
–
2
votes
17
NIELIT STA 2021
Which of the following is not a stable sorting algorithms ? Insertion sort Selection sort Bubble sort Merge sort
Which of the following is not a stable sorting algorithms ? Insertion sortSelection sort Bubble sortMerge sort
558
views
answered
Dec 6, 2021
Algorithms
algorithms
+
–
3
votes
18
NIELIT STA 2021
Which open addressing technique is free from clustering problems ? Linear Probing Quadratic Probing Double hashing Rehashing
Which open addressing technique is free from clustering problems ? Linear Probing Quadratic Probing Double hashing Rehashing
269
views
answered
Dec 6, 2021
2
votes
19
NIELIT STA 2021
Consider the relations: $R_{1}${Roll_No, Name, Grades} and $R_{2}${Roll_No, Subject_ID, Grades} Which of the following operations cannot be performed using the above relations? Union Select Join Project
Consider the relations:$R_{1}${Roll_No, Name, Grades} and $R_{2}${Roll_No, Subject_ID, Grades}Which of the following operations cannot be performed using the above relati...
297
views
answered
Dec 6, 2021
Databases
databases
+
–
2
votes
20
NIELIT STA 2021
Worst Case scenario in case of linear search algorithm is_______________. Item is somewhere in the middle of the array Item is not in the array at all Item is the last element in the array Item is the last element in the array or is not there at all
Worst Case scenario in case of linear search algorithm is_______________.Item is somewhere in the middle of the arrayItem is not in the array at allItem is the last eleme...
384
views
answered
Dec 6, 2021
Algorithms
data-structures
algorithms
+
–
3
votes
21
NIELIT STA 2021
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1 $2n^{2}$ 2^n 2n – 1
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1$2n^{2}$2^n2n – 1
738
views
answered
Dec 6, 2021
DS
data-structures
+
–
6
votes
22
MadeEasy Test Series
#include <stdio.h> int main() { static int i = 6; if(--i) { main(); printf("%d", i+1); } return 0; } Please explain the output of this program ?
#include <stdio.h>int main(){ static int i = 6; if( i) { main(); printf("%d", i+1); } return 0;}Please explain the output of this program ?
452
views
answered
Dec 3, 2021
Programming in C
made-easy-test-series
data-structures
programming-in-c
+
–
4
votes
23
Nptel Assignment Question
Using DeMorgan’s rule, state the negation of the statement: “The car is out of gas or the fuel line is plugged.” (a) The car has gas or the fuel line is unplugged (b) The car has gas and the fuel line is unplugged (c) The car is out of gas and the fuel line is plugged (d) The car is out of gas or the fuel line is plugged
Using DeMorgan’s rule, state the negation of the statement: “The car is out of gas or the fuel line is plugged.” (a) The car has gas or the fuel line is unplugged(b...
208
views
answered
Dec 3, 2021
Set Theory & Algebra
nptel-quiz
discrete-mathematics
+
–
5
votes
24
Nptel Assignment Question
if 93 /4 = 23, the base of the number system is 8 9 10 11
if 93 /4 = 23, the base of the number system is 891011
1.0k
views
answered
Dec 2, 2021
Digital Logic
nptel-quiz
digital-logic
digital-circuits
+
–
2
votes
25
Nptel Assignment Question
what is the decimal equivalent of ${{(1221)}}_{3}$ ${{(50)}}_{10}$ ${{(53)}}_{10}$ ${{(52)}}_{10}$ ${{(51)}}_{10}$
what is the decimal equivalent of ${{(1221)}}_{3}$${{(50)}}_{10}$${{(53)}}_{10}$${{(52)}}_{10}$${{(51)}}_{10}$
315
views
answered
Dec 2, 2021
Digital Logic
nptel-quiz
digital-logic
+
–
4
votes
26
GATE CSE 2002 | Question: 1.21
In $2's$ complement addition, overflow is flagged whenever there is carry from sign bit addition cannot occur when a positive value is added to a negative value is flagged when the carries from sign bit and previous bit match None of the above
In $2's$ complement addition, overflowis flagged whenever there is carry from sign bit additioncannot occur when a positive value is added to a negative valueis flagged w...
9.3k
views
answered
Dec 1, 2021
Digital Logic
gatecse-2002
digital-logic
number-representation
normal
+
–
3
votes
27
IITB Practice Set: 16
A $\textit{proper edge coloring}$ of a graph is an assignment of colors to the edges so that any two edges sharing a common vertex should get different colors. Let $G$ be a graph with $20$ vertices that has a proper edge coloring with $6$ colors. The maximum number of edges in $G$ can be ______.
A $\textit{proper edge coloring}$ of a graph is an assignment of colors to the edges so that any two edges sharing a common vertex should get different colors. Let $G$ be...
195
views
answered
Nov 30, 2021
Others
iitb-practice-set
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register