Q4: Suppose, the same function is defined in both the derived class and the based class. Now if we call this function using the object of the derived class. Compiler will call which
function and elaborate the same used by the compiler.
Q4: Suppose, the same function is defined in both the derived class and the based class. Now if we call this function using the object of the derived class. Compiler will call which
function and elaborate the same used by the compiler.
Q3: Write a program to perform basic to class conversion [Class name: “conversion” with data members: feet and inches (both int)] Convert basic type(int) height in terms of total number of inches into equivalent feet and inches (class type) and display output on screen.
Q3: Write a program to perform basic to class conversion [Class name: “conversion” with data members: feet and inches (both int)] Convert basic type(int) height in terms of total number of inches into equivalent feet and inches (class type) and display output on screen.
Q1: Write a program to take input for n number of doctor records and write records of all cardiologists in a file named: “record1”. Also write records of all those doctors in another file named: “record2” who are taking salary more than INR 80,000. After writing records in both files, merge their contents in another file: “finalrecord” and read all records of “finalrecord” file and display on screen. [Attributes of doctor: doc_id, doc_name, doc_specialization, doc_salary]
Write a program to overload binary + operator using friend function to add values entered in kilo meters and meters and to overload binary – operator using member function to subtract values entered in kilograms and grams
Design an Optimal Binary Search Tree for 7 nodes with their probability is given respectively as
(2,8,7,6,4,3,9). Also find the leaf nodes, root, internal nodes, external nodes, height of OBST, Depth
of the last leaf, Level of the second last leaf node.
Design an Optimal Binary Search Tree for 7 nodes with their probability is given respectively as
(2,8,7,6,4,3,9). Also find the leaf nodes, root, internal nodes, external nodes, height of OBST, Depth
of the last leaf, Level of the second last leaf node.