Computer Science 2 Flashcards
comp 2.1: what is decomposition
breaking the problem down into smaller parts to simplify it, the smaller problems can be called sub-problems
comp 2.1: what is a structure diagram
they are used to represent decomposition, they are divided into nodes, the smallest node contains one task
comp 2.1: what is algorithmic thinking
this is a way of finding a solution by finding the individual steps needed
comp 2.1: what is abstraction
where you remove the unnecessary details from a problem
comp 2.1: what is a linear search
this searches through a dataset and matches the first letter and then the next and the next until it finds a match
comp 2.1: what is a binary search
finds a midpoint in the data sees if what you want is higher or lower and then half again until it finds a match, only works in an ordered list
comp 2.1: what is a bubble sort
a bubble sort is a sort that orders a list by letting the things floaty to the top
comp: what is a logic error
it is an error in which an unexpected output occurs, they do not stop the program from working
comp: what is a trace table
it is a method of checking a program that involves going through it and recording each change in a new column of the table
comp 2.4: how do transistors function
by using superconductors
comp 2.4: what component in the computer uses transistors to temporarily store data
the RAM (primary storage)
comp 2.4: what are electrically controlled switches called
transistors
comp 2.4: what are logic circuits composed of, where are they in the computer and what do they do
transistors, CPU and they perform calculations
comp 2.4: what form logic gates or “switches”
transistors
comp 2.4: how many transistors are in the CPU
3 bn