Practice Exam Paper – COMP 101 - Introduction to Computer Science

Answer the following questions: (1-30) (Each question carries 2 marks.)

1. Which of the following best describes the NOR operation?

A. An XOR followed by a NOT

B. An OR followed by a NOT
C. A NOT followed by an OR
D. An AND followed by a NOT
Answer: B

2. Which of the following bit patterns cannot be expressed in hexadecimal notation?

A. 11111111
B. 1001
C. 110011
D. 100000000001
Answer: C

3. Which of the following bit patterns (represented in hexadecimal notation) represents a positive number
in two’s complement notation?

A. 9F
B. F7
C. A8
D. 7E
Answer: D

4. Which of the following is not contained in a CPU?

A. Instruction register
B. Program counter
C. General-purpose register
D. Memory cell
Answer: D

5. Which of the following instructions (as described in the language description table) changes the
contents of a memory cell?

A. 10AB
B. 20AB
C. 30AB
D. 40AB
Answer: C

4|4
 Practice Exam Paper – COMP 101 - Introduction to Computer Science

6. The bus in a computer is an example of which form of communication?

A. Serial
B. Parallel
C. Neither A nor B
Answer: B

7. Which of the following instructions (as described in the language description table) will not change the
contents of register 5?

A. 1508
B. 2508
C. A503
D. A508

8. Which of the following components of an operating system maintains the directory system?

A. Device drivers
B. File manager
C. Memory manager
Answer: B

9. Which of the following is not an attempt to provide security?

A. Passwords
B. Privilege levels
C. Multitasking
Answer: C

10. Multitasking in a computer with only one CPU is accomplished by a technique called

A. Bootstrapping
B. Batch processing
C. Multiprogramming
Answer: C

11. Which of the following is not a way of classifying networks?

A. WAN versus LAN

B. Closed versus open
C. Router versus bridge
D. Star versus bus
Answer: C

12. Which of the following is a protocol for controlling the right to transmit a message in a network?

A. UDP
B. CSMA/CD
C. TCP
D. FTP
Answer: B

4|4
 Practice Exam Paper – COMP 101 - Introduction to Computer Science

13. Which layer of the TCP/IP hierarchy actually transmits a message?

A. Application
B. Transport
C. Network
D. Link
Answer: D

14. Which of the following is an activity?

A. Algorithm
B. Program
C. Process
Answer: C

15. Which of the following is not a means of repeating a block of instructions?

A. Pretest loop
B. Posttest loop
C. Recursion
D. Assignment statement
Answer: D

16. Which of the following is not a way of representing algorithms?

A. Stepwise refinement
B. Pseudocode
C. Flowchart
D. Programming language
Answer: A

17. Which of the following is an example of a language that is based on the functional paradigm?

A. LISP
B. PROLOG
C. C
D. C++
Answer: A

18. Which of the following is not a type of statement found in a typical high-level imperative
programming language?

A. Imperative statement
B. Exclamatory statement
C. Declarative statement
D. Comment statement
Answer: B

19. Which of the following software engineering methodologies is the most rigid?

A. Incremental model
B. Waterfall model

4|4
 Practice Exam Paper – COMP 101 - Introduction to Computer Science

C. Extreme programming
D. Evolutionary prototyping
Answer: D

20. Which of the following is most likely an example of a one-to-one relationship?

A. Subscribers and magazines

B. Birth dates and people
C. Planets and their moons
D. Dinner guests and table settings
Answer: D

21. Which of the following is a LIFO structure?

A. Array
B. Stack
C. Queue
D. Tree
Answer: B

22. Suppose you were going to retrieve items of data that you would later need to process in the opposite
order from that in which they were retrieved. Which of the following would be the best structure in which
to store the items?

A. Tree
B. Stack
C. Queue
D. Traditional linked list
Answer: B

23. Which of the following handles communication with the user of a database?

A. Application software
B. Database management system
C. Actual database
Answer: A

24. Which of the following relational operations extracts entire columns from a relation?

A. SELECT
B. PROJECT
C. JOIN
Answer: C

25. Which of the following is not associated with a parallel projection?

A. Projection plane
B. Projectors
C. Center of projection
D. All of the above
Answer: C

4|4
 Practice Exam Paper – COMP 101 - Introduction to Computer Science

26. A polygonal mesh consists of

A. Planer patches
B. Pixels
C. Spheres
D. Bezier curves
Answer: A

27. Which of the following is an example of procedural knowledge?

A. Knowing the rate of growth of the world’s population

B. Knowing how to tie your shoes
C. Knowing your name
D. Knowing the exchange rate of different national currencies
Answer: B

28. A heuristic is applied during a search process in hopes of producing a

A. Depth-first search
B. Breadth-first search
Answer: A

29. Which of the following Bare Bones programs is self-terminating?

A. while X not 0: B. while X not 0: C. decr X

decr X while X not 0:
Answer: B

30. Which of the following is the most precise classification of a problem X?

A. X is in NP.
B. X is in P.
C. X is in O(n2).
D. X is in Θ(n2).
Answer: D

4|4