Scribd
Upload
11 views2 pages

PPS Unit3

Uploaded by

bgmi6044
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

PPS Unit3

Uploaded by

bgmi6044
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT-III

6. What is a function?
7. How many types of functions are there? (Ans: 2
predefined and user-defined)
8. What is pre-define and user-defined function?
9. List any 10 predefined function names.
(Ans :
pow( ),sin( ),cos( ),tan( ),sqrt( ),strlen( ),strcpy( ),strcat( ),strcm
p( ),exit( )).

10. How many parameter passing techniques are


there?
11. Difference between call-by-value and call-by-
reference technique.
12. What is recursion?
13. Difference between recursion and iteration.
(Hint : explain with the help of factorial program).
14. How many storage classes exists in C
language?
15. What is the use storage classes? (Hint:
Explain with the help of the table discussed for
storage class)
16. Explain the use of static storage class.

1. What is a pre-processor?
2. Explain the use of pre-processor? (Ans: symbolic
constants,macros and conditional compilation)
3. List some pre-processor directives.
4. Give an example of macros with parameter.
5. What is an array?
6. Write the syntax for array declaration.
7. Explain the use of array with the help of an
example array declaration.
8. How many searching techniques are there? (Ans:
2, linear search and binary search)
9. Explain the working of linear search.
10. Explain the working of binary search.
11. Which searching technique is efficient and
why? ( Ans: Binary search, as it takes
less no.of comparisons to search an element)
12. What is the limitation of binary search? (Ans:
works only on sorted arrays)
13. What is sorting? Name some different sorting
techniques.
14. What is bubble sort? Explain its working.
15. Explain the working of selection sort.
16. What is the syntax for declaring a 2-D array?
Explain with the help of example.
17. How much memory is allocated to array a, if it
is declared as : int a[10][5];
18. Explain how a 2-D array can be initialized at
the time of declaration. (Hint : comma separated
initializer-list)
19. Explain how an array can be passed to a
function.

You might also like