Please select a subject first
Advertisements
Advertisements
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)
Write the minterm of F(A, B, C, D) when A = 1, B = 0, C = 0 and D = 1.
Concept: Big O Notation for Computational Complexity
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
How old was Jem when he broke his arm?
Concept: Prose and Drama
The first chapter focusses on telling stories. This primarily serves to ______.
Concept: Prose and Drama
What literary significance does Mr Radley’s sealing the knot-hole in the tree have?
Concept: Prose and Drama
Which one of the following lines from the novel is thematically significant?
Concept: Prose and Drama
According to legend, who was Bon Bibi’s father?
Concept: Prose and Drama
Statement 1: There was no bindi on her forehead and her arms were free of bangles.
Statement 2: Kanai was convinced that she was a foreigner.
Concept: Prose and Drama
Why was Nirmal obsessed with Morichjhapi?
Concept: Prose and Drama
What was the fate of Lucy Hamilton?
Concept: Prose and Drama
Why does Nora reveal her secret to Mrs Linde in Henrik Ibsen in A Doll’s House?
Concept: Prose and Drama
“A wife hasn't a right to save her husband's life?” How does the statement present a conflict between love and law?
Concept: Prose and Drama
