Exams › GATE › Technical

Consider the following minterm expression for F: F(P,Q,R,S) = Σ 0, 2, 5, 7, 8, 10, 13, 15 The minterms 2, 7, 8 and 13 are ‘do not care’ terms. The minimal sum-of-products form for F is

1. Q S̅ + Q̅ S
2. Q̅ S̅ + Q S
3. Q̅ R̅ S̅ + Q̅ R̅ S̅ + Q̅ R S̅ + Q R S
4. P̅ Q S̅ + P̅ Q S + P Q S + P Q̅ S̅

Correct answer: Q̅ S̅ + Q S

Solution

The correct option, Q̅ S̅ + Q S, represents a simplified form of the function F by combining the relevant minterms while utilizing the 'do not care' conditions to eliminate unnecessary terms, thus achieving minimal representation.

Related GATE Technical questions

• Let G = (V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G ?
• Consider the following program in C language: #include <stdio.h> main() { int i; int *pi = &i; scanf("%d", pi); printf("%d ", i+5); } Which one of the following statements is TRUE?
• Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?
• Let P be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let t1 and t2 be the number of comparisons made by P for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?
• Which one of the following is TRUE ?
• Match the following: 1) Waterfall model 2) Evolutionary model 3) Component-based software engineering 4) Spiral development a) Specifications can be developed incrementally b) Requirements compromises are inevitable c) Explicit recognition of risk d) Inflexible partitioning of the project into stages

⚔️ Practice GATE Technical free + battle 1v1 →