Maharashi Dayanand University (MDU) 2006 M.C.A Computer PROGRAMMING IN C AND DATA STRUCTURE - Question Paper

Q1.(a) What is an algorithm? explain its different characteristics with examples.
(b) define the term ‘efficiency’ of an algorithm.

Q2. (a) What do you mean by Recursion? State its benefits and illustrate their use with the help of suitable example.
(b) elaborate the different advantages offered by user-defined functions? How does main() function differ from
other user-defined functions? Illustrate.
Q3. Differentiate ranging from flowchart, pseudo code, and decision table and their relative merits and demerits.
Q4. describe stack. elaborate the different application of stack? discuss Briefly.

Q5. (a)Write an algorithm to insert/delete, a node into/from sorted linked list.
(b)Explain the importance of header node in circular linked list.
Q6. (a) What do you mean by pointers? Write a program to interchange the values of A and B using pointers.
(b)In what ways does a switch statement differ from if statement?
(c)Differentiate ranging from automatic, external and static variables. Illustrate their relevance and usage.
Q7. (a)Write a function in c to reverse a linked list without copying into a different list.
(b)Briefly define the following: (i) Complexity of an algorithm (ii) The space time trade-off algorithm.
Q8. (a)Convert the subsequent infix expression into its equivalent postfix expressions:

(A-B) * (D/E)
(i) (A+B) ^D/(E-F) + G
(ii) A * (B+D)/E-F*(G+H/K) Using tree

(b)Explain the principle of Dynamic storage management.

Earning:   Approval pending.