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 spike500
16
answers
1
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of val...
22.1k
views
commented
Oct 8, 2020
Probability
gatecse-2012
probability
conditional-probability
normal
+
–
2
answers
2
Hasse Doubt
what is the least upper bound of {a, b, c}?
what is the least upper bound of {a, b, c}?
892
views
answered
Dec 26, 2019
Set Theory & Algebra
hasse-diagram
set-theory&algebra
lattice
partial-order
+
–
4
answers
3
MadeEasy Test Series: Databases - B Tree
Consider a Table T with a key field K. A B tree of order P where P denotes the maximum number of record pointers in a B tree. Assume K is 12 bytes long, disk block size is 1024 Bytes, record pointer is 6 bytes and block pointer size is 2 bytes long. In order for each B tree node to fit in a single disk block the maximum value of P. Is answer correct?
Consider a Table T with a key field K. A B tree of order P where P denotes the maximum number of record pointers in a B tree. Assume K is 12 bytes long, disk block size i...
1.1k
views
answered
Dec 10, 2019
Databases
made-easy-test-series
databases
b-tree
+
–
1
answer
4
Ace Test Series: Algorithms - Sorting
567
views
answered
Jan 14, 2019
Algorithms
ace-test-series
algorithms
quick-sort
recurrence-relation
+
–
1
answer
5
asymptotic notation
O(n) O(Log n) O(Log log n) none
O(n)O(Log n)O(Log log n)none
494
views
answered
Jan 14, 2019
Algorithms
algorithms
recurrence-relation
asymptotic-notation
test-series
+
–
1
answer
6
Number of minimum spanning trees
The number of distinct minimum spanning trees for the weighted graph shown below is ___________.
The number of distinct minimum spanning trees for the weighted graph shown below is ___________.
2.2k
views
commented
Sep 27, 2018
Graph Theory
spanning-tree
graph-theory
minimum-spanning-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register