Design a K-Map for \(F(x, y, z) = x\overline{z} + xyz + y\overline{z}\) of \(F(x, y, z)\) and find prime implicants.
\(xy, y\overline{z}, x\overline{z}\)
Write each product term as minterms (order x, y, z): \(x\overline{z}\) covers 100 and 110, i.e. \(m_{4}, m_{6}\); \(xyz\) is 111, i.e. \(m_{7}\); \(y\overline{z}\) covers 010 and 110, i.e. \(m_{2}, m_{6}\).
So \(F = \sum m(2, 4, 6, 7)\). On the 3-variable K-map these four 1-cells are placed and grouped into the largest possible rectangles of size 2 (no group of 4 exists, because \(m_{0}\), \(m_{3}\) and \(m_{5}\) are 0).
The pair \(m_{6}, m_{7}\) (110, 111) gives \(xy\); the pair \(m_{2}, m_{6}\) (010, 110) gives \(y\overline{z}\); the pair \(m_{4}, m_{6}\) (100, 110) gives \(x\overline{z}\). None of these can be enlarged, so all three are prime implicants.
Terms such as \(yz\), \(\overline{x}y\) or \(\overline{x}z\) would include the 0-cells \(m_{3}\) or \(m_{1}\), and single literals x, y, z each cover cells where F = 0, so they cannot be implicants.
Check: \(xy + y\overline{z} + x\overline{z}\) is 1 exactly for 010, 100, 110 and 111, which reproduces \(\sum m(2, 4, 6, 7)\).
Hence, \(xy, y\overline{z}, x\overline{z}\).
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
| List I | List II |
| (a) New York Public Library | (i) Shelv AR |
| (b) Miami University Augmented Research Group | (ii) Smart library |
| (c) Oula University Library | (iii) Wolf Walk |
| (d) North Carolina State University | (iv) Find the future |
Codes:
Which part of the QR code represents the encoded data?