Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Dhoomketu
2
answers
1
GATE CSE 2008 | Question: 6
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/are decimal $10$ decimal $11$ decimal $10$ and $11$ any value $> 2$
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/aredecimal $10$decimal $11$decimal $10$ and $11$any value ...
11.9k
views
commented
Jun 4, 2018
Digital Logic
gatecse-2008
digital-logic
number-representation
normal
+
–
4
answers
2
Gradeup question doubt
$x(x+x'y)z(x+y+z)$ simplifies to (A)$x+x'y$ (B)$x+y+z$ (C)$xyz$ (D)$xz$ Answer is (D) But I can not obtain $xz$ only. My solutions is as follows: x(x+x'y)z(x+y+z) =(x+y)(xz+yz+z) =xz+xyz+xz+xyz+yz+yz =xz+yz+xyz =xz(1+y)+yz =xz+yz Can anyone tell where I made mistake?
$x(x+x'y)z(x+y+z)$ simplifies to(A)$x+x'y$(B)$x+y+z$(C)$xyz$(D)$xz$Answer is (D)But I can not obtain $xz$ only.My solutions is as follows:x(x+x'y)z(x+y+z)=(x+y)(xz+yz+z)=...
599
views
answer selected
May 25, 2018
Digital Logic
digital-logic
boolean-algebra
+
–
3
answers
3
Grade up question doubt
The given equation simplifies to which of the following? $(A+B)'(ABC)'(A'C)'$ (A)$A'B'C'$ (B)$ABC$ (C)$A'B'C'$ (D)$A+B+C$ Answer is (A) They have written in the explanation as follows: (A+B)'(ABC)'(A'C) ... +A'C]'..... I have doubt here... =[A+B+ABC+A'C]' =[A+B+A'C]' =[A+B+C]'
The given equation simplifies to which of the following?$(A+B)'(ABC)'(A'C)'$(A)$A'B'C'$(B)$ABC$(C)$A'B'C'$(D)$A+B+C$Answer is (A)They have written in the explanation as f...
634
views
commented
May 24, 2018
Digital Logic
boolean-algebra
+
–
6
answers
4
GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below:$L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$$L_2=\left \{ a^i b^j c^k \mid i,j,k...
13.2k
views
commented
May 10, 2018
Theory of Computation
gatecse-2009
theory-of-computation
easy
identify-class-language
+
–
2
answers
5
Theory of computation - Closure Property
Cfl is closed under intersection with regular language. Then resultant languages will be regular or cfl ? Let X is cfl Y is regular language L=X intersection Y Then L is what?
Cfl is closed under intersection with regular language.Then resultant languages will be regular or cfl ?Let X is cflY is regular language L=X intersection YThen L is what...
603
views
answer selected
May 10, 2018
Theory of Computation
theory-of-computation
closure-property
+
–
0
answers
6
Databases - Superkeys
How to calculate super key of any relation? Pls explain with example.
How to calculate super key of any relation?Pls explain with example.
372
views
commented
Apr 9, 2018
Databases
databases
superkeys
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register