Bissoy.com
Doctors Medicines MCQs Q&A

A programmable logic array (PLA) is shown in the figure. The Boolean function F implemented is

A programmable logic array (PLA) is shown in the figure. The Boolean function F implemented is Correct Answer <span class="math-tex">\(\bar P\bar QR + \bar PQR + P\bar QR\)</span>

Fromthe given figure

[ alt="GATE EC 2017 slot 2 part 2 D4" src="//storage.googleapis.com/tb-img/production/19/08/GATE%20EC%202017%20slot%202%20part%202_D4.png" style="width: 296px; height: 172px;">

A = P̅ Q̅ R

B = P̅ Q R

C = P Q̅ R

F = A + B + C

= P̅ Q̅ R + P̅ Q R + P Q̅ R

Related Questions

A teacher asked the class to subtract 5 from 75.70% of the class said: 25. Their work was shown as: \(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} 7&5 \end{array}}\\ {\underline {\begin{array}{*{20}{c}}\ { - 5} \ \ \ &{} \end{array}} }\\ {\underline {\begin{array}{*{20}{c}} 2&5 \end{array}} } \end{array}\) Which of the following describes the most appropriate remedial action that the teacher should take to clarify this misconception?
Consider the following statements regarding the Read Only Memory (ROM): 1. The stored data is lost if the power is removed. 2. It consists of an address decoder with a input lines and a programmable OR array with n output lines. 3. The minterms are ORed through the programmable switches which can be made ON or OFF to select a particular minterm. The programmable switches can be implemented by either bipolar, CMOS, nMOS or pMOS technologies. 4. Mask-programmed ROMs are used in the application where the system requires data to be stored and to be changed during the operation. Which of the above statements are not correct ?
Which of the following statements is not correct about a CPLD (Complex Programmable Logic Device)? (1) A CPLD is a logic device that consists of multiple SPLDs interconnected on a single chip (2) A CPLD is based on Product-Of-Sums (POS) architecture (3) A CPLD consists of multiple groups of PAL with programmable interconnection (4) A CPLD can be used to implement a large logic function
Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
Which of the following statement is true for Programmable Logic array (PLA) ?
A class III mathematics teacher gave the following questions to her students:  \(\begin{equation} \frac{ \begin{array}[b]{r} 256 \\ + 173 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 28 \\ + 32 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 129 \\ + 76 \end{array} }{ } \end{equation}\) Later she asks the students to solve a worksheet that has similar questions. Which of the following statements is appropriate for the given situation?
A material is loaded elastically under plane stress condition given by the following tensor:
\[\left[ {\begin{array}{*{20}{c}} 1 \\ 0 \end{array}\begin{array}{*{20}{c}} 2 \\ 1 \end{array}\begin{array}{*{20}{c}} 0 \\ 0 \end{array}} \right 
interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?
1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}
A 4 × 1 MUX used to implement a 3-input Boolean function is as shown above. The Boolean function F(A, B, C) implemented is:
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory