Please select a subject first
Advertisements
Advertisements
Reduce the above expression X ( E, R, S, C ) by using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs).
Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.
Concept: Use of Karnaugh Map for Minimization of Boolean Expressions (Up to 4 Variables)
Reduce the Boolean function F(P,Q,R,S) = (P+Q+R+S) • (P+Q+R+Sꞌ) • (P+Q+Rꞌ+S) • (P+Qꞌ+R+S) • (P+Qꞌ+R+Sꞌ) • (P+Qꞌ+Rꞌ+S) • (P+Qꞌ+Rꞌ+Sꞌ) •(Pꞌ+Q+R+S) • (Pꞌ+Q+R+Sꞌ) by using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs).
Concept: Use of Karnaugh Map for Minimization of Boolean Expressions (Up to 4 Variables)
From the given logic diagram:

- Derive Boolean expression and draw the truth table for the derived expression
- If A=1, B=0 and C=1, then find the value of X.
Concept: Truth Tables
Verify if the following proposition is valid using the truth table:
(X ∧ Y) =>Z = (Y => Z) ∧ (X => Y).
Concept: Truth Tables
Differentiate between half adder and full adder. Write the Boolean expression and draw the logic circuit diagram for the SUM and CARRY of a full adder.
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
How is Encoder different from a decoder?
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
Draw the logic circuit for a 4 :1 multiplexer and explain its working.
Concept: Elementary Logic Gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and Their Use in Circuits
When a sequence of OR, NOT, NOR are connected in series, the logic gate obtained is ______.
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
Idempotence Law states that ______.
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
Draw the logic gate diagram for 2-input OR gate using NAND gates only. Show the expression at each Step.
Concept: Elementary Logic Gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and Their Use in Circuits
Draw the logic circuit for 3:8 decoder (Octal decoder). Which multiplexer can be derived from the Octal decoder?
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
A full adder needs five gates and those are 3 AND gates, 1 OR gate and 1 XOR gate. When a full adder is constructed using 2 half adders, it also requires 5 gates. State the names along with the quantity those gates.
Concept: Elementary Logic Gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and Their Use in Circuits
Draw the logic circuit to decode the following binary number (0001, 0101, 0111, 1000, 1010, 1100, 1110,1111) to its hexadecimal equivalents. Also, state the Hexadecimal equivalents of the given binary numbers.
Concept: Applications of Boolean Algebra and Logic Gates to Half Adders, Full Adders, Encoders, Decoders, Multiplexers, NAND, NOR as Universal Gates
Answer the following questions related to the below image:

- What is the output of the above gate if input A=0, B=1?
- What are the values of the inputs if output =1?
Concept: Elementary Logic Gates (NOT, AND, OR, NAND, NOR, XOR, XNOR) and Their Use in Circuits
A linked list is formed from the objects of the class given below:
class Node
{
doubel sal;
Node next;
}
Write an Algorithm OR a Method to add a node at the end of the an existing linked list. The method declaration is as follows:
void addNote(Node ptr, double ss)
Concept: Implementation of Algorithms to Solve Problems
The keyword that allows multi-level inheritance in Java programming is ______.
Concept: Programming in Java (Review of Class Xi Sections B and C)
Write the canonical form of the cardinal terms, m3 and M5 for F (A, B, C, D).
Concept: Programming in Java (Review of Class Xi Sections B and C)
A class Ins Sort contains an array of integers which sorts the elements in a particular order.
Some of the members of the class are given below.
| Class name | InsSort |
| arr[ ] | stores the array elements |
| size | stores the number of elements in the array |
| Methods/Member functions: | |
| InsSort(int s) | constructor to initialise size= s |
| void getArray( ) | accepts the array elements |
| void insertionSornt( ) | sorts the elements of the array in descending order using the in descending order using the Insertion Sort technique |
| double find( ) | calculates and returns the average of all the odd numbers in the array |
| void display( ) | displays the elements of the array in a sorted order along with the average of all the odd numbers in the array by invoking the function find( ) with an appropriate message |
Specify the class InsSort giving details of the constructor(), void getArray( ), void insertionSort( ), double find() and void display(). Define a main( ) function to create an object and call all the functions accordingly to enable the task.
Concept: Programming in Java (Review of Class Xi Sections B and C)
Design a class Coding to perform some string related operations on a word containing alphabets only.
Example: Input: "Java"
Output: Original word: Java
J=74
a=97
v= 118
a=97
Lowest ASCII code: 74
Highest ASCII code: 118
Some of the members of the class are given below:
| Class name | Coding |
| Data members/instance variables: | |
| wrd | stores the word |
| len | stores the length of the word |
| Methods/Member functions: | |
| Coding() | constructor to initialise the data members with legal initial values |
| void accept( ) | to accept a word |
| void find() | to display all the characters of 'wrd' along with their ASCII codes. Also display the lowest ASCII code and the highest ASCII code, in 'wrd' |
| void show() | to display the original word and all the characters of 'wrd' along with their ASCII codes. Also display the lowest ASCII code and the highest ASCII code in 'wrd', by invoking the function find() |
Specify the class Coding giving details of the constructor( ), void accept( ), void find( ) and void show(). Define a main() function to create an object and call all the functions accordingly to enable the task.
Concept: Programming in Java (Review of Class Xi Sections B and C)
