Advertisements
Advertisements
State any one use of interfaces in Java.
Concept: undefined >> undefined
Reduce the above expression X (P, S, E, B) by tiifig 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: undefined >> undefined
Advertisements
Reduce the Boolean function F (A,B,C,D) = π (0, 2, 4, 6, 8, 9, 10, 11, 14) by using 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs).
Concept: undefined >> undefined
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: undefined >> undefined
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: undefined >> undefined
Design a class Check which checks whether a word is a palindrome or not.
(Palindrome words are those which spell the same from either ends).
Example: MADAM, LEVEL etc.
The details of the members of the class are given below:
| Class name | Check |
| Data members/instance variables: | |
| wrd | stores a word |
| len | to store the length of the word |
| Methods/Member functions: | |
| Check( ) | default constructor |
| void acceptword( ) | to accept the word |
| boolean palindrome( ) | checks and returns ‘true’ if the word is a palindrome otherwise returns ‘false’ |
| void display( ) | displays the word along with an appropriate message |
Specify the class Check giving details of the constructor, void acceptword( ), boolean palindrome( ) and void display( ). Define the main( ) function to create an object and call the functions accordingly to enable the task.
Concept: undefined >> undefined
Design a class Toggle which toggles a word by converting all upper case alphabets to lower case and vice versa.
Example: The word “mOTivATe” becomes “MotIVatE”
The details of the members of the class are given below:
| Class name | Toggle |
| Data members/instance variables: | |
| str | stores a word |
| newstr | stores the toggled word |
| len | to store the length of the word |
| Methods/Member functions: | |
| Toggle( ) | default constructor |
| void readword( ) | to accept the word |
| void toggle( ) | converts the upper case alphabets to lower case and all lower case alphabets to upper case and stores it in newstr |
| void display( ) | displays the original word along with the toggled word |
Specify the class Toggle giving details of the constructor, void readword( ), void toggle( ) and void display( ). Define the main( ) function to create an object and call the functions accordingly to enable the task.
Concept: undefined >> undefined
