Computer Sciences > Gate 2014 Set-1 > Logic Function and Minimization

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following Boolean expression for F:

F(P, Q, R, S) = PQ + P'QR + P'QR'S

The minimal sum-of-products form of F is__________

A

PQ + QR + QS

B

P + Q + R + S

C

P’ + Q’ + R’ + S’

D

P’R + P’R’S + P

Check Answer

Explanation

Correct : Logic Function and Minimization

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