Rupa Pandit solutions for कम्प्युटर एपलीकेशंस [इंग्रजी] इयत्ता १० आयसीएसई chapter 9 - Programs Overall [Latest edition]

Input the income, compute the tax according to the given conditions and display it.

A computer store announced stock clearing sale. They were offering both a discount and a gift. Input the purchase amount and print the amount payable. Also print the gift that should be given to the customer

An e-store announced the following seasonal discounts on certain items purchased. Input the item name and its total cost. Calculate and print the discount. Also print the amount payable.

In a library, books were given to members for two weeks. Upon late return, they were charged at a rate as per following chart:

Input the number of days late. Calculate and print the amount of late fine to be paid.

A paper manufacturing factory revised the salary scale of its employees depending on the number of years of service. Input the number of years of service and the current salary. Calculate and display the revised amount an employee will get as salary, on the given following rate of increment:

Write program to print all common factors of two numbers.

Write program to print all common multiples of two numbers up to the product of the numbers.

Print all numbers from t1 to t2 (t1 may be greater or less than t2).

Print the series 105, 5, 110, 10, 115, 15 ......... up to 12 terms.

Write a program to print the digits of a number in new line each (reverse order).

Write a program to create the reverse of a number and print it.

Write a program to check if a number is a numeric palindrome.

Write a program to find and print the sum and product of digits of a number.

Write a program to enter a number and count how many to be omitted ‘1s’ are present in the number.

Write a program to enter a number and print the cube of each digit. Print the sum of the cube of the digits.

Write a program to enter a number and print the sum of factorial of the digits.

Fill an array (type int, size 10).

Print its even elements.

Fill an array (type int, size 10).

Print the average of all the elements.

Fill an array (type int, size 10).

Count how many elements are >= 50.

Fill two arrays (type int, size 5)

In a third array, store the sum of the corresponding elements.

Fill two arrays (type int, size 5)

In a third array, store the larger of the corresponding elements.

Fill an array (type int, size n).

Print the max and the elements min and their position.

Fill an array (type int, size n).

Perform Linear Search; Binary Search.

Fill an array (type int, size n).

Perform Selection Sort; Bubble Sort.

Fill an array (type int, size n).

Perform Left Circular Shift.

Fill an array (type int, size n).

Perform Right Circular Shift.

Write a program to accept a double dimensional array and find the smallest element along with its location.

Write a program to accept a double dimensional array as a parameter and find the sum of the elements of each row.

Write a program to accept an integer double dimensional array and find the sum of its border and the sum of its non border elements separately.

Write a program to store numbers in two double dimensional arrays a and b. Find a b and store in another array c. Print the array c.

Write a program to accept a double dimensional array of size 5 × 6 and find the sum of the elements of each column.

Write a program which accepts an N × N array and prints the upper triangular matrix.

Count the total number of vowels in a string.

Print the last letter of each word.

Print the words in a new line each.

Reverse the words of a sentence.

Initials of a name such that the surname appears first followed by the initials:

Input : Vallabh Bhai Patel

Output : Patel VB

Apply all the following in one program using different functions and sub-functions.

1. Count the total factors of a number int;             fnTotalFactors(int n)
2. Verify whether a number is prime or not;            boolean fnIsPrime(int n)
3. Create the reverse of a number and verify whether it is prime.
4. Count the number of prime factors of a number.
5. Add the digits of a number till the sum comes in a single digit number.

Write a program with overloaded methods to implement the following:

Overload a method Pack(), given that:

1. void Pack(int a, int b) − to print the average of the arguments.
2. void Pack(int n) − to print the cube of the arguments.
3. void Pack(String s) − to print the last character of the argument.

Write a program with overloaded methods to implement the following:

Overload a method fnDiffer(), given that:

1. Int fnDiffer(int a, int b) − to return the difference between the arguments.
2. double fnDiffer (double p, double q) − to return the difference between the arguments.
3. int fnDiffer (String s1, String s2) − to return the difference oflengths between the arguments.

Write a program with overloaded methods to implement the following:

Overload a method fnSeries(), given that:

1. void fnSeries(int n) − to print all the natural numbers from 1 to n.
2. void fnSeries (int n1, int n2) − to print all the natural numbers from n1 to n2 where n1must be greater than n2, otherwise print "Invalid".
3. void fnSeries (double d1, double d2, int d) − to print d number of whole numbers between d1 and d2.

Write a program with overloaded methods to implement the following:

Overload a method fnTab(), given that:

1. int fnTab(String s) − to return how many digits are present in the argument string.
2. String fnTab (String s2, char cd) − to create a new string from argument string s2 such that character cd is removed from it (if present).
3. String fnTab (String s1, String s2) − to concatenate the shorter string behind the longer string and return that. For equal length of both strings, return "O".

1. 10 21 32 43 54 65 76 ... up to n terms.
2. 11 20 31 40 51 60 71 ... up to n terms.
3. 1 2 3 5 6 7 9 10 11 ... up to n terms.
4. 91 82 73 64 55 46 37 28 19
5. 6 26 16 36 26 46 36 56 ... up to n terms.

1. 10 + 21 + 32 + 43 + 54 + 65 + 76 + ... up to n terms.
2. 10 + 11 + 9 + 12 + 8 + 13 + 7 + ... up to n terms.
3. 1 + 2 + 3 - 5 + 6 + 7 - 9 + 10 + 11 ... up to n terms.
4. 1/2 + 2/3 + 3/4 + 4/5 + 5/6 + ... up to n terms.
5. 26 - 16 + 36 - 26 + 46 - 36 + 56 ... up to n terms.