Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tbb-mockgate-3
0
votes
1
answer
61
Test by Bikram | Mock GATE | Test 3 | Question: 5
What is the converse of the following statement? "If she is singing, then I may cry." If she is not singing, then I may cry. If she is not singing, then I do not cry. If I cry, then she is singing. If I do not cry, then she is not singing.
What is the converse of the following statement? "If she is singing, then I may cry." If she is not singing, then I may cry.If she is not singing, then I do not cry.I...
Bikram
330
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
discrete-mathematics
mathematical-logic
propositional-logic
+
–
2
votes
1
answer
62
Test by Bikram | Mock GATE | Test 3 | Question: 4
There are coloured pens in a box. $10$ black ones, $8$ blue, $8$ green, $4$ red. With closed eyes, a person picks up some number of pens from the box. The least number of pens that person needs to pick up to ensure they get at least $4$ pens of the same color is _____.
There are coloured pens in a box. $10$ black ones, $8$ blue, $8$ green, $4$ red. With closed eyes, a person picks up some number of pens from the box.The least number of ...
Bikram
302
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
discrete-mathematics
combinatory
pigeonhole-principle
numerical-answers
+
–
0
votes
1
answer
63
Test by Bikram | Mock GATE | Test 3 | Question: 3
What feature of heaps allows them to be efficiently implemented using a partially filled array? Heaps are binary search trees. Heaps contain only integer data. Heaps are full binary trees. Heaps are complete binary trees.
What feature of heaps allows them to be efficiently implemented using a partially filled array?Heaps are binary search trees.Heaps contain only integer data.Heaps are ful...
Bikram
289
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
data-structures
binary-heap
+
–
1
votes
1
answer
64
Test by Bikram | Mock GATE | Test 3 | Question: 2
Which of the following statements are TRUE? An SQL query automatically eliminates duplicates. An SQL query will not work if there are no indexes on the relations. SQL permits attribute names not to be repeated in the same relation. I and III II only III only I and II only
Which of the following statements are TRUE? An SQL query automatically eliminates duplicates. An SQL query will not work if there are no indexes on the relations. S...
Bikram
527
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
databases
sql
+
–
2
votes
1
answer
65
Test by Bikram | Mock GATE | Test 3 | Question: 1
$X$ and $Y$ are two sets of strings from $\Sigma^*.$ Assume that $Y\subseteq X.$ Which of the following statements must ALWAYS be true for $X$and $Y?$ If $X$ is finite then $Y$ is finite. If $X$ is regular then $Y$ is regular. If $X$ is context-free, then $Y$ is context-free. I only II only III only I, II & III
$X$ and $Y$ are two sets of strings from $\Sigma^*.$ Assume that $Y\subseteq X.$Which of the following statements must ALWAYS be true for $X$and $Y?$If $X$ is finite the...
Bikram
295
views
Bikram
asked
Feb 9, 2017
Theory of Computation
tbb-mockgate-3
theory-of-computation
identify-class-language
closure-property
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
