Tribhuvan University
Institute of Science and Technology
2080
Bachelor Level / first-semester / Science
Computer Science and Information Technology( CSC115 )
C Programming
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Time: 3 Hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.
Section A
Attempt any two questions.
Define structure and nested structure. Write a program to find out whether the nth term of the Fibonacci series is a prime number or not. Read the value of n from the user and display the result in the main function. Uses separate user-defined function to generate the nth Fibonacci term and to check whether that number is prime or not.
Explain the relation to array and pointer. Differentiate call by value and call by reference with a suitable program.
Differentiate between source code and object code. Create a structure named Book with members Book_Name, Price and Author_Name, then take input for 10 records of Book and print the name of authors having the price of book greater than 1000.
Section B
Attempt any eight questions.
Describe the different types of I/O functions used in file handling with syntax.
Write a program to read P*Q matrix of integers and find the largest integer of each row and display it.
Write a program to calculate the factorial of a given number using recursion.
Write a program to check whether the entered word is pallindrome or not.
List different types of operators and explain any three of them.
Trace the output
#include<conio.h>
#include<stdio.h>
void main(){
int i =0,k;
for(k=5;k>=0;k–){
i=i+k;
}
printf(“%d\t”,i);
getch();
}
Write a program to compute the sum of first 10 even numbers using function.
What is dynamic memory allocation? Explain with a suitable program.
Write a program to initialize an array of dimension 10 and sort the numbers within the array in ascending order.