Design a class NumDude to check if a given number is a Dudeney number or not. (A Dudeney number is a positive integer that is a perfect cube, such that the sum of its digits is equal to the cube root of the number.)
Example: 5832 = (5+8+3+2)=(18)³ = 5832
Some of the members of the class are given below:
Class name : NumDude
Data member/instance variable:
num:to store a positive integer number
Methods/Member functions:
NumDude():default constructor to initialise the data member with legal initial value
void input():to accept a positive integer number
int sumDigits(int x):returns the sum of the digits of number 'x' using recursive technique
void isDude():checks whether the given number is a Dudeney number by invoking the function sumDigits() and displays the result with an appropriate message
Specify the class NumDude giving details of the constructor(), void input(), int sumDigits(int) and void isDude(). Define a main() function to create an object and call the functions accordingly to enable the task.
        

A class Trans is defined to find the transpose of a square matrix. A transpose of a matrix is obtained by interchanging the elements of the rows and columns.
Example: If size of the matrix = 3, then

Some of the members of the class are given below:
Class name: Trans
Data members/instance variables:
arr[][]:to store integers in the matrix
m:integer to store the size of the matrix
Methods/Member functions:
Trans(int mm): parameterised constructor to initialise the data member m = mm
void fillarray():to enter integer elements in the matrix to create the transpose of the given matrix
void transpose():to create the transpose of the given matrix
void display():displays the original matrix and the transposed matrix by invoking the method transpose()
Specify the class Trans giving details of the constructor(), void fillarray(), void transpose() and void display(). Define a main() function to create an object and call the functions accordingly to enable the task.
        

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 of the class deQueue are given below:
Class name: deQueue
Data members/ instance variables:
Qrr[]:array to hold integer elements
lim: maximum capacity of the dequeue
front: to point the index of the front end
rear:to point the index of the rear end
Methods/Member functions:
deQueue(int l):constructor to initialise lim= 1, front = 0 and rear = 0
void addFront(int v):to add integers in the dequeue at the front end if possible, otherwise display the message "OVERFLOW FROM FRONT"
void addRear(int v):to add integers in the dequeue at the rear end if possible, otherwise display the message "OVERFLOW FROM REAR"
int popFront():removes and returns the integers from the front end of the dequeue if any, else returns -999
int popRear(): removes and returns the integers from the rear end of the dequeue if any, else returns -999
void show():displays the elements of the dequeue
Specify the class deQueue giving details of the functions void addFront(int) and int popFront(). Assume that the other functions have been defined. The main() function and algorithm need NOT be written.
        

A super class Demand has been defined to store the details of the demands for a product. Define a subclass Supply which contains the production and supply details of the products. 
The details of the members of both the classes are given below:
Class name: Demand
Data members/instance variables:
pid:string to store the product ID
pname:string to store the product name
pdemand: integer to store the quantity demanded for the product
Methods/Member functions:
Demand(...) : parameterised constructor to assign values to the data members
void display():to display the details of the product
Class name:Supply
Data members/instance variables:
pproduced: integer to store the quantity of the product produced
prate:to store the cost per unit of the product in decimal
Methods/Member functions:
Supply(...): parameterised constructor to assign values to the data members of both the classes
double calculation(): returns the difference between the amount of demand (rate x demand) and the amount produced(rate x produced)
void display():to display the details of the product and the difference in amount of demand and amount of supply by invoking the method calculation()
Assume that the super class Demand has been defined. Using the concept of inheritance, specify the class Supply giving the details of the constructor(...), double calculation() and void display().
The super class, main function and algorithm need NOT be written.
        

(i) A linked list is formed from the objects of the class given below
class Node
{
double sal; 
Node next;
}
Write an Algorithm OR a Method to add a node at the end of an existing linked list. The method declaration is as follows:
void addNode(Node ptr, double ss)
(ii) Answer the following questions from the diagram of a Binary Tree given below:

(a) Write the pre-order traversal of the above tree structure.
(b) Name the parent of the nodes D and B.
(c) State the level of nodes E and F when the root is at level 0.