# A Level Computer Science Quiz 2016 Part 2

#### Quiz Description

Computer science is a very large subject with lots of applications. Computer scientists design new software, solve computing problems and develop different ways to use technology. But, whatever they’re doing, all computer scientists rely on computational thinking. What is computational thinking?

Computational thinking involves looking at a problem and working out a way a computer might be able to help you solve it. To do this, you need to understand how a computer processes information. Most students use computational thinking at school too, but don’t realize it.

To expand your understanding about computer science and computational thinking, a quiz which is made up of only 15 questions has been designed just for you. Each question is based on a topic studied at the Advanced level. Some of these topics include “Software, Data structure and algorithm, programming and Boolean operations etc.For more inquiry about other materials, you can visit our website and other related quizzes.

The program counter (PC) is

Correct
• A CPU register that indicates the address of the instruction currently being executed
• A CPU register that indicates the address of the next instruction in a program
• A CPU register which stores the state of a process
• A CPU register that signals a change of context

If data is processed as it arrives this type of data processing is called

Correct
• Real time processing
• Batch processing
• Synchronous processing
• Parallel processing

A page fault means that we referenced a page

Correct
• Outside the memory boundaries
• With an incorrect I/O request
• That was not in secondary storage
• That was not in main memory

Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place; this is called a/an

Correct
• Share memory condition
• Race condition
• Multi-processing
• Process synchronization

The search for an element on a binary search tree has an average complexity which is

Correct
• Linear
• Logarithmic
• Polynomial
• Exponential

Given the function for f(n) =n!, n a natural number and defined EITHER as in

f1(n) = n(n-1)! With 0! =1 OR

f1(n) =1 x 2 x 3 x …. xn

Correct
• f1 is an iterative definition of the factorial function
• f1 executes with no internal stack while f2 does
• f2 and f1 will have the same runtime efficiency
• f2 is more efficient than f1

A programming paradigm that packages data and functions and manipulates the data into one structure, is known as

Correct
• Imperative programming
• Modular programming
• Object oriented programming
• Functional programming

A piece of software, possibly incomplete, that is meant to facilitate agreement on system specifications between software producer and customer is

Correct
• User interface
• System prototype
• Pseudocode
• System model

In debugging a program,

Correct
• We are searching for availability of errors
• We want to see whether a program executes with errors
• We want to prove that the program is working without errors
• We are correcting errors

The postfix from the expression; A*B+C/D is:

Correct
• A B / C D +
• A * B C + / D
• A B * C D + / *
• A B C D + / *

A binary search algorithm on an array of N elements has an average complexity in the order of

Correct
• N log2N
• log2N
• N-1
• 2^N

The operation of processing each element in a list is known as

Correct
• Sorting
• Searching
• Indexing
• Traversal

Generally, a variable defined within a block is visible

Correct
• From the point of definition onward in a sub routine
• From the point of definition onward in the function
• From the point of definition onward in the block
• Throughout the function

A linear collection of data elements where its elements are accessed by means of a pointer is called a (an)

Correct
• I-D Array
• Record
• Sorted list

Locking was introduced into databases so that

Correct
• Keys can be provided to maintain security
• All simultaneous transactions are prevented
• All simultaneous transactions are prevented
• Consistency can be enforced