Computer Sciences > Gate 2024 Set-2 > Graph
Consider 4-variable functions f1, f2, f3, f4 expressed in sum-of-minterms form as given below.
f1 = ∑(0,2,3,5,7,8,11,13)
f2 = ∑(1,3,5,7,11,13,15)
f3 = ∑(0,1,4,11)
f4 = ∑(0,2,6,13)
With respect to the circuit given above, which of the following options is/are CORRECT?
A
Y =∑(0,1,2,11,13)
B
Y =Π(3,4,5,6,7,8,9,10,12,14,15)
C
Y =∑(0,1,2,3,4,5,6,7)
D
Y =Π(8,9,10,11,12,13,14,15)

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