SPECIAL MOCK GCE EXAMINATIONS

Size: px

Start display at page:

Download "SPECIAL MOCK GCE EXAMINATIONS"

Nigel Flynn
5 years ago
Views:

1 PROGRESSIVE COMPREHENSIVE HIGH SCHOOL (PCHS) MANKON, BAMENDA SPECIAL MOCK GCE EXAMINATIONS 14 FEBRUARY 2014 ADVANCED LEVEL Subject/Code: Computer Science 795 Paper N 1 Examiner DZEUGANG Placide 795 COMPUTER SCIENCE 1: MULTIPLE CHOICE QUESTIONS PAPER TIME ALLOWED: 90 MINUTES INSTRUCTIONS TO STUDENTS Read the following instruction carefully before you start answering the questions on this paper. Make sure you have a soft HB pencil and an eraser for this examination 1. USE A SOFT HB PENCIL THROUGHOUT THIS EXAMINATION 2. This paper consists of FIFTY multiple choice questions to be completed by students. 3. Answers should be marked on the answer sheet provided. 4. Each item in this paper has four suggested answers lettered (A), (B), (C), (D). Read each item carefully then choose the best answer. 5. Mobile phones are NOT ALLOWED in the examination room. Sample Item Which of the following pairs represents general-purpose software tools? Sample Answer (A) Spreadsheet and database software (B) Word processor and accounting software (C) Students record system and database software (D) Insurance processing and spreadsheet software A B C D The best answer to this item is spreadsheet and database software, so answer space (A) has been shaded. DO NOT TURN THIS PAGE UNTIL YOU ARE ADVISED TO DO SO PCHS Special mock February 2014/ Computer Science Paper 1 Page 1

2 1. The technique whereby part of the program is stored on disk and is brought into memory for execution as needed is called: (A) memory allocation (C) interrupts (B) virtual storage (D) prioritized memory 2. A design technique that allows the CPU to begin processing one instruction before the previous instruction is finished is called (A) pipelining (C) RISC (B) parallel processing (D) serial processing 3. The prefix notation of the expression A*B+C*D is written as (A) AB*CD*+ (B) AB*CD+* (C) A*BCD*+ (D) A*B*CD+ 4. Magnetic characters representing the check amount are entered onto your bank checks by (A) bar-code readers (C) MICR inscribers (B) mice (D) OCR 5. A collection of concepts that can be used to describe the structure of a database (A) Database (B) DBMS (C) Data model (D) Data. 6. The feature that database allows to access only certain records in database is: (A) Form (B) Report (C) Query (D) Table 7. A (n) record is one that contains a repeating group. (A) 1NF (B) 2NF (C) 3NF (4) unnormalized 8. Which of the following concepts is applicable with respect to 2NF? (A) Full functional dependency (C) Transitive dependency (B) Any kind of dependency (D)Non-transitive dependency 9. In high school environment, what is the appropriate multiplicity for an association linking courses with students? (A) One to many (B)one to many (C)many to many (D)many to one 10. Which of the following identifiers is NOT a valid variable name? (A) Input (B) 91Count (C) totalcost (D) Count Errors that occur during the execution of a program are called (A) Syntax errors (B) Logical errors (C) Execution errors (D) Run-time errors PCHS Special mock February 2014/ Computer Science Paper 1 Page 2

3 12. Which of the following algorithms satisfies the requirement of asking the user to input two numbers, calculate the average and displaying the result (A) (B) Display Enter two numbers Input a, b C (a+b)/2 Display C Input a, b C (a+b)/2 Display C (C) (D) Display Enter two numbers Input a,b C a+b/2 Display C Input a, b C a+b/2 Display C 13. A field in a table appears as a match of the primary key in another table is called a (A) Candidate key (B) Secondary key (C) Composite key (D) Foreign key 14. An airline reservation system is an example of (A) Batch processing (B) Real time processing (C) Distributed processing (D) Interactive processing 15. Quality Developers is a company that writes programs to do specific jobs for other companies. These programs are called? (A) General-purpose software (B) Special-purpose software (C) Bespoke-purpose software (D) Off-the-shelf software 16. The BCD representation of (-15) is? (A) (C) (B) (D) Which of the following output is an example of a hardcopy? (A) An oral speech delivered by a speaker (B) A bill produced from the printer (C) The display on a monitor (D) A picture on a wall produced from a multimedia projector 18. The MOST suitable device for the output of architectural drawing is a? (A) Plotter (B)Laser printer (C)Graphics tablet (D)Lightpen 19. The technology used to read pencil or pen marks on a multiple choice answer sheet is? (A) OCR (B) OMR (C) POS (D)MICR PCHS Special mock February 2014/ Computer Science Paper 1 Page 3

