Register
Filter

Answers by DebRC

1 votes
5
Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =} How can I prove that L is not a regular language using pumping lemma and contradiction?
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?
1 votes
10
UGC NET CSE | October 2022 | Part 1 | Question: 77
Consider $\text{L =a b, a a, b a a}$ Which of the following string is $\text{NOT}$ in $\mathrm{L}^{*}$ ? $\text{baaaaabaaaaa}$ $\text{abaabaaabaa}$ $\text{aaaabaaaa}$ $\text{baaaabaa}$
Consider $\text{L =a b, a a, b a a}$Which of the following string is $\text{NOT}$ in $\mathrm{L}^{*}$ ?$\text{baaaaabaaaaa}$$\text{abaabaaabaa}$$\text{aaaabaaaa}$$\text{b...
3 votes
12
KSET 2015 computer science
Let X and Y be two sets having n elements each. Then the total number of bijective functions from X and Y is (A) n (B) 2n (C) n! (D) 2n
Let X and Y be two sets having n elementseach. Then the total number of bijectivefunctions from X and Y is(A) n (B) 2n(C) n! (D) 2n
2 votes
14
Self doubt
In CSMA/CD method why the propagation delay is $2T_p$?
In CSMA/CD method why the propagation delay is $2T_p$?
3 votes
16
Algorithms
Given ‘N’ objects, which are coloured as red, white and blue. Sort these objects so that objects of the same colour are adjacent, with the colours in the order red, white and blue. Design an algorithm with a time com- plexity of O(nlog n)
Given ‘N’ objects, which are coloured as red, white and blue. Sort theseobjects so that objects of the same colour are adjacent, with the coloursin the order red, whi...
1 votes
19
Transaction and concurrency control
Does Conservative 2PL ensures Recoverability ? If Yes then Does it ensures Cascadeless or Strict recoverable schedule ?
Does Conservative 2PL ensures Recoverability ? If Yes then Does it ensures Cascadeless or Strict recoverable schedule ?