Register
Filter

Recent questions without answers

0 votes
0 answers
4231
Made Easy Engineering Maths book
The ans given is b, but i am not able to understande why. According to me the largest eigen value is 2, and therefore none of the option matches..!
The ans given is b, but i am not able to understande why. According to me the largest eigen value is 2, and therefore none of the option matches..!
User Avatar
0 votes
0 answers
4232
POSET self doubt
What is dual of a POSET?
What is dual of a POSET?
User Avatar
0 votes
0 answers
4233
Made Easy Test Series: Self Doubt
How bottom-up parser like Operator-Precedence parser parse some ambiguous grammar? According to stanford diagram , ambiguous grammar cannot be parsed and it is separate form of grammar Am I right?
How bottom-up parser like Operator-Precedence parser parse some ambiguous grammar?According to stanford diagram , ambiguous grammar cannot be parsed and it is separate fo...
User Avatar
0 votes
0 answers
4235
Self doubts DFA
The minimum no. of states required to construct DFA which can accept length of the string is devisable by 4 where input string is 0,1 Please also construct dfa
The minimum no. of states required to construct DFA which can accept length of the string is devisable by 4 where input string is 0,1Please also construct dfa
User Avatar
1 votes
0 answers
4236
IITG MTech DataScience
Did anyone receive call letter from IITG Datascience for Written test, the shortlist was announced and it is informed that call letter will be sent by 26th apr 12PM...anyone have any info?
Did anyone receive call letter from IITG Datascience for Written test, the shortlist was announced and it is informed that call letter will be sent by 26th apr 12PM...any...
User Avatar
0 votes
0 answers
4237
#self doubt
Is it required to focus on space complexity for "GATE"?
Is it required to focus on space complexity for "GATE"?
User Avatar
0 votes
0 answers
4238
turing machine self doubt a+b=c
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
Turing machine,language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| 0}.
User Avatar
0 votes
0 answers
4239
BITS HD Exam Slot Query
The exam date for ME CSE is on 15th and 26th may, the slot booking will open on 4th may. My query is that whether slots for ME CSE will be there on both the dates (15th & 26th may) or only on any one particular day?
The exam date for ME CSE is on 15th and 26th may, the slot booking will open on 4th may. My query is that whether slots for ME CSE will be there on both the dates (15th &...
User Avatar
1 votes
0 answers
4240
iit admissions
I have been shortlisted for Mtech iit Bhubaneshwar and most likely would be for iit Guwahati data science but on the day of written test i have BTech final year exam what should I do?
I have been shortlisted for Mtech iit Bhubaneshwar and most likely would be for iit Guwahati data science but on the day of written test i have BTech final year exam what...
User Avatar
1 votes
0 answers
4241
regarding iit madras ms interview call
Does anyone know cutoff of iit madras for shortlisting for interview? My gate rank is 963 and my btech percentage is 76% but i didnt get call for interview
Does anyone know cutoff of iit madras for shortlisting for interview?My gate rank is 963 and my btech percentage is 76% but i didnt get call for interview
User Avatar
0 votes
0 answers
4243
Pgee mock exam
User Avatar
7 votes
0 answers
4244
FAQ-3
How to utilize GO Book to get maximum benfit ?
How to utilize GO Book to get maximum benfit ?
User Avatar
0 votes
0 answers
4246
Michael Sipser Edition 3 Exercise 1 Question 26 (Page No. 87)
Using the solution you gave to question $25,$ give a formal description of the machines $T_{1}$ and $T_{2}$ depicted in question $24.$
Using the solution you gave to question $25,$ give a formal description of the machines $T_{1}$ and $T_{2}$ depicted in question $24.$
User Avatar
0 votes
0 answers
4254
Michael Sipser Edition 3 Exercise 1 Question 3 (Page No. 83)
The formal description of a $\text{DFA}$ $\text{M}$ is $({q1, q2, q3, q4, q5}, {u, d}, δ, q3, {q3}),$ where $\text{δ}$ is given by the following table. Give the state diagram of this machine.
The formal description of a $\text{DFA}$ $\text{M}$ is $({q1, q2, q3, q4, q5}, {u, d}, δ, q3, {q3}),$ where $\text{δ}$ is given by the following table. Give the state ...
User Avatar
Page: