Test 2

Question 1

How is memory accessed?

Answer 1

address points to the memory cell that contains the data

Question 2

Instruction Register (IR)

Answer 2

the register that contains the instruction currently being executed

Question 3

Program Counter (PC)

Answer 3

the register that contains the address of the next instruction to be executed

Question 4

Fetch Execute Cycle

Answer 4

• Fetch the next instruction
• Decode the instruction
• Get data if needed
• Execute the instruction

Question 5

What is a pep8 simulator?

Answer 5

It is a virtual computer

Question 6

Two different types of testing

Answer 6

Black box testing

Data coverage

Question 7

Data coverage, Black box testing

Answer 7

testing a program or subprogram based on the possible input values, treating the code as a black box

Question 8

Clear box testing

Answer 8

Testing a program or subprogram based on covering all the statements in the code

Question 9

Describe the difference between how humans and computers solve problems

Answer 9

Humans are abstract and recursive

Computer are concrete and must be directed through a problem to a solution

Question 10

Distinguish between simple and composite data types

Answer 10

Simple data types are algorithms with selection and repetition (cannot be divided)
Composite data types are arrays and records (strings)

Question 11

Recognize recursive problem solving

Answer 11

the ability of an algorithm to call itself

Question 12

Divide and conquer problem solving technique

Answer 12

dividing the problem into smaller components to solve easier

Question 13

Computer problem solving process

Answer 13

analysis and specification phase
algorithm development phase
implementation phase
maintenance phase

Question 14

Array

Answer 14

only can contain on type of data

Question 14

Composite data type

Answer 14

can contain different types of data

Question 14

Searching methods

Answer 14

Binary search

Sequential search

Question 14

Binary search

Answer 14

looks for an item in a list using a divide and conquer strategy
only works with sorted data

Question 14

Sequential search

Answer 14

start at beginning until target located

works with unsorted data [most suited]

Question 15

Recursive algorithms

Answer 15

ability of a function to call itself

Question 16

Know difference between stacks, queues, list

Answer 16

d

Question 17

Stack

Answer 17

Vertical implementation
PUSH to add data to elements
POP to remove data from stack
CAN TEST to see if stack is empty
FILO - FIRST IN LAST OUT
LIFO - LAST IN LAST OUT

Question 18

Queue

Answer 18

Horizontal Implementation 
Enqueue to add data to elements
Dequeue to remove data from queue
CAN TEST to see if queue is empty
FIFO - FIRST IN FIRST OUT
LILO - LAST IN LAST OUT

Question 19

Linked

Answer 19

An implementation of a container where the items are stored together with information on where the next item can be found
Based on composite structures but can also be array based
An array is a built in structure
A list is an abstract structure
Add for adding nodes to list
Remove or delete nodes from list
Can search on list
Can sort list
Can test to see if list is empty

Question 20

Ethical issues in computer use

name and describe 2 unethical computer uses

Answer 20

Workplace monitoring

Copywriting and Software Piracy

Question 25

What is ADT

Answer 25

abstract data type is a container whose properties are specified independently of any particular implementation

Question 26

The difference between array based and linked based implementation

Answer 26

Array Based Implementation
An implementation of a container in which items are stored in an array

Linked implementation
An implementation of a container where the items are stacked together with information on where the next item can be found

Question 27

Difference between machine language and assembly language.

Answer 27

Machine language
The language made up of binary coded instructions that is used directly by the computer
Assembly language
A low level programming language in which a mnemonic represents each of the machine language instructions for a particular computer

Question 28

what is a virtual computer

Answer 28

A hypothetical machine designed to illustrate important features of a real machine

Question 29

pseudocode

Answer 29

a language designed to express algorithms

Question 30

program control structures

Answer 30

looping, selection, sequence

Question 31

Looping control structures

Answer 31

sentinel type looks for a situation to be true or false

count control iterates through a process a number of times

Question 32

selection control structure

Answer 32

case - select from a pick list

if - selection based on condition

Question 33

sequence control structure

Answer 33

program begins at first line of code and executes until all lines are interrogated, program then exits