CS 4th sem Data Structure using C important questions

1. Explain addressing operation and indirection operation with example. 
2. Define pointer list any two advantages and disadvantages of pointer.
3.  Explain formatted input and output functions of file.
4.  Explain any five operation on data structure. 
5. Diagrammatically how do you represent single linked list explain.
6.  With an algorithm to perform push and pop operation of stack. 
7. Define stack how to represent stack in C. 
8. Explain degree of a tree and depth of a tree with an example. 
9. Construct a binary tree for the following data 14 3 8 11 16 19 7 2 10 18. 
10. Write a C program to illustrate the use of function pointer. 
11. Write a program to count the number of characteristics in a given file. 
12. Explain the figure circular and doubly linked list. 
13. List the advantages and disadvantages of linked list. 
14. Write C functions to insert a node and at the end and to delete a node from the beginning of a linked list. 
15. Write a C program to implement queue operation using array. 
16. Explain with figure circular queue.
17.  What is binary tree traversal.
18.  Write a C program to implement Linear search techniques. 
19. Explain what with an example Quicksort method. 
20. Explain the following r o o t node leaf node degree of node. 
21. Write a C program to count number of characters present in a given file. 
22. Write a C program to implement push and pop operation of stack using array. 
23. Write a C program to sort an array using bubble sort. 
24. Explain the concept of selection Sort. 
25. Write a C program to implement queue in C using linked list full stop write an algorithm to convert an infix expression to postfix form. 
26. List the advantages and disadvantages of linked list. 
27. Explain circular linked list with diagram .