Computer Science Mar 2009
Computer Science Mar 2009
of Questions : 37
Code No.
41
March, 2009
COMPUTER SCIENCE
Time : 3 Hours 15 Minutes PART A Note : i) ii) 1. 2. 3. 4. 5. 6. 7. 8. 9. Answer all the questions. Each question carries one mark. 10 1 = 10 Max. Marks : 90
Where is L1 cache located ? Expand CMOS. What is the other name of Bubble sort ? Write any one advantage of structured programming. Can an array store more than one type of variable ? Define recursion. What is a tuple ? What is a master file ? What is a topology ?
PART B Note : i) ii) Answer any ten questions. Each question carries two marks. 10 2 = 20
15. What are the uses of and & operators with reference to pointers ?
PART C Note : i) ii) A. Answer the following questions. Each question carries five marks. 8 5 = 40
Answer any two questions : 23. Briefly explain the general structure of a CPU. 24. Describe the evolution of intel microprocessor. 25. Explain any five symptoms of a computer virus.
B.
Answer any one question : 26. Explain the Binary search method with a suitable example. 27. Write an algorithm to find the maximum element in an array.
C.
Answer any three questions : 28. Write a C program to count the frequency of a digit in a given number. 29. Explain any five character manipulation functions. 30. Define : a) b) c) d) e) Formal parameters Actual parameters Local variables Global variables Register variables.
31. Explain any five types of File access modes with their syntax.
D.
Answer any two questions : 32. Explain data processing cycle in detail. 33. Write a note on different types of information. 34. What are the different services of Network Operating System ? Explain. PART D Note : i) ii) Answer any two questions. Each question carries ten marks. 2 10 = 20
35. Write a flow chart to find the sum of two matrices of order m n. 36. Write a recursive function to find the factorial of a number.
37. i)
ii)
iii)