Computer Sciences > Gate 2024 Set-1 > Digital Logic
Consider a permutation sampled uniformly at random from the set of all permutations of {1, 2, 3, β‹― , 𝑛} for some 𝑛 β‰₯ 4. Let 𝑋 be the event that 1 occurs before 2 in the permutation, and π‘Œ the event that 3 occurs before 4. Which one of the following statements is TRUE?
A
The events 𝑋 and π‘Œ are mutually exclusive
B
The events 𝑋 and π‘Œ are independent
C
Either event 𝑋 or π‘Œ must occur
D
Event 𝑋 is more likely than event π‘Œ

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science