Please select a subject first
Advertisements
Advertisements
State the principle by which the stack data structure works.
Concept: Basic Data Structures (Stack, Queue, Dequeue)
Convert the following infix notation to postfix notation:
A * (B + C / D ) – E / F Concept: Conversion of Infix to Prefix and Post Fix Notations
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.
Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
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.
Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
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:
| Class name | Queue |
| Data member/instance variable: | |
| dat[ ] | array to hold the integer elements |
| cap | stores the maximum capacity of the queue |
| front | to point the index of the front |
| rear | to point the index of the rear |
| Member functions/methods: | |
| Queue(int max) | constructor to initialize the data member cap = max, front = rear = 0 and create the integer array |
| void add_dat(int v) | to add integers from the rear index if possible else display the message(“Queue full”) |
| int pop_dat( ) | to remove and return elements from front, if any, else returns -999 |
| void display() | to display elements of the queue |
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.
Concept: Basic Data Structures (Stack, Queue, Dequeue)
Convert the following infix notation to postfix form.
(P + Q * R - S)/T * U
Concept: Conversion of Infix to Prefix and Post Fix Notations
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.
| Class name | CardGame |
| Data members/instance variables: | |
| cards[] | array to store integers as cards |
| cap | to store the maximum capacity of array |
| top | to store the index of the topmost element of the array |
| Methods/Member functions: | |
| CardGame(int cc) | constructor to initialise cap=cc and top= -1 |
| void addCard(int v) | to add the card at the top index if possible, otherwise display the message “CARD PILE IS FULL” |
| int drawCard( ) | to remove and return the card from the top index of the card pile, if any, else return the value -9999 |
| void display( ) | to display all the cards of card pile |
- 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. - Name the entity described above and state its principle.
Concept: Implementation Directly Through Classes
Answer the following questions based on the diagram of a Binary Tree given below:

- Name the external nodes of the tree.
- State the degree of node M and node L.
- Write the post-order traversal of the above tree structure.
Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
Convert the following infix notation to prefix form.
( A – B ) / C * ( D + E )
Concept: Conversion of Infix to Prefix and Post Fix Notations
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:
| Class name | ReCycle |
| Data members/instance variables: | |
| ele[ ] | the array to hold the integer elements |
| cap | stores the maximum capacity of the array |
| front | to point the index of the front |
| rear | to point the index of the rear |
| Methods / Member functions: | |
| ReCycle (int max) | constructor to initialize the data cap = max, front = rear = 0 and to create the integer array. |
| void pushfront(int v) | to add integers from the front index if possible else display the message(“full from front”). |
| int popfront( ) | to remove the return elements from front. If array is empty then return-999 |
| void pushrear(int v) | to add integers from the front index if possible else display the message(“full from rear”). |
| int poprear( ) | to remove and return elements from rear. If the array is empty then return-999. |
- 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. - Name the entity described above and state its principle.
Concept: Basic Algorithms and Programs Using the Above Data Structures
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)
Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
Answer the following questions from the diagram of a Binary Tree given below:

- Name the root of the left sub tree and its siblings.
- State the size and depth of the right sub tree.
- Write the in-order traversal of the above tree structure.
Concept: Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
With the help of an example, briefly explain the dominant term in complexity.
Concept: Importance of Dominant Term
For Big O notation, state the difference between O(n) and O(n2 ).
Concept: Big O Notation for Computational Complexity
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.
Concept: Concept of Demand
Differentiate between the expansion of demand and an increase in demand, using diagrams.
Concept: Movement along the Demand Curve and Shift of the Demand Curve
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?

Concept: Concept of Demand
Milk is used for making curd, sweets and chocolates.
What type of demand does milk have? Give a reason.
Concept: Concept of Demand
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.
Concept: Demand Curve
Draw a straight-line demand curve joining both the axes. Indicate the following on the demand curve.
Elasticity of demand is equal to zero
Concept: Demand Curve



