wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Code Fiesta

Total questions: 20

Worksheet time: 3mins

Name
Class
Date
1.

What are the 2 parts of a computer instruction?

a)

Op-code and operator

b)

Op-code and Opstate

c)

Opcode and Operand

d)

Opcommand and Opmemory

2.

Direct addressing means

a)

The operand is the actual data

b)

The operand is the memory address of the actual data

c)

The operand is the memory address which points to the memory address that contains the actual data

d)

The opcode is the memory address of the actual data

3.

What is the kernel of the operating system?

a)

The parts of the OS that interact with peripherals

b)

Central components of the operating system

c)

The part of the OS that are not loaded into memory

d)

The start-up instructions for the computer

4.

What is a multitasking computer?

a)

Multiple users can be logged in at the same time

b)

A CPU core that can run more than one process at a time

c)

Multiple programs can be running at the same time

d)

A computer that can handle multiple input devices.

5.

A signal sent by a hardware or software to the CPU indicating that something needs attention is...

a)

a system call

b)

interrupt

c)

paging

d)

blocking

6.

Process management....

a)

allocates time for processes to use the CPU

b)

is responsible for creating, deleting, renaming of files and folders

c)

stores programs and data that are presently being used by the CPU

d)

is the method by which the user interacts with the computer system

7.

During your systems boot process what is the first thing that happens.

a)

The operating system is started

b)

POST occurs

c)

The device drivers for each connected device are loaded

d)

The BIOS switches on each connected device in a pre-defined sequence

8.

What is the difference between paging and segmentation in memory management?

a)

Paging splits the process to be loaded into equal size blocks

b)

Paging splits the process to be loaded into variable sized, logical blocks

c)

Paging allocates frames to hold the data on the hard drive

d)

Paging is used on Windows computers, segmentation on MacOS

9.

Bytecode is an example of....

a)

Machine code

b)

Assembly language

c)

Source code

d)

Intermediate code

10.

Which of the following is not a state that a process in memory can be in?

a)

Ready to run

b)

Running

c)

Blocked

d)

Paused

11.

The rules of a programming language constitute its __________.

a)

Syntax

b)

Logic

c)

Format

d)

Objects

12.

A __________ translates high-level language statements into machine code.

a)

Programmer

b)

Syntax Detector

c)

Compiler

d)

Assembler

13.

A key feature of procedural programming languages is that code is often grouped into logical units called __________.

a)

Procedures

b)

Variables

c)

Constants

d)

Logistics

14.

The 6 stages of the waterfall method are typically....

a)

Analysis, development, creation, testing, production, up keeping

b)

Interview, make, code, validate, check, prototype, fix

c)

Code, test, fix, launch maintain update

d)

Analysis, design, implement, test, install, maintain

15.

Which of these statements about agile is correct?

a)

There is a continuous delivery of software from the early stages of the project

b)

There are well defined checkpoints at each stage

c)

Agile is focused on documentation of the process

d)

Agile is linear approach to software development

16.

The waterfall method is......

a)

Pouring water on your keyboard and hoping it makes software

b)

A linear approach to software development

c)

A way to develop software quickly and responsively

d)

Undocumented

17.

In Little Man Computer which assembly instruction stores the value in the accumulator to a memory location?

a)

STA x

b)

LDA x

c)

ADD x

d)

SUB x

e)

INP

18.

What is the purpose of Memory Data Register

a)

Holds the memory location of data that needs to be accessed

b)

Holds data that is being transferred to or from memory

c)

Where intermediate arithmetic and logic results are stored

d)

Contains the address of the next instruction to be executed

19.

In this scheduling algorithm, the process that comes first will be executed first and next process starts only after the previous gets fully executed.

a)

First-come, first-serve

b)

Shortest-job-first scheduling

c)

Round-robin scheduling

d)

Priority scheduling

e)

Multilevel Queue scheduling

20.

This is scheduling policy that selects for execution the waiting process with the smallest execution time.

a)

First-come, first-serve

b)

Shortest-job first scheduling

c)

Round-robin scheduling

d)

Priority scheduling

e)

Multilevel queue scheduling