Register

IIT Madras MS DSAI Written Test 2024

• recategorized by
128 views
0 votes
0 votes
Two fair 6-face diced are tossed independently. Let X be the random variable of the sum of two numbers on dices and let Y be the absolute difference of two numbers on dices. What is the value of P( X $\geq$ 2Y)?
a) 22/36
b) 24/36
c) 26/36
c) 28/36
d) 32/36
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in category

Related questions

0 votes
0 votes
1 answer
1
harshrajhrj asked Apr 30
98 views
IIT Madras MS DSAI Written Test 2024
Given, that the eigen values of a 2 x 2 matrix are -1,1 and its singular values are 1,0. What is the rank of the matrix? a) rank is 0 b) rank is 1 c) Such a matrix can't exist d) rank is 2
Given, that the eigen values of a 2 x 2 matrix are -1,1 and its singular values are 1,0. What is the rank of the matrix?a) rank is 0b) rank is 1c) Such a matrix can't exi...
User Avatar
0 votes
0 votes
1 answer
2
harshrajhrj asked Apr 30
163 views
IIT Madras MS DSAI Written Test 2024
If the determinant and sum of eigen values of a 2 x 2 matrix are -1 and 0 then, what can you say about the rank of the given matrix? a) rank is 0 b) rank is 1 c) Insufficient information d) rank is 2
If the determinant and sum of eigen values of a 2 x 2 matrix are -1 and 0 then, what can you say about the rank of the given matrix?a) rank is 0b) rank is 1c) Insufficien...
User Avatar
0 votes
0 votes
1 answer
3
SPluto asked May 2, 2019
618 views
IIT Madras MS written test 2019 - TOC - 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...
User Avatar
0 votes
0 votes
0 answers
4
SPluto asked May 2, 2019
544 views
IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....
User Avatar
Link Copied!