Register
Filter

Recent activity by rude

3 answers
1
Algorithm
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ? 45 46 90 89
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ?45469089
1 answer
3
micro programmed
what are difference b/w control word and microinstruction?
what are difference b/w control word and microinstruction?
6 answers
5
GATE2016 CE-2: GA-5
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original number. $39$ $57$ $66$ $93$
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original numbe...
0 answers
6
Gate 2017
Please explain why L3 is not CFL ?
Please explain why L3 is not CFL?
1 answer
7
theory of computation
Answer is [[n(n+1)] / 2 ] + 1 right ??? empty string is also a substring right ???
Answer is [[n(n+1)] / 2 ] + 1 right ??? empty string is also a substring right ???
1 answer
8
pointer
Which of the following declaration throw run-time error? A. int **c = &c; B. int **c = &*c; C. int **c = **c; D. None of the mentioned. I think C is correct but mentioned correct ans is D how?
Which of the following declaration throw run-time error?A. int c = &c;B. int c = &*c;C. int c = c;D. None of the mentioned.I think C is correct but mentioned correct ...
2 answers
9
Check for Regular Language
Check whether given language is Regular or not? WXWR / W,X∈(0,1)+
Check whether given language is Regular or not?WXWR / W,X∈(0,1)+
1 answer
10
theory of computation
can a turing machine accept $\varepsilon$ ??? please explain ??? this question says it can accept ...https://gateoverflow.in/941/gate2003-53
can a turing machine accept $\varepsilon$ ??? please explain ??? this question says it can accept ...https://gateoverflow.in/941/gate2003-53
1 answer
11
How to find size of integer on your system in C programming
Please kindly tell the full code with the use of sizeof() operator. Thanks!
Please kindly tell the full code with the use of sizeof() operator. Thanks!
1 answer
12
BARC2017
Time complexity of dijkstra's algorithm when array used in place of priority queue Options O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
Time complexity of dijkstra's algorithm when array used in place of priority queueOptions O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
3 answers
13
Peter Linz Exercise 8.1
#20 Is the following language L = { amn : m and n are prime } context free?
#20 Is the following languageL = { amn : m and n are prime } context free?
2 answers
16
theory of computation
State TRUE or FALSE . For every regular language , there exists a unique minimal DFA . I know that for every regular language, there is a minimal DFA ...but is it unique ? i think it is ...please explain ...
State TRUE or FALSE .For every regular language , there exists a unique minimal DFA . I know that for every regular language, there is a minimal DFA ...but is it unique ?...
1 answer
17
theory of computation
What language is accepted by the npda below if we make F = {q0, qf }, where F denotes set of final states. Answer is L = $\sum$* ...........right ???
What language is accepted by the npda below if we make F = {q0, qf }, where F denotes set of final states.Answer is L = $\sum$* ...........right ???
1 answer
20
theory of computation
The Language is given by, L is a A) Deterministic CFL. B) Non deterministic CFL but not DCFL. Please draw the PDA for the above language ...
The Language is given by,L is a A) Deterministic CFL.B) Non deterministic CFL but not DCFL.Please draw the PDA for the above language ...
2 answers
21
theory of computation
Let C be a context-free language and R be a regular language. Prove that the language C $\cap$ R is context free.
Let C be a context-free language and R be a regular language. Prove thatthe language C $\cap$ R is context free.
1 answer
24
Digital Logic Doubt
In the min term we select (1), in the max term we select (0). But 1 is greater than 0. Selecting 1 should be called max-term and selecting 0 should be called Min-term. Why they have the name otherwise?
In the min term we select (1), in the max term we select (0).But 1 is greater than 0. Selecting 1 should be called max-term and selecting 0 should be called Min-term. Why...
3 answers
25
regular or not regular
Which of the following languages are regular and why a) L= {a n! :n>=1} b)L= {an :n is a perfect square} c)L= {an :n is not a perfect square} d)L= {an :n is not a prime number}
Which of the following languages are regular and whya) L= {a n! :n>=1}b)L= {an :n is a perfect square}c)L= {an :n is not a perfect square}d)L= {an :n is not a prime n...
2 answers
27
Graph Theory
let G=(V,E) be an connected graph, let $\left | V \right |= n$ Find largest value of n such that i) G is complete & ii) G is bipartite with valid proof
let G=(V,E) be an connected graph, let $\left | V \right |= n$Find largest value of n such thati) G is complete &ii) G is bipartitewith valid proof
2 answers
28
theory of computation
Give regular expression for the complement of the language given below . L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
Give regular expression for the complement of the language given below .L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
5 answers
30
CIL17