BSc CSIT (TU) Science C Programming (BSc CSIT, CSC115) Question Paper 2075
This is the official BSc CSIT (TU) (Science stream) C Programming (BSc CSIT, CSC115) question paper for 2075, as set in the regular annual examination. It carries 60 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this C Programming (BSc CSIT, CSC115) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BSc CSIT (TU) C Programming (BSc CSIT, CSC115) exam or solving previous years' question papers, this 2075 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Explain different types of decision-making (branching) statements in C with syntax and examples. Differentiate if-else with switch statement.
What is a function? Explain function declaration, definition and call. Differentiate call by value and call by reference with examples.
Write a program to read a matrix of order m x n and find the transpose of the matrix.
Section B: Short Answer Questions
Attempt any EIGHT questions.
What are tokens in C? Explain different types of tokens.
Explain the use of getchar() and putchar() functions with example.
Write a program to find the factorial of a number using recursion.
What is a string? Explain any four built-in string handling functions.
Differentiate between structure and union with example.
Explain the relationship between arrays and pointers.
Write a program to display the Fibonacci series up to n terms.
Explain the use of #define and #include preprocessor directives.
What is dynamic memory allocation? Explain malloc() and calloc().