Académique Documents
Professionnel Documents
Culture Documents
41
[ Total No. of Printed Pages : 4
June/July, 2009
COMPUTER SCIENCE
Time : 3 Hours 15 Minutes ] [ Max. Marks : 90
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
What is the function of Instruction Register ? Expand UPS. Define modularity. What is searching ? Give one characteristic of the subscript of an array. What is the significance of operator in pointers ? Expand DML. Define alternate key. What is the main disadvantage of ring network topology ?
Code No. 41
2 PART B
Note :
i) ii)
13. Construct a top-down module chart for finding the area of a rectangle.
16. Write a structure definition for a student with the following fields : Regno, Name, Combination, Totalmarks.
17. Mention any two differences between call by value and call by reference.
3 PART C Note : i) ii) A. Answer the following questions. Each question carries five marks.
Code No. 41
8 5 = 40
Answer any two questions : 23. Briefly explain any five components of motherboard. 24. Write the approximate power consumption of various components of a PC. 25. What is a computer virus ? Explain any two viruses. Name any two antivirus software.
B.
Answer any one question : 26. Trace binary search algorithm to find the location of the element 22 in the following list : 22, 33, 49, 57, 75 27. Write an algorithm for insertion sort.
C.
Answer any three questions : 28. Write a C program to read and print elements of two-dimensional array. 29. List the different categories of user defined functions. Explain any one. 30. Write a C program to count number of vowels and consonants present in a given string. 31. Explain the various file handling functions available in C. [ Turn over
32. Write merits and demerits of sequential file organisation. 33. Write the qualities of information. 34. Explain e-commerce. PART D Note : i) ii) Answer any two questions. Each question carries ten marks. 2 10 = 20
1 + x + x 2 + x 3 + ........ + x n
36. Write a recursive function to compute x n , where n = 0, n < 0 and n > 0.
37. i)
Write a note on functional overview of Unix operating system. ! Explain different types of computer network.
ii)
iii)
Code No.
41
[ Total No. of Printed Pages : 4
March, 2009
COMPUTER SCIENCE
Time : 3 Hours 15 Minutes ] [ Max. Marks : 90
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
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 ?
Code No. 41
2 PART B
Note :
i) ii)
15. What are the uses of and & operators with reference to pointers ?
3 PART C Note : i) ii) A. Answer the following questions. Each question carries five marks.
Code No. 41
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. [ Turn over
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)
Code No.
41
March, 2010
COMPUTER SCIENCE
Time : 3 Hours 15 Minutes ] [ Max. Marks : 90
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
Expand the term SMPS. Define cache memory. What is a module ? What is the main disadvantage of the Linear search method ? What character does represent the end of each string ? What is the main difference between structure & union ? Define data. Expand ISAM. Name any one data switching technique in computer networks.
Code No. 41
2 PART B
Note :
i) ii)
13. Construct a top down design model chart to find the simple interest.
21. Write the syntax and example for deleting a table using DROP.
3 PART C Note : i) ii) A. Answer the following questions. Each question carries five marks.
Code No. 41
8 5 = 40
Answer any two questions : 23. Specify the current configuration of a PC available in the market. 24. Explain the typical causes of a system failure. 25. What are the different types of printers ? Explain any one.
B.
Answer any one question : 26. Write an algorithm for bubble sort. 27. Mention the objectives of structured programming.
C.
Answer any three questions : 28. Write a C program to find the sum of digits of a number until resulting value is a one digit number. 29. Explain the various operations performed on strings with their syntax & examples. 30. Write the structure of a function & explain with an example. 31. Write a C program to find the sum of the series,
1 + X + X 2 + ..... + X n .
D. Answer any two questions : ! 32. Give the difference between manual and electronic data processings. 33. What is file organization ? Explain the direct file organization technique. 34. Explain the advantages of DBMS. [ Turn over
Code No. 41
4 PART D
Note :
i) ii)
35. Write a flowchart to find sum of all elements in upper diagonal and lower diagonal of a square matrix.
36. Write a C program to find nth Fibonacci number using recursive function.
37. i) ii)
2 4
iii)
Code No.
41
June/July, 2010
COMPUTER SCIENCE
Time : 3 Hours 15 Minutes ] [ Max. Marks : 90
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
What are the expansion slots ? Write any one advantage of top-down approach. What is worst case in sorting ? Give the function of typedef in C. What is a pointer ? Define operational information. What is data manipulation language ? Define computer network. Expand www.
Code No. 41
2 PART B
Note :
i) ii)
14. What is the purpose of register variable ? Write the declaration syntax for register variable in C.
15. Write a C program segment to accept the contents of a single dimensional array.
3 PART C Note : i) ii) A. Answer the following questions. Each question carries five marks.
Code No. 41
8 5 = 40
Answer any two questions : 23. Mention the factors for the failure of a computer. 24. Write a note on cache memory. 25. Explain computer security.
B.
Answer any one question : 26. Write an algorithm for selection sort technique. 27. Apply linear search method to find the value 43 in an array containing following values : 38, 40, 31, 28, 43, 45, 60.
C.
Answer any three questions : 28. Write a C program to remove blanks and punctuations in a given text. 29. What is a structure ? Give declaration syntax and example for struct in C. 30. Compare strcmp ( ) and strcmpi ( ) in C. Give examples for each. 31. Explain function with no argument and no return value with a programming example.
D.
Answer any two questions : 32. Discuss merits and demerits of direct file organisation. 33. Explain batch processing. Give an example. 34. Explain smart card. [ Turn over
Code No. 41
4 PART D
Note :
i) ii)
35. Draw a flowchart to find second largest of n values in an array without sorting.
36. Write a C program to print nth Fibonacci numbers using recursive function.
37. i)
ii)
Give the syntax and examples for any two SQL commands.
iii)