GATE Computer Science (CS) 2015 Shift 1 Solved Paper

© examsiri.com
Question : 42 of 65
 
Marks: +1, -0
Suppose ℒ  = {𝑝, 𝑞, 𝑟, 𝑠, 𝑡} is a lattice represented by the following Hasse diagram:

For any x, y ϵ ℒ not necessarily distinct x ⋁ y and x ⋀ y are join and meet of x, y respectively. Let ℒ= {(x, y, z): x, y, z ϵ ℒ } be the set of all ordered triplets of the elements of ℒ. Let pr be the probability that an element (x, y, z) ϵ ℒ3 chosen equiprobably satisfies x ⋁  (y ⋀ z) = (x ⋁  y) ⋀ (x ⋁  z). Then
Go to Question: