A Level Computer Science Quiz 2017 Part 2

15 Questions

Quiz Description

Computers have changed the way people relate to one another and their living environment, as well as how humans organize their work and their communities. As such, it can be defined as the study of science that deals with the theory and methods of processing information in digital computers, the design of computer hardware and software, and the applications of computers.

As students going in for an official examination, each student must be well equipped. As such a quiz is the one of the most effective ways to test and examine yourself. This quiz comprises questions based on the advanced level computer syllabus. Some of the topics included in this quiz are data structures and algorithm and software systems.

Each of the questions in the quiz has four possible answers and of which only one is correct among the four.For more such quizzes click on more or visit our website to gain more materials.

1:

The scheduling algorithm in which the CPU is allocated to the process with the least CPU-burst time is called


Correct
  • 1:
    Priority scheduling
  • 2:
    Round Robin
  • 3:
    Shortest Job First
  • 4:
    First-Come-First-Served
2:

It is not a direct or indirect advantage of distributed systems


Correct
  • 1:
    Resource sharing
  • 2:
    Reliability
  • 3:
    Incremental growth
  • 4:
    None of the above
3:

Nested sub-program call-returns are invoked using a


Correct
  • 1:
    First-in-First-out approach
  • 2:
    Round Robin approach
  • 3:
    Round Robin approach Last in first out approach
  • 4:
    Last in last out approach
4:

Which of the following is NOT characteristic of a relational database model?


Correct
  • 1:
    Tables
  • 2:
    Tree like structure
  • 3:
    Complex logical relationships
  • 4:
    None of the above
5:

A program parameter that can be modified by all subprograms that make reference to it is known as a/an:


Correct
  • 1:
    Local variable
  • 2:
    Global variable
  • 3:
    Formal parameter
  • 4:
    Actual parameter
6:

Given the algorithmic statements below

If (A > N) or (B < 0), then

A ← A + 1

B ← B – 1

Else

A ← B + N

Endif

The statement A ← B + N is only executed


Correct
  • 1:
    When A ≥ N or B ≤ 0
  • 2:
    When A ≥N or B
  • 3:
    When A ≥N and B ≤0
  • 4:
    When A ≥N A and B
7:

If a software piece can be used either alone or together with other software pieces to produce a more sophisticated software, the software piece is said to be


Correct
  • 1:
    Adaptable
  • 2:
    Manageable
  • 3:
    Reusable
  • 4:
    Predictable
8:

The popular expression “Divide-And-Conquer” refers to a kind of


Correct
  • 1:
    Top-down design
  • 2:
    Object oriented design
  • 3:
    Algorithmic design
  • 4:
    Modular design
9:

A software is said to be portable if


Correct
  • 1:
    It can be put on a CD-ROM
  • 2:
    It can be installed in any computer
  • 3:
    It is instable on more than one computer
  • 4:
    It is platform independent
10:

What data structure will you most likely see in a non-recursive implementation of a recursive algorithm?


Correct
  • 1:
    A stack
  • 2:
    An array
  • 3:
    A record
  • 4:
    Queue
11:

A search technique for direct item access is


Correct
  • 1:
    Binary search
  • 2:
    Linear search
  • 3:
    Binary tree search
  • 4:
    Hash table search
12:

The smallest element of an array’s index is called its


Correct
  • 1:
    Lower bound
  • 2:
    Upper bound
  • 3:
    Range
  • 4:
    Limit
13:

The Worst case occurs in linear search algorithms when an item is:


Correct
  • 1:
    Somewhere in the middle of the array
  • 2:
    Not in the array at all
  • 3:
    The last element in the array
  • 4:
    The last element in the array or is absent
14:

One of the following is a recursive definition of the Fibonacci series


<p> One of the following is a recursive definition of the Fibonacci series </p>
Correct
  • 1:
    A
  • 2:
    B
  • 3:
    C
  • 4:
    D
15:

Which of these sort algorithms divides, at each iteration, the list into two sub-lists so that one is sorted and the other unsorted?


Correct
  • 1:
    Quick sort
  • 2:
    Quick sort
  • 3:
    Bubble sort
  • 4:
    Merge sort

Feature Image

A Level Computer Science Quiz 2017 Part 2
gcequiz
Student
Instructor
Account
Contact us

Efoulan, Yaounde
Cameroon, Email:info@gcequiz.com