Practice problems Set 2

Size: px

Start display at page:

Download "Practice problems Set 2"

Kristian Freeman
5 years ago
Views:

1 Practice problems Set 2 1) Write a program to obtain transpose of a 4 x 4 matrix. The transpose of matrix is obtained by exchanging the elements of each row with the elements of the corresponding column. 2) The area of a triangle can be computed by the sine law when 2 sides of the triangle and the angle between them are known. Area = (1 / 2 ) ab sin ( angle ) Given the following 6 triangular pieces of land, write a program to find their area and determine which is largest, Plot No. a b angle ) A 5-digit positive integer is entered through the keyboard, write a function to calculate sum of digits of the 5-digit number: (1) Without using recursion (2) Using recursion 4) Write a program to count the number of occurrences of any two vowels in succession in a line of text. For example, in the sentence Please read this application and give me gratuity such occurrences are ea, ea, ui. 5) Analyze the following programs and try to understand pointer concepts 1) main( ) int i = 5, j = 2 ; junk ( i, j ) ; junk ( int i, int j ) i = i * i ; j = j * j ;

2 (2) main( ) int i = 5, j = 2 ; junk ( &i, &j ) ; junk ( int *i, int *j ) *i = *i * *i ; *j = *j * *j ; (3) main( ) int i = 4, j = 2 ; junk ( &i, j ) ; junk ( int *i, int j ) *i = *i * *i ; j = j * j ; (4) main( ) float a = 13.5 ; float *b, *c ; b = &a ; /* suppose address of a is 1006 */ c = b ; printf ( "\n%u %u %u", &a, b, c ) ; printf ( "\n%f %f %f %f %f", a, *(&a), *&a, *b, *c ) ; 6. Write a recursive function to solve the following problem f(n) = f(n 1) + f(n/2) + n, for n > 1 f(1) = 0 for n = 1 You can assume that the given n is always a power of 2 7. Write a matrix multiplication function Int** multiply(int** A, int ** B, int m, int n, int k); Here, the matrix is represent as 2D array (int**). The goal is to compute A*B. The dimension of A is m*k and k * n for B. The result matrix will have the dimension of m * n

3 8. For each recursive function, we can argue that there is a substitution as a loop code. What are the pros/ cons for each? 9. Anagram definition is given as (From Google) a word, phrase, or name formed by rearranging the letters of another, such (ascinema,iceman), (debitcard, badcredit), (dormitory, dirtyroom) Given 2 strings represented by char*, write a function to determine if the 2 given strings are anagram. The function signature is as below int isanagram(char* s1, char* s2) Return 1 for true, 0 for false Note that there s no requirement that the string must be proper English word in order to be an anagram. 10. Write a function to determine if the given parenthesis string is valid. Function signature is int valid_parenthesis(char* s); Your function should return an int where 1 means valid and 0 means invalid For example, "(())" return 1 ")(" return 0 "((())" return 0 "()(())" return 1 You can assume that there's nothing else but '(' and ')' in the given string s. 11. write a program to do the following: Write a structure (struct date) that represent a date and consists of three integers, day, month and year. Write function cmpdate(struct date date1, struct date date2), which returns an integer: o 0: if date1 and date2 are equal. o 1: if date1 > date2. o -1: if date1 < date2. Comparison dates include comparing year, month and day. o Example: date1= 12/3/2015 date2=12/3/2015 return 0 date1= 12/5/2015 date2=12/3/2015 return 1 date1= 12/3/2015 date2=1/3/2016 return -1

4 Create an array of type date and size 10 and store the following dates in it. o 12/3/2015 o 12/8/2012 o 9/3/2015 o 11/7/2012 o 11/7/2020 o 11/7/2015 o 8/1/2016 o 12/29/2015 o 11/29/2016 o 10/1/2017 Compare today (first parameter of the function) with all dates of the array and print the result. 12. Write the following function using the following structure for a point. typedef struct double x, y; Point; (a) A function that passes a point and returns an integer (1, 2, 3, or 4) to indicate in which quadrant the point is located. (b) A function that passes two points and returns the distance of them. (c) A function that passes two points and generate the line equation that passes these two points. (d) A function that passes three points and return the area formed by these three points. 13. Write a function factorial (int n) that returns n!. 14. Identify and correct the errors in each of the following statements: (a) char *str = happy ; str[1] = e ; str[2] = l ; (b) int a[8, 8] = 0, i; while(i++ =< 8) b[i, i] = i * i; (c) mul (double x, y) double x, y; return x * y; 15. Declare an array x of doubles with two indices, such that the first index can take values 0 to 9 and the second can take values 0 to Find the Largest Number from the array Using Dynamic Memory Allocation. Note: Depending upon the number of elements, the required size is allocated dynamically which prevents the wastage of memory in a pre-define manner. You may first create an array with a very large size in your previous codes to collect the input elements from the user. But it is not dynamic memory allocation for this problem. 17. Write a program to count the number of vowels and consonants in a string using a pointer For example: Input string: program Number of vowels: 2 Number of consonants: 5

5 18. Find the number repeated maximum number of times in an array for which memory should be allocated at run time. The input numbers and size of the array should be provided by the user. You can assume the numbers to be integers. Example: Input: Enter size of array : 5 Enter Numbers: Output: Max repeat number : 2

B. V. Patel Institute of Business Management, Computer & Information Technology, UTU 2013

B. V. Patel Institute of Business Management, Computer & Information Technology, UTU 2013 Information Technology, UTU 203 030000 Fundamentals of Programming Problems to be solved in laboratory Note: Journal should contain followings for all problems given below:. Problem Statement 2. Algorithm