# Annauniversity lastest info

## Sunday, 27 January 2013

### F.O.C Model Question paper

F.O.C model question paper [old]
COMPUTER PROGRAMMING
(Common to all branches)

Time: 3 hours
Marks:100

PART-A(10x2=20)

1.What are different components of computer?
2.Draw flow chart to find the lowest of two numbers.
3.Write C assignment statements to evaluate the following equation T=(2ab)*g/(a+b).
4.Write a C program to find the greatest of given 10 numbers.
5.What is the advantage of using register variable?
6.Give an example for enumerated data type.
7.What is the difference between structure and union?
8.What do you mean by dynamic memory allocation?
9.Define Stack and Queue.

PART-B(5x16=100)

11 (a) (i) Discuss about different services provided by the internet.
(ii) List the different categories of softwares.
OR
(b) (i) Draw a flow chart to solve a quadratic equation
Ax2+Bx+c=0 where A!=0
(ii)Draw a flow chart for finding the sum of first ten natural numbers.

12 (a) (i) Write a C program to find the simple interest? Inputs are principal amount, period in year and rate of interest.
(ii)Write a program to calculate the sum of remainders obtained by dividing with modular division operation by 2 on 1 to 9 numbers.
OR
(b) (i) Write a C program to evaluate the following series.
x-x3/3!+x5/5!-x7/7!+...xn/n!

13 (a) Write a C program to arrange the names in alphabetical order.
OR
(b) (i)Illustrate the principles of different storage classes in C.
(ii)Write a C program to find the factorial of a given number using recursion.

14 (a) (i)Write a program to display array elements and their address using pointers.
(ii)Write a program to assign pointer value to another variable and write program to add two numbers through their pointers.
OR
(b) (i) Write a program to write data to a text file and to read it.
(ii)Write note on self referential structures.

15 (a) Implement a queue so that each element of the queue hold a list of integers. Write the funcions add_Q and remove_Q for such a queue.
OR
(b) Write a C program to insert to note in the beginning, middle and end of the linked list.