Aryan College
BSc IT Part I: C Programming and Data Structure
Unit I
1. What is ternary operator? (2018)
2. What do you mean by reference variable? (2018)
3. Differentiate prefix and postfix increment operator. (2018)
4. How many bytes used by double data type variable? (2018)
5. What are C tokens? (2019)
6. Explain Hierarchy of operators. (2019)
7. What is type conversion in C programming? How it is achieved in user defined data types? (2019)
Unit II
1. What is the use of ‘\t’ in C Programming? (2018)
2. Describe rules for creating a valid identifier. (2018)
3. Explain explicit type conversion. (2018)
4. Differentiate control entry loop and control exit loop with example (2018)
Unit III
1. Define Register variable? (2018)
2. Find out total number of elements for the following 4D array: (2018)
int a [4][3][3][4];
3. Define a string. Write a program to find out a string is palindrome or not. (2018)
4. What is recursive function? (2019)
5. Find out total number of element for the following 4-D array. (2019)
int a[4][3][3][4];
6. Define prototyping. (2019)
7. What do you mean by nested loop? (2019)
8. What is static and Register Variable? (2019)
9. Differentiate entry control loop and exit control loop with suitable example. (2019)
10. Define string with a program to find out a string is palindrome or not. (2019)
Unit IV
1. What is typedef? (2018)
2. Define dynamic memory allocation. (2018-19)
3. Explain nesting of structure. (2018)
4. Write a program where a pointer points to a structure. (2018)
5. Write a program to find a factorial through recursion. (2018)
6. Write a program to call a function by reference. Use this function to swap two values. (2018-19)
7. Explain enum and Bit fields in detail. (2019)
8. Write a program where pointer points a structure. (2019)
9. Write a program to find out factorial using recursion. (2019)
Unit V
1. Define Kruskal’s Algorithm. (2018)
2. Differentiate between prefix, infix and postfix notations in brief. (2018)
3. Explain Stack in brief. (2018)
4. Explain Queue in brief. (2018)
5. What is threaded tree? (2019)
6. What is prism algorithm? (2019)
7. Differentiate prefix, postfix and infix notation in brief. (2019)
C/BSc-IT I Page 1
Aryan College
8. What is the use of head node in a linked list? Explain. (2019)
9. Write and explain function to insert a new node into a binary search tree. (2019)
10. Differentiate quick sort and merge sort in detail. (2018-19)
11. Differentiate depth first search and breadth first search with example. (2018-19)
12. List the property of threaded tree. Write an algorithm to search elements from a threaded tree. (2019)
C/BSc-IT I Page 2
