हिंदी

ISC (Science) ISC Class 12 - CISCE Question Bank Solutions

Advertisements
[object Object]
[object Object]
विषयों
मुख्य विषय
अध्याय

Please select a subject first

Advertisements
Advertisements
< prev  321 to 340 of 889  next > 

According to the Principle of duality, the Boolean equation (Aꞌ + B) • (1 + B) = Aꞌ + B will be equivalent to ______.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Distributive law states that ______.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Advertisements

According to De Morgan's law (a +b + c')' will be equal to ______.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

From the logic diagram given below, write the Boolean expression for (1) and (2). Also, derive the Boolean expression (F) and simplify it.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

The compliment of the Boolean expression Aꞌ • (B • Cꞌ + Bꞌ • C).

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Convert the following cardinal expression to its canonical form:

F(P, Q, R) = π(0, 1, 3, 4).

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Write the canonical SOP expression for F (A, B) = A <=> B.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

To be recruited as the Principal in a renowned College, a candidate must satisfy any one of the following criteria:

  • The candidate must be a Postgraduate and should either possess a B.Ed. degree or a teaching experience of more than 15 years?
                                   OR
  • The candidate must be an employee of the same college with a teaching experience of more than 15 years.
                                   OR
  • The candidate must be a Postgraduate but not an employee of the same college and should have a teaching experience of more than 15 years.

The inputs are:

INPUTS  
P Candidate is a Postgraduate
S Candidate is an employee of the same
College
E Candidate has a teaching experience of
more than 15 years
B Candidate possesses a B.Ed. degree

(In all the above cases, 1 indicates yes and 0 indicates no)

Output: X - Denotes eligibility of a candidate [1 indicates eligibility and 0 indicates ineligibility in all cases]

Draw the truth table for the inputs and outputs given above and write the SOP expression for X (P, S, E, B).

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Write the cardinal form of the maxterm X + Y' + Z.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

The complement of the reduced expression of F(A,B) = ∑ (0,1,2,3) is ______.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

A shopping mall announces a special discount on all its products as a festival offer only to those who satisfy any one of the following conditions.

  • If he/she is an employee of the mall and has a service of more than 10 years.
                                     OR
  • A regular customer of the mall whose age is less than 65 years and should not be an employee of the mall.
                                     OR
  • If he/she is a senior citizen but not a regular customer of the mall.

The inputs are:

INPUTS  
E Employee of the mall
R Regular customer of the mall
S Service of the employee is more than 10 years
C Senior citizen of 65 years or above

(In all the above cases, 1 indicates yes and 0 indicates no.)

Output: X - Denotes eligible for discount [1 indicates YES and 0 indicates NO in all cases]

Draw the truth table for the inputs and outputs given above and write the SOP expression for X ( E, R, S, C ).

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Mention any two properties of the data members of an Interface.

[10] Arrays, Strings
Chapter: [10] Arrays, Strings
Concept: undefined >> undefined

Given the Boolean function F(A, B, C, D) = ∑(2, 3, 6, 7, 8, 10, 12, 14, 15).

  1. Reduce the above expression by using 4- variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs.
  2. Draw the logic gate diagram for the reduced expression. Assume that the variables and their complements are available as inputs.
[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Give the Boolean function F(A, B, C, D,) π(0, 1, 2, 4, 5, 8, 10, 11, 14,15).

  1. Reduce the above expression by using 4-variable Karnaugh mpa, showing the various groups (i.e., octal quads and pairs)
  2. Draw the logic gate diagrams for the reduced expression. Assume that the variables and their complements are available as inputs.
[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

State any one use of interfaces in Java.

[10] Arrays, Strings
Chapter: [10] Arrays, Strings
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.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

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).

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
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.

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
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).

[1] Boolean Algebra
Chapter: [1] Boolean Algebra
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.

[10] Arrays, Strings
Chapter: [10] Arrays, Strings
Concept: undefined >> undefined
< prev  321 to 340 of 889  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×