Vinayaka Missions University 2008 Post Graduate Diploma Computer Application DATA STRUCTURES AND ALGORITHMS USING C, C++ t (Correspondence ) - Question Paper

COURSE CODE - 3050109
PG DIPLOMA exam - SEP 2008
PGDCA / PGDIT
DATA STRUCTURES AND ALGORITHMS USING C, C++
(For Candidate Admitted from calendar 2007 onwards)
Time: three Hours Max. Marks: 75
part – A
ans all the Questions: 15 X one = 15
1. What is data?
2. describe Array
3. What is Algorithms
4. What is Greedy algorithms
5. What is dynamic programming
6. describe back tracking technique
7. What is calculation
8. What is Random Access Machines
9. describe NP complete issues
10. What is SISD
11. describe parallel calculation models
12. What is multi dimensional array?
13. What is Merge sort
14. describe different kinds of merge sort technique
15. What is merging network
part – B
ans any 5 Questions: five X six = 30
16. (a) What is Efficiency of algorithms - discuss
(Or)
(b) discuss the recursive programs
17. (a) elaborate the basic concepts of Greedy algorithms
(Or)
(b) discuss Back tracking technique
18. (a) discuss different models of calculation
(Or)
(b) Write details about the Random Access Machines
19. (a) Analyzing algorithms - discuss
(Or)
(b) discuss Processors, cost and measures
20. (a) discuss Merging network
(Or)
(b) discuss Parallel Selection
part – C
ans any 2 Questions: two X 15 = 30
21. What is a Data type? discuss Abstract data kinds
22. discuss Divide and Conquer algorithms
23. What is an NP Complete issue – Explain?
24. discuss Parallel calculation Models.
25. discuss Merge sort.

Earning:   Approval pending.