ISC (Science) ISC Class 12 - CISCE Important Questions

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.

What is the importance of the reference part in a Linked List?

Convert the following infix notation to prefix notation.

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

A double ended queue is a linear data structure which enables the user to add and remove integers from either ends i.e., from front or rear.

The details for the class deQueue are given below:

Specify the class deQueue giving details of the function void addFront(int) and int popFront(). Assume that the other functions have been defined. The main() function and algorithm need NOT be written.

Differentiate between a stack and a queue.

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

1. Write the pre-order traversal of the above tree structure.
2. Name the parent of the nodes D and B. 
3. State the level of nodes E anf F when the root is at level 0.

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.

Write the minterm of F(A, B, C, D) when A = 1, B = 0, C = 0 and D = 1.

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

How old was Jem when he broke his arm?

The first chapter focusses on telling stories. This primarily serves to ______.

What literary significance does Mr Radley’s sealing the knot-hole in the tree have?