हिंदी

ISC (Commerce) कक्षा १२ - CISCE Question Bank Solutions

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

Please select a subject first

Advertisements
Advertisements
< prev  341 to 360 of 828  next > 

With the help of an example, briefly explain the dominant term in complexity.

[14] Complexity and Big O Notation
Chapter: [14] Complexity and Big O Notation
Concept: undefined >> undefined

Convert the following infix notation to prefix form.

( A – B ) / C * ( D + E )

[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

Advertisements

From the given logic diagram:

  1. Derive Boolean expression and draw the truth table for the derived expression
  2. If A=1, B=0 and C=1, then find the value of X.
[1] Boolean Algebra
Chapter: [1] Boolean Algebra
Concept: undefined >> undefined

Verify if the following proposition is valid using the truth table:

(X ∧ Y) =>Z = (Y => Z) ∧ (X => Y).

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

Answer the following question on the diagram of a Binary Tree given below:

State the degree of the nodes C and G. Also, state the level of these nodes when the root is at level 0.

[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

Answer the following question on the diagram of a Binary Tree given below:

Write the pre-order and post-order traversal of the above tree structure.

[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

Answer the following questions based on the diagram of a Binary Tree given below:

  1. Name the external nodes of the tree.
  2. State the degree of node M and node L.
  3. Write the post-order traversal of the above tree structure.
[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

A linked list is formed from the objects of the class Node. The class structure of the Node is given below:

class Node
{
      int n;
      Node link;
}

Write an Algorithm OR a Method to search for a number from an existing linked list. The method declaration is as follows:

void FindNode( Node str, int b)

[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

Answer the following questions from the diagram of a Binary Tree given below:

  1. Name the root of the left sub tree and its siblings.
  2. State the size and depth of the right sub tree.
  3. Write the in-order traversal of the above tree structure.
[13] Data Structures
Chapter: [13] Data Structures
Concept: undefined >> undefined

For Big O notation, state the difference between O(n) and O(n2 ).

[14] Complexity and Big O Notation
Chapter: [14] Complexity and Big O Notation
Concept: undefined >> undefined

The ability of an object to take many forms is known as ______.

[12] Inheritance and Polymorphism
Chapter: [12] Inheritance and Polymorphism
Concept: undefined >> undefined

According to the Principle of duality, the Boolean equation

(A+ B') • (A+ 1) =A+ B' will be equivalent to ______.

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

Verify if the following proposition is a Tautology, Contradiction or Contingency using a truth table.

((A => B)^(B => C))=>(A => C)

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

Find the complement of the following expression and reduce it by using Boolean laws.

P•( 13 ± Q)•Q•(Q+R')

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

How is a decoder different from a multiplexer?

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

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

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

[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
< prev  341 to 360 of 828  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×