Test 2 Flashcards
How is memory accessed?
address points to the memory cell that contains the data
Instruction Register (IR)
the register that contains the instruction currently being executed
Program Counter (PC)
the register that contains the address of the next instruction to be executed
Fetch Execute Cycle
- Fetch the next instruction
- Decode the instruction
- Get data if needed
- Execute the instruction
What is a pep8 simulator?
It is a virtual computer
Two different types of testing
Black box testing
Data coverage
Data coverage, Black box testing
testing a program or subprogram based on the possible input values, treating the code as a black box
Clear box testing
Testing a program or subprogram based on covering all the statements in the code
Describe the difference between how humans and computers solve problems
Humans are abstract and recursive
Computer are concrete and must be directed through a problem to a solution
Distinguish between simple and composite data types
Simple data types are algorithms with selection and repetition (cannot be divided)
Composite data types are arrays and records (strings)
Recognize recursive problem solving
the ability of an algorithm to call itself
Divide and conquer problem solving technique
dividing the problem into smaller components to solve easier
Computer problem solving process
analysis and specification phase
algorithm development phase
implementation phase
maintenance phase
Array
only can contain on type of data
Composite data type
can contain different types of data
Searching methods
Binary search
Sequential search
Binary search
looks for an item in a list using a divide and conquer strategy
only works with sorted data
Sequential search
start at beginning until target located
works with unsorted data [most suited]
Recursive algorithms
ability of a function to call itself
Know difference between stacks, queues, list
d
Stack
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
Queue
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
Linked
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
Ethical issues in computer use
name and describe 2 unethical computer uses
Workplace monitoring
Copywriting and Software Piracy
