0
Computer Programming & Utilization : Question Paper Jan 2012 - First Year Engineering (Semester 1) | Gujarat Technological University (GTU)

Computer Programming & Utilization - Jan 2012

First Year Engineering (Semester 1)

TOTAL MARKS: 100
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks.
1 (a) Answer the following:
i) Explain prinft() and scanf() giving their syntax.
ii) Whats is recursion? Explain it with suitable example.
iii) Write short note on Pointer.
iv) Explain switch... case statement.
(12 marks)
1 (b) What is Algorithm?(2 marks) 2 (a) Explain various symbols used in Flowchart and draw the flowchart for finding Smallest number out of three given numbers.(7 marks) 2 (b) Write a program in C to generate Fibonacci series like following:
1, 1, 2, 3, 5, 8, 13 .....
Generate 20 such numbers.
(7 marks)
3 (a) Draw the Block diagram of Computer System and explain.(7 marks) 3 (b) Write a program to display following pattern using nested for loops.

* * * * *
* * * *  
* * *    
* *      
*        

(7 marks) 4 (a) Explain various operators used in C language.(7 marks) 4 (b) Explain how string is defined in C. Write user defined functions for the following:
i) strlen(): to find length of strings
ii) strcat(): to concate two strings
(7 marks)
5 (a) Write a C program to Add two 3×3 Matrix.(8 marks) 5 (b) Define Software, Hardware, Higher level Language, Operating System.(6 marks) 6 (a) Write a C program to read 10 numbers from user and find Sum, Maximum and Average of them.(8 marks) 6 (b) What is used defined function? Explain types of functions with example.(6 marks) 7 (a) What is structure? Explain with example how to declare a structure and how to initialize it.(4 marks) 7 (b) Write short notes on following (Any Two).
(i) File Operations in C
(ii) Data types in C
(iii) Scope and Lifetime of Variable.
(10 marks)

0

Continue reading

Find answer to specific questions by searching them here. It's the best way to discover useful content.

Find more