⌨️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: 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 semicondctors
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
comp 2.4: true or false, logic gates selectively allow electrisity to flow
true
comp 2.4: what do logic gates form in the CPU
logic circuits that perform calculations
comp 2.4: do you perform the operations in brackets first in Boolean order of operations
yes
Comp 2.4: what is this symbol in Boolean logic ^
It is AND
Comp 2.4: what is this symbol in Boolean logic ¬
NOT
Comp 2.4: what is this symbol is Boolean logic V
It is OR
comp 2.4: what is the order of precedence for Boolean logic
Not, And, Or
comp 2.5: what is a HLL
it is a high level language and often resembles English, they can be very portable
comp 2.5: what are the pros and cons of HLLs
pro: they often resemble English
con: they are not always as fast as they require more translation
comp 2.5: what is an LLL
it is a low level language, they require less translation (lowe levels of abstraction from machine language)
comp 2.5: what are compilers
they translate a whole code at once, errors do not stop the code from being compiled and will all show up when the compiling is done, they create an exicutable file
comp 2.5: what is an interpreter
they translate high level code into executable programs one line at a time, they stop when they find and error
comp 2.5: what is an assembler
they translate assembly code into binary, they run fast.
comp 2.5: what is an IDE
Integrated development environments, they are software that facilitate software development
comp 2.5: in terms of IDEs what are debug tools
error diagnostics that highlight errors in code
comp 2.5: in terms of IDEs what are code editors
they allow code to be written
comp 2.5: in terms of IDEs what are translators
a program that converts source code into object code
they also facilitate the ‘RUN’ button