Register
Filter

Recent activity by Warrior_19

0 answers
3
Test series
How it solve this ?
How it solve this ?
1 answer
4
Testbook:matrix
0 answers
5
Matrix
If $A$ and $B$ are symmetric matrices of the same order, then $AB-BA$ is NULL matrix Symmetric matrix Skew symmetric matrix Orthogonal matrix
If $A$ and $B$ are symmetric matrices of the same order, then $AB-BA$ isNULL matrixSymmetric matrixSkew symmetric matrixOrthogonal matrix
1 answer
6
Tautology?
Why this the following not a tautology? There is no case in which RHS is False and LHS is True. $\Bigl [ (\lnot p \land q) \land \bigl[ q \to (p \to q) \bigr ] \Bigr ] \to \lnot r$
Why this the following not a tautology? There is no case in which RHS is False and LHS is True.$\Bigl [ (\lnot p \land q) \land \bigl[ q \to (p \to q) \bigr ] \Bigr ] \to...
2 answers
9
Don't Care term in POS
Should we use Don't care terms while calculating POS expression?
Should we use Don't care terms while calculating POS expression?
0 answers
10
Relational Algebra
Online Site For practicing Relational Algebra https://dbis-uibk.github.io/relax/calc.htm
Online Site For practicing Relational Algebrahttps://dbis-uibk.github.io/relax/calc.htm
1 answer
12
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
If both of the algorithms A and B need O(nlogn) time then theyboth are equally efficient and finish in same amount of time.TRUE OR FALSE
2 answers
13
please solve my doubt
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
2 answers
15
theory of computation
S -> aAa|bBb|epsilon A -> C|a B -> C|b C -> CDE|epsilon D -> A|B|ab new grammar after removing null, unit and useless productions is??
S - aAa|bBb|epsilonA - C|aB - C|bC - CDE|epsilonD - A|B|abnew grammar after removing null, unit and useless productions is??
2 answers
16
Regular language
How to check whether the language is regular or not ? { wxw | w,x belongs to (a+b)raise to +}
How to check whether the language is regular or not ? { wxw | w,x belongs to (a+b)raise to +}
0 answers
17
AVL Rotation
please suggest me some good tutorials for AVL tree rotation.
please suggest me some good tutorials for AVL tree rotation.