| Other C++ Code Interview Questions |
|| Asked @
|write a program to calculate the radius for a quadratic
equation use modular programming(function abitraction)hint
use quadratic function
|Deriving time complexity of Binary tree and AVL tree, step
|PROBLEM #8 The cashier at the counter of a Super Store, Mr.
Khazaanchi has the following
bundles of rupee cash notes with him:
Rs. 1, 2, 5, 10, 50, 100, 500, 1000
A customer comes at his counter with various items that he
has shopped. Mr. Khazaanchi totals
the item prices and tells the customer his total amount
payable. The customer gives Mr. Khazanchi
some amount of cash. Find the total number of rupee notes of
each denomination (i.e. 1, 2, 5, 10,
50, 100, 500, 1000) Mr. Khazaanchi will have to give to the
withdrawer ensuring that the total
number of rupee notes are minimum.
Its result is Rose Lotus Lotus.. How? Explain it?
printf("Enter a string:");
printf("The entered string is palindrome:");
printf("The entered string is not a palindrome:);
wht would be the explanation with this written code???
|write a program in c++ to scramble a bmp image file using a
scramble key 0x7c and an XOR logic. print out the original
image, the scrambled image and the program.
Note: the first 24bytes of a bmp file contain the header
information of the file.
|Find the maximum product of three numbers in an array?
Max product= 9*5*3= 135
The array can hav negative numbers also..
|What will be the output-
|Write a program using one dimensional array that searches a
number and display the number of times it occurs on the list
of 12 input values.
Sample input/output dialogue:
Enter 12 values:
13 15 20 13 30 35 40 16 18 20 18 20
Enter number to search: 20
|Counting in Lojban, an artificial language developed over
the last fourty years, is easier than in most languages
The numbers from zero to nine are:
Larger numbers are created by gluing the digit togather.
For Examle 123 is pareci
Write a program that reads in a lojban string(representing
a no less than or equal to 1,000,000) and output it in
|Write a program that takes a 3 digit number n and finds out
the number 2^n + 1 is prime, or if it is not prime find out its
|Show by induction that 2n > n2, for all n > 4.
|For more C++ Code Interview Questions Click Here |