Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
BILLY
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by BILLY
2
votes
1
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
5.3k
views
answered
Mar 12, 2017
Theory of Computation
gate1987
theory-of-computation
regular-expression
descriptive
+
–
1
votes
2
Virtual Gate Test Series: Algorithms - Matrix Chain Ordering
Consider the following chain of matrices $A_{1}$ to $A_{4}$ having dimensions given below $A_{1}\rightarrow 2\times 3$ $A_{2}\rightarrow 3\times 5$ $A_{3}\rightarrow 5\times 4$ $A_{4}\rightarrow 4\times 2$ The following table is filled ... of scalar multiplications$:$ What are the values of $P$ and $Q?$ $60,140$ $60,82$ $60,40$ $60,92$
Consider the following chain of matrices $A_{1}$ to $A_{4}$ having dimensions given below$A_{1}\rightarrow 2\times 3$$A_{2}\rightarrow 3\times 5$$A_{3}\rightarrow 5\times...
1.2k
views
answered
Jan 12, 2017
Algorithms
algorithms
dynamic-programming
matrix-chain-ordering
virtual-gate-test-series
+
–
1
votes
3
super key
for a relation R = ( A,B,C,D,E,F ) ,Candidate keys are AF, BF, CF, DF. how many super keys are possible?
for a relation R = ( A,B,C,D,E,F ) ,Candidate keys are AF, BF, CF, DF.how many super keys are possible?
393
views
answered
Jan 8, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register