4 20. The content of a stack is ; What is the content of that stack after the following successive operations. POP POP PUSH(10) POP POP PUSH(15) (A) (C) (B) (D) A Turing Machine is having a set of rules that prescribes 2 actions. It is said to be (A) Determinist (B) Decidable (C) non determinist (D) Computable 22. Which of the following is NOT a function of the control unit? (A) Read instructions (B) Interpret instruction (C) Direct operation (D)Execute instructions 23. It is the FIFO data structure (A) Stack (B) Linked list (C) array (D) Tree 24. Here is a binary tree. If we visit the nodes of this tree using a preorder traversal, in what order will the nodes be visited? (A) (B) (C) (D) Two main measures for the efficiency of an algorithm are (A) Processor and memory (C) Time and space (B) Complexity and capacity (D) Data and spac 26. The time factor when determining the efficiency of algorithm is measured by (A) Counting microseconds (B) Counting the number of statements (C) Counting the number of key operations (D) Counting the kilobytes of algorithm 27. With... only one process can execute at a time; meanwhile all other processes are waiting for the processor. With... more than one process can be running simultaneously each on a different processer. (A) Multiprogramming, Multiprocessing (B) Multiprogramming, Uniprocessing C) Multiprocessing, Multiprogramming (D) Uniprogramming, Multiprocessing PCHS Special mock February 2014/ Computer Science Paper 1 Page 4

5 28. Which of the following sorting algorithm is of divide-and-conquer type? (A) Bubble sort (B) Insertion sort (C) Merge sort (D) All of above 29. A sort which compares adjacent elements in a list and switches where necessary is (A) Insertion sort (C) Quick sort (B) Heap sort (D) Bubble sort 30. Study the following program written in a block structured language. Function P (integer n) Integer x x (n x 2)/(n + 3) return x end; Procedure Q() integer x, y y 3 x P(y) Write (x) * end; Algorithm Integer x, y x 7 y 8 Q() Write (x) ** end. What will be printed by the write statements marked (1) and (2) in the program? (A) 1,6 (B) 1,7 (C) 7.8 (D) None of the above. 31. A sort which iteratively passes through a list to exchange the first element with the smallest element if less than it and then repeats with a new first element is called (A) Selection sort (B) Insertion (C) Bubble (D) Merge 32. Let s consider the following list 8, 22, 7, 9, 31, 19, 5, 13 Using the bubble sort, the list after the first iteration is (A) (C) (B) (D) The advantage of.. is that they solve the problem of sequential storage representation. But disadvantage in that is they are sequential lists. (A) Lists (B) Linked Lists (C) Trees (D) Queues 34. An exception conditions in a computer system by an event external to the CPU is called (A) Interrupt (B) halt (C) wait (D) process Question 35 and 36 refer to the following algorithm PCHS Special mock February 2014/ Computer Science Paper 1 Page 5

6 Function result(integer n) If (n = 1) then Return 2 Else Return 2 x result(n 1) Endif end 35. What value does result (5) return? (A) 8 (B) 16 (C) 32 (D) If n > 0, how many times will result be called to evaluate result(n) (including the initial call)? (A) 2 (B) 2 n (C) 2n (D) n 37. Which one of the following logical operations is performed by the digital circuit shown below? (A) NOR (B) NAND (C) Ex-OR (D) OR 38. What is the Boolean expression for the truth table shown below? (A) B(A + C)(A + C ) (C) B(A + C)(A + C) (B) B(A + C )(A + C) (D) B(A + C)(A + C ) A B C F What does the Boolean expression AB + ABCD + ACD + A B + ACD + A B on minimization result into? (A) AD + A (B) A + D (C) AD (D) A + D 40. Which one of the following is the correct sequence of the numbers represented in the following series (2) 3, (10) 4, (11) 5, (14) 6, (22) 7,.? PCHS Special mock February 2014/ Computer Science Paper 1 Page 6

7 (A) 2, 3, 4, 5, 6, (B) 2, 4, 6, 10, 12,. (C) 2, 4, 6, 8, 10,.. (D) 2, 4, 6, 10, 16, set of techniques that allow to execute a program which is not entirely in memory is called (A) demand paging (C)virtual memory (B) (C)auxiliary memory (D)secondary memory 42. In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the: (A) READY state (C) BLOCKED state (B) SUSPENDED state (D) TERMINATED state 43. A direct method of deadlock prevention is to prevent the occurrences of... (A) Mutual exclusion (B) Circular waits (C) Hold and wait (D) No preemption 44. Consider the set of relation given below and the SQL query that follows: Student(st_ID, Name, Date_birth) Courses (courseid, Co_Name, Instructor) Grades (st_id, CourseID, Grade) SELECT DISTINCT, Name FROM Students, Courses, Grades WHERE Students.stID = Grades.st_ID AND Courses.Instructor = Korth AND Couses.CourseID = Grades.CourseID AND Grades.Grade = A ; Which of the following set is computed by the above query? (A) Name of students who have god an A grade in all courses taught by Korth (B) Name of students who have god an A grade in all courses (C) Name of students who have god an A grade in at least one of the courses taught by Kosth (D) None of the above 45. Which of the following is the most suitable scheduling scheme in a real-time operating system? (A) Round-Robin (C) First-Come-First-Served (B) Pre-emptive scheduling (D) Random scheduling 46. Which of the following are essential features of an Object-Oriented programming language? i) Abstraction and encapsulation PCHS Special mock February 2014/ Computer Science Paper 1 Page 7

ii) Strictly-typedness iii) Type-safe property coupled with sub-type rule iv) Polymorphism in the presence of inheritance (A)(i) and (ii) only (C) (i), (ii) and (iv) only (B) (i) and (iv) only (D)

8 ii) Strictly-typedness iii) Type-safe property coupled with sub-type rule iv) Polymorphism in the presence of inheritance (A)(i) and (ii) only (C) (i), (ii) and (iv) only (B) (i) and (iv) only (D) (i), (iii) and (iv) only 47. Variable which can be assessed by all modules of the program is called as (A) Local variable (C) Global variable (B) Static variable (D) Auto variable 48. Pointer is special kind of variable which is used to store of the variable (A) Address (C)Value (B) Variable name (D)Data type 49. Which of the following ways below is a pre order traversal? (A) Root->left sub tree->right sub tree. (C) right sub tree->left sub tree->root (B) Root-> right sub tree ->left sub tree (D) left sub tree->right sub tree->root 50. Let s consider the following binary tree. The output of the post-order transversal is (A) 7,5,4,2,3,8,9,1 (C) 7,5,8,4,3,9,1,2 (B) 4,2,5,3,7,9,8,1 (D) 2,4,3,5,9,1,8,7 YOUR SUCCESS IS IN JESUS CHRIST Visit for the solution PCHS Special mock February 2014/ Computer Science Paper 1 Page 8

2. This Question Booklet contains nine questions. Answer any SIX questions.

2. This Question Booklet contains nine questions. Answer any SIX questions. PROGRESSIVE COMPREHENSIVE HIGH SCHOOL (PCHS) MANKON, BAMENDA 14 FEBRUARY 2014 ADVANCED LEVEL Subject/Code: Computer Science 795 Paper N Paper 2 Examiner DZEUGANG Placide TIME ALLOWED: 2 hours INSTRUCTIONS