ISC (Commerce) कक्षा १२ - CISCE Important Questions

State the principle by which the stack data structure works.

Convert the following infix notation to postfix notation:

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

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.

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.

A Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out).

Define a class Queue with the following details:

Specify the class Queue giving the details of void add_dat(int) and int pop_dat( ). Assume that the other functions have been defined.

The main( ) function and algorithm need NOT be written.

Convert the following infix notation to postfix form.

(P + Q * R - S)/T * U

CardGame is a game of mental skill, built on the simple premise of adding and removing the cards from the top of the card pile.

The details of the class CardGame are given below.

1. Specify the class CardGame giving details of the functions void addCard(int) and int drawCard( ). Assume that the other functions have been defined.
   The main() function and algorithm need NOT be written.
2. Name the entity described above and state its principle.

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.

Convert the following infix notation to prefix form.

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

Recycle is an entity which can hold at the most 100 integers. The chain enables the user to add and remove integers from both the ends i.e. front and rear.

Define a class ReCycle with the following details:

1. Specify the class ReCycle giving details of the functions void pushfront(int) and int poprear( ). Assume that the other functions have been defined.
   The main( ) function and algorithm need NOT be written.
2. Name the entity described above and state its principle.

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)

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.

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

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

Answer the following question.
Discuss the relationship between the income of the consumer and demand for a commodity with respect to normal goods, inferior goods, and necessities.

Differentiate between the expansion of demand and an increase in demand, using diagrams.

The figure given below shows the relation between the quantity demanded for the good X and the price of the good Z. What type of goods are X and Z?

Milk is used for making curd, sweets and chocolates.

What type of demand does milk have? Give a reason.

Figures (A), (B) and (C) given below represent different types of Demand curves.

(A)	(B)	(C)

What kind of goods do each of these Demand curves represent? Give a reason for each of the curves.

Draw a straight-line demand curve joining both the axes. Indicate the following on the demand curve.

Elasticity of demand is equal to zero