Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Tribhuwan University

Institute of Science and Technology

2080

Bachelor Level / First Year / First Semester / Science

B.Sc in Computer Science and Information Technology (CSC115)

(C Programming)

Full Marks: 60

Pass Marks: 24

Time: 3 Hours

Candidates are required to give their answers in their own words as for as practicable.

The figures in the margin indicate full marks.

Section A

Long Answers Questions

Attempt any TWO questions.
[2*10=20]
1.
Define structure and nested structure. Write a program to find out whether the nthn^{th} 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. Use separate user-defined function to (i) generate nthn^{th} term and (ii) to check whether that number is prime or not. [3+7]
2.
Explain the relation to array and pointer. Differentiate between call by value and call by reference with a suitable program. [2+8]
3.
Differentiate between source code and object code. Create a structure named Book which remembers Book_Name, Price and Author. Then, make the list of top 10 records of book and print the name of authors having the price of book greater than 1000. [3+7]
Section B

Short Answers Questions

Attempt any Eight questions.
[8*5=40]
4.
Describe the different types of I/O functions used in file handling with syntax. [5]
5.
Write a program to read P*Q matrix of integers and find the largest integer of each row and display it. [5]
6.
Write a program to calculate the factorial of a given number using recursion. [5]
7.
Write a program to check whether the entered word is palindrome or not. [5]
8.
Write a program to compute the sum of first 10 even numbers using function. [5]
9.
What is dynamic memory allocation? Explain with a suitable program. [5]
10.
Write a program to initialize an array of dimension 10 and sort the numbers within the array in ascending order. [5]
11.
Trace the output
#include <conio.h>\texttt{\#include }
#include <stdio.h>\texttt{\#include }
void main() {\text{void main() \{}
int i = 0, k;\text{int i = 0, k;}
for (k = 5; k >= 0; k–) {\text{for (k = 5; k >= 0; k--) \{}
i = i + k;\text{i = i + k;}
}\text{\}}
printf("%d\t", i);\texttt{printf("\%d\textbackslash t", i);}
getch();\text{getch();}
}\text{\}}
[5]
12.
List different types of operators and explain any three of them. [5]