Home > Download > SMU - Question Paper
> BSc IT > BT0065
C Programming and Data Structures – Theory
This is the collection of
Sikkim Manipal University (SMU) question and answers for C Programming and Data Structures – Theory . It will help
to prepare your examination. All question paper are
classified as per semester, subject code and question type of Part A, Part B and Part C with
multiple
choice options
as same as actual examination. SMU question papers includes
year 2025, 2024, 2023 Sem I, II, III, IV, V, VI examinations
of all subjects.
SMU question test set of old,
last and previous year are updated
regularly and it is absolutely free to use. Question paper includes Visual basic 6, VB.Net, C#, ASP.Net,
Web, Oracle, Database, SQL, Software Engineering, C, C++, OOPS, MBA, MCA, BSC IT I have requested
you kindly send me the question paper of C Programming and Data Structures – Theory , SMU - Bachelor of Science in Information Technology.
Course Name
BSc IT (Bachelor of Science in Information Technology)
Subject Code BT0065 (C Programming and Data Structures – Theory )
Get Questions
PART - A
PART - B
PART - C
Subject : C Programming and Data Structures – Theory
BT0065 : PART - C
Q. 1 | Predict the output of following program for input of 6 #include #include void main() { int i, j, k=1; clrscr(); printf(“\n enter a number :\t”); scanf(“%d”, &j); do { k*=i; printf(“%d”, |
| A) | 1 2 6 24 120 720 |
| B) | 720 | | C) | compile time error | | D) | run time error | | | | Q. 2 | Match the following with respect to storage classes SET A i) variables validity is limited to function in which it has been declared ii) variable is available to the rest of program from the point of definition iii) variable is |
| A) | i-a, ii-b, iii-c, iv-d |
| B) | i-b, ii-a, iii-c, iv-d | | C) | i-a, ii-b, iii-d, iv-c | | D) | i-c, ii-d, iii-a, iv-b | | | | Q. 3 | Match the following SET A i) Linear search ii) Binary search iii) Hash search iv) Binary tree search SET B a) used for searching in a sorted array b) find the hash value c) start at root and then go to left subtree and |
| A) | i-d, ii-a, iii-b, iv-c |
| B) | i-d, ii-a, iii-b, iv-e | | C) | i-d, ii-c, iii-b, iv-a | | D) | i-a, ii-b, iii-c, iv-d | | | | Q. 4 | The errors during I/O operations are |
| A) | Reading beyond EOF |
| B) | Able to open a file | | C) | Valid file name | | D) | All of the above | | | | Q. 5 | Select the correct statement from the following a) strcmp compares first n characters of one string to another b) strncmp compares two strings with out regard to case c) strnicmp compares first n characters of two strings witho |
| A) | a, b, c, d, e |
| B) | a, c, d | | C) | b, d, e | | D) | c, d, e | | | |
Click here to get
C Programming and Data Structures – Theory (BT0065 )
New Question
Home > Download > SMU - Question Paper
> BSc IT > BT0065