ORAL QUESTIONS

C language questions 1. C is called as middle level language? Why? 2. What is the need of header files? 3. Whether printf and scanf are functions? If yes where they are defined? 4. In scanf, we use %d, %f, what it is called? 5. In every C program, we use #include < -----.h >. This # indicates separate language. What it is called? 6. Sometimes we use #define ----- ------. Does it have some special name? 7. What is the name of compiler, which you are using for compilation of C program? What is the need of compiler? 8. In C program, execution of the program starts from main ( ). Does this function return anything? 9. If return type of the function is not mentioned, what is default return type? 10. Why to declare variables? 11. What is use of clrscr( ) and getch ( ) ? 12. Differentiate between function declaration, function definition and function call. If you have used function in your program then show above three. 13. Can you avoid function declaration? If yes, how? 14. How many values function can return? 15. Can we pass array of pointers to function? 16. Why to use pointers? 17. What is difference between array of pointers and pointer to array? 18. How many arithmetic operations are allowed on two pointer variables? Which are they? 19. What is the use of structures in C? 20. Can we make array of structures? 21. When to use dot (.) operator and when to use arrow (->) operator, to access members of structure? 22. Why to use typedef ? 23. What is the significance of null character in strings?

24. Differentiate between getch( ), getche ( ) and getchar ( ) ? 25. Can we perform operations like copy, concatenate related to string, without standard functions? Experiment 1 1. 2. 3. 4. 5. 6. 7. In a binary search how will you find the maximum no of comparisons? It is required to add 25 elements to a float array called sales of declared size 100. how will you change the array declaration? Write an array initialization statement to initialize the elements of an array called table of size 5 rows and 3 columns with zeros. Which searching method is more efficient linear search or binary search? What do you mean by time complexity of an algorithm? Compare linear search and binary search with respect to time complexity of algorithm. For binary search array should be sorted in ascending order. If array is sorted in descending order then can present algorithm work? Which changes should be made to make it work?

Experiment 2. 1. Define sorting. 2. What do you mean by external sorting? 3. Give the difference between internal and external sorting. 4. Which sorting technique is more efficient and why? 5. Give some applications of sorting. 6. How to make bubble sort efficient?

Experiment 3 1. A structure definition creates space in memory for a variable. True or false. 2. How does a structure differ from an array?

3. Where do you use a structure tag? What is the purpose of using it? 4. We can declare structure variables in two ways. 1) Using tags 2) without using tags? Which method is preferable? Why? 5. What is the purpose of the structure member operator? 6. What is meant by an array of structure? Give an example. 7. What is meant by structures within structures? 8. What is the difference between structure and union? 9. Which operator is used for accessing the structure elements? 10. Which operator is used for accessing the structure elements using pointers? Experiment 4 Define an ordered list with example. 1. What are the different ways to represent polynomial in single variable? 2. Mention two different ways of representing a polynomial using an array. Give a C declaration for the same. 3. Write the structure for declaring a polynomial. 4. What is the final result obtained after evaluating a given polynomial? 5. Can we represent polynomial using only array? Can we add them using only array? Experiment 5 1. What can be the two major problems with sequential storage representation? 2. Is it possible in linked list to insert an element before the node pointed to by head pointer? 3. Give one major advantage of a) arrays over link list. B) Lists over arrays. 4. Why do we need linked list? 5. Is linked list a data structure? If yes, what are the operations that can be performed over it? 6. Explain dynamic memory allocation? 7. Compile time memory allocation is which type of memory allocation?

8. For deleting a node from a linked list, is it necessary to know the address of the predecessors node. 9. Explain syntax of malloc function? 10. What is the use of free function in C. 11. Discuss the advantages if any, of a two way list over a one way list.. Experiment No.6 and 8 1. What is concept of stack? 2. Why to use stack? 3. Is stack a data structure? 4. What are the applications of stack? 5. How many types of expressions are present? 6. Which type of expression can be evaluated using stack? How? 7. Can we evaluate prefix expression using stack? How? Experiment No. 7 1. What is working principal of queue? 2. What are general examples of queue? 3. What are applications of queue? 4. What is concept of circular queue? 5. What is concept of priority queue? Experiment No. 9 Binary Search Tree 1. Define tree data structure. 2. Tree is linear or non-linear data structure? Justify answer. 3. Which tree you can call as binary search tree? 4. What is the difference between binary tree and binary search tree? 5. What are other types of tree? 6. How to represent BST using array? Can you explain with small example? 7. If you are representing BST using linked list then how many address and data fields are required?

8. Define a. Root node b. Siblings c. Height of tree d. Level of tree e. Ancestors f. Successor 9. What are the advantages and disadvantages of BST? 10. For traversing we have used recursive traversal techniques. Is it possible with non-recursive functions? How? 11. How to delete a node? How many cases we need to consider? 12. What are practical applications of BST? Experiment No. 10 Graph 1. Define graph. 2. Who used graph first time? For what purpose? 3. Differentiate between complete and incomplete graph? 4. How will you classify graph? 5. How to represent graph? Which technique is better? Why? 6. Two types of traversal techniques we have used in the program? Which are they? 7. Can you write non recursive DFS function? 8. Compare DFS and BFS. 9. What are the applications of graph? 10. What do you mean by minimum spanning tree? 11. Which are the algorithms used to find minimum spanning tree? 12. How to find shortest distance between two nodes?