Advertisements
Advertisements
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
