MCA MAGADH UNIVERSITY QUESTION (2013-2016) Programming and Data Structure with "C"

MCA MAGADH UNIVERSITY QUESTION (2013-2016) Programming and Data Structure with "C"

                                                                          2013-2016
                                                                        Full Marks: 80
                                                                       Time: 4 hours
                                                      Candidates are required to give their answers in their
                                                            Own words as far as practicable.
                                                           The questions are of equal value.
                                                                Answer any five questions.

1. Define algorithm and what are the characteristics of an algorithm. How it is differ from flowchart.

2. (a) Draw the flowchart to find the roots of quadratic equation.
    (b) Write an algorithm to find the factorial of any number.

3. Define array. What are characteristics features of an array ? write down a " C" Program to find the largest element in the array.

4. Define pointer. What are the uses of pointer? Write a program in 'C" to find the length of any given string using pointer.

5. Write a program in C that will copy a data file containing the list of students and their corresponding telephone numbers into another file. Use a structure variable to store the name and telephone of each student.

6. Write a program in 'C', Which takes two sorted array A and B with m and n elements respectively and outputs the array C, which contains all the elements of A and B in sorted order.

7. What is stack? What are the different possible operations on it? Write down 'C' code for it.

8. What do you mean by data structure ? Explain the different categories of data structure with example. Also write down the operations on data structure.

9. What is dynamic memory allocation? Discuss the main advantages of dynamic memory allocation.

10. What is binary tree? What are the different tree traversal techniques? Describe all techniques using suitable examples.

11. Write ' C' function to implement double ended queue using an array.

12. Write short notes on the following:
      (a) Keywords
      (b) Operators
      (c) Comment
      (d) Linked list