[Total No. of Questions : 09]
CS/IT 106 (CR)
I/IV B.Tech Degree Examinations, June 2014
First Year
CS/IT
C Programming and Numerical Methods
Time : 3 hours
Maximum Marks : 70
Answer question No.1 Compulsory
Answer ONE question from each Unit
1. Answer the following [14 x 1 = 14M]
a) External port
b) Network
c) Block diagram of a digital computer
d) Syntax of switch-case statement
e) Operator Associativity
f) Storage class
g) Recursive function
h) Towers of Hanoi problem
i) Multi dimensional array
j) Pointer to a structure
k) File structure
l) Newton Raphson method
m) Gauss elimination method
n) Simpson rule
UNIT - I [1 x 14 = 14M]
2. a) Explain Block diagram of a digital computer.
2. b) Write an algorithm for finding roots of a quadratic equation. (OR)
3. a) Write a short note on classification of computers.
3. b) Write a program to check whether given number is Armstrong number or not.
UNIT - II [1 x 14 = 14M]
4. a) Define array. Write a program for matrix multiplication.
4. b) Write short notes on types of recursion. (OR)
5. a) Explain scope and extent of variables.
5. b) Write a program to find the length of a given string without using strlen() function. String must be given by user.
UNIT - III [1 x 14 = 14M]
6. a) Explain different types of operations that we can perform on structures.
6. b) Write short notes on how we pass pointers to structures. (OR)
7. a) Define a file. Construct a file that contains employee information like employee number, employee name and salary and read records into a file.
7. b) Write short notes on user defined data types.
UNIT - IV [1 x 14 = 14M]
$$
8. a) Use the Newton-Raphson method to find a root of the equation x^{3}-2x-5=0.
8. b) Given y^{1}=y-x where y(0)=3 find y(0.1) and y(0.2) correct to four decimal places by using Runge-Kutta method. (OR)
9. a) Solve 10x+2y+z=9, 2x+20y-2z=-44, -2x+3y+10z=22 by using Gauss-Seidal method.
9. b) Given the differential equation y^{11}-xy^{1}-y=0 with the conditions y(0)=1 and y^{1}(0)=0, determine the value of y(0.1) by using Taylor's series.