traceroot is a program in a server side program b. clint side program c . boath a and b none of the above
Consider the grammar 1. S-> X1 2. X-> A1B 3. X-> 2 4. A-> 2 5. B-> A How the above grammar is not LR(1)?
(G,*) is an abelian group .Then, (i). $X$ =$X^{-1}$ for any X belonging to G. (ii). $X$=$X^{2}$ for any X belonging to G. (iii). $(X*Y)^{2}$ = $X^{2}$ * $Y^{2}$ for any X ,Y belonging to G. (iv). G is of finite order
N denotes the set of natural numbers,{0,1,2,3 .} ,Z denotes the integers { ..-2,-2,0,1,2, ...} Which of the following statements are true ? (i). For all p $\epsilon$ Z ,p>5 $\rightarrow$ There exists x $\epsilon$ N,$x^{2}$ = 1(mod p). (ii). If m is any natural number satisfying m ... x. (a). only (i) is true (b). only (ii) is true ( c). both (i) and (ii) are true (d). both (i) and (ii) are false
Hello i want to know what is the made easy workbook for cse because i find on made easy publications website and amazon but unable to find and is this books come from postal course or can we buy separately as other books of made easy on their website or the name of book is changed or book printing is end for buying ? so what is “Made easy workbook” is?
The correct answer is (b). I am not able to understand how it is the correct answer, please explain.
If a variable is having EX- OR operation itself ‘n’ number of times, then the result is (a) complement of variable if n is even (b) uncomplement of variable if n is even ( C) complement of variable if n is odd (d) uncomplement of variable if n is odd
question no – 15
Consider the following code int main() { char A[]="gate"; int x; for(x=0; A[x]; x++) { printf("%c", A[x]); } } What is the output printed by the code? (a) gate (b) g (c) runtime error (d) compile time error
order p is between 2 to p child pointer can store in root node and between [p] to p child can store in other 2 nodes of B tree index . Btree index.how many maximum level of index required to store 300 distict keys in order 5 B tree index?
Why aa*(bb*a)* not a regular expressian for starting and ending with symbol A Dfa
Given a system using unspanned blocking and 100 byte blocks. A file contains record of 20,50,35,70,40,20. what percentage of space will be wasted in the blocks allocated for the file?
If a schedule has a transaction that locks an item say A and then release the lock after few steps can it again lock the item A in a 2-phase locking scheme?
Consider the following grammer: S → S | S;S S → V = E V → id[E] | id E → id | (E) Find the number of conflicts in LR(0).
1 vote
Consider a sequence A of length n which is sorted except for one item that appears out of order.Which of the following can sort the sequence in O(n) time? (a) Heap sort (b) Quick sort (c) Merge sort (d) Insertion sort
Consider the following CFG S→aAbBC | abB A→bBd | ∈ B→eBf | g C→f How many derivative steps required to derive the string abegff using the above grammar when start symbol S is available?
Identify from the following the string generated by following $S→SS ,$ $S \rightarrow \ (S_1,$ $S_1→S) ,$ $S_1 \rightarrow )$ A. $(( ) ( ) ))$ B. $((((( )))))) ($ C. $( ) ( ) ( ) ( ))$ D.$(( ) ((( )) ( )))$
1 vote
Consider the production grammar S→AB | AS A→a | aA B→b Which of the following regular expressions corresponding to the production grammar?
The regular expression for even number of zeroes is A. (1* 01* 01*)* B. (1* 001*)* C. 1* + (1* 01* 01*)* D. ((0 + 1)* 0(0 + 1)* 0(0 + 1)*)* Also draw the finite automata.
The language recognized by the given finite automata is A. (aa + ∊) (b + ba) (bab)* B. (aab + ba) (bab)* C. (aab) (bab)* + (bab)* D. (aab) (∈ + (bab)*)*
1 vote
Which of the following regular expression over {0,1} denotes the set of all strings not containing 100 as sub string A. 0* (1*0)* B. 0* 10 10* C. 0* 1* 01* D. 0* (10 + 1)*
If L1 is regular and L2 ⊆ L1, then which of the following has to be regular? A. L2 B. L1 ∩ L2 C. L2^n D. L1^n
Which of the following is the dual of ~(~p)$\equiv$p? a.] ~p$\equiv$p b.] ~(~p)$\equiv$p c.] ~p$\equiv$~p d.] p$\equiv$~p