Q1. Describe preprocessor and directives.
Q2. prepare down a non-recursive function int fib(int n) which returns the nth Fibonacci number.
Q3. describe why is a linked list termed as a dynamic data structure? Illustrate the merits of using linked lists over arrays?
Q4. Illustrate the difference between the enumeration and a set of processor #defines?
Q5. A positive integer is entered via the keyboard. prepare down a function to get the prime factors of this number. Modify the function duly to get the prime factors recursively.
Q6. By using switch statement prepare down a program to find out the roots of the quadratic equation.
Q7. prepare detail notes on (Any three):
a) File Handling.
b) Principles of documentation.
c) Passing an array as an argument.
d) Binary Search.