Csc 10 Final

Front 1

Five major parts of a computer

Back 1

Main memory, secondary memory (usb), CPU, input devices, output devices

Front 2

Difference between secondary memory and main memory

Back 2

Main memory is RAM (volatile) and within the computer. Secondary memory can hold data for long periods of time (like USBs)

Front 3

What is a program?

Back 3

Set of instructions that a computer performs to complete a task

Front 4

What is the difference between a high-level and a low-level programming language?

Back 4

High-level languages allow you to create programs without knowledge of how the CPU works. Low-level languages requires that you use mnemonics and have some knowledge of the CPU.

Front 5

Compiler

Back 5

program that translates a high-level language into a separate machine language program

Front 6

interpreter

Back 6

program that both translates and executes the instructions in a high-level language program

Front 7

2 types of software

Back 7

system software and application software

Front 8

System software

Back 8

runs the computer, like Windows or Apple OS

Front 9

Application Software

Back 9

secondary software not necessary for the processes of the computer, like Skype or MS Word

Front 10

Assembler

Back 10

special program that is used to translate assembly language into machine language

Front 11

A Byte

Back 11

8 bits makes one byte. the way computer memory and storage is divided.

Front 12

Bit

Back 12

binary digit= bit. think of it like a tiny "on/off" switch for the computer to read/write data

Front 13

Fetch->decode->execute cycle

Back 13

fetch data-> decode and understand the instruction-> execute the instruction

Front 14

pseudocode

Back 14

fake code used as practice before implementing actual computer code

Front 15

Flowchart

Back 15

graphical way of designing a program

Front 16

Input and output

Back 16

input some data, stuff is calculated, output the answer to calculation

Front 17

Variables and rules

Back 17

storage location that is represented by a name

rules: names must be one word with NO spaces

punctuation characters cannot be used in variable names

first character of a name cannot be a number

Front 18

String

Back 18

use of characters instead of numbers

Front 19

=

Back 19

is used to assign a declared variable

ex: var A = 5

Front 20

Named constant

Back 20

a variable that cannot be changed during a program

ex: Constant_Var = 10

Front 21

hierarchy of arithmetic operations

Back 21

Parenthesis> exponents>Mult>Div>Modulus (divides one number another and gives the remainder) >addition> subtraction

all performed from left to right

PEMMDAS

(2+5)^2 * 1 /1 + 3-1

Front 22

variable declarations and data types

Back 22

a statement that tells the program 2 things: variables name and data type

i.e. string, integer, boolean

Front 23

variable initialization

Back 23

declaring a variable and then assigning it

ex: var Price= 28.50

Front 24

uninitialized variable

Back 24

a declared variable with no assigned value

ex: Declare Integer "sentinel"

Front 25

external documentation

Back 25

describes aspects of the program for the user

Front 26

internal documentation

Back 26

describes how the program works for the programmer

Front 27

benefits of a module

Back 27

simpler code, code resuse, better testing, easier maintenance, faster development, easier facilitation of teamwork

Front 28

defining a module

Back 28

modules contain a header and a body. header is the starting point of the module. the body are the lines or statements that belong to the module

Front 29

calling a module

Back 29

ex: Call Main Module()

the computer executes the statements of the module then jumps back to the main program

Front 30

Flowcharts and designing a module

Back 30

flowcharts show the logic inside a module. either through hierarchy or structure charts, boxes represent modules and show how they are related to each other

Front 31

pass by value

Back 31

passing values between calling a program (arguments) and a module( parameters). only a copy of the arguments are passed into a parameter variable. changes in content to a parameter value doesn't affect the content of the arguments in calling the program

Front 32

pass by reference

Back 32

arguments are passed into a special type of parameter known as a reference variable which allows a module to modify the argument in the calling part of the program

Front 33

global variables

Back 33

variables known by and potentially used by every module in a program. any module can make changes to global variables

Front 34

global variable restriction

Back 34

they make debugging difficult

changes to global variables in one module may require changes in these variables and other modules

they make the program difficult to understand

Front 35

Types of decision structures

Back 35

single-alternative =if-then

dual-alternative= if-then-else

Front 36

What is a case structure?

Back 36

It's a multiple alternative decision structure that allows you to test the value of a variable or expression and determine which sets of instructions to execute after

Front 37

What are the logical operators?

Back 37

AND (both statements must be true)

OR (one of the statements have to be true)

NOT (reverses the truth of the Boolean expression)

Front 38

What is a relational operator?

Back 38

determines whether a specific relationship exists between 2 values

Front 39

Types of relational operator

Back 39

> (less than)

< (greater than)

>= (less than or equal to)

<= (greater than or equal to)

== (equal to)

!= (not equal to)

Front 40

How do computers compare strings?

Back 40

They compare the numeric value that corresponds with the character

Front 41

Nested decision structure

Back 41

when a decision structure is within another decision structure

Front 42

3 Major control structures

Back 42

Sequence structure = set of statements

single-alternative = if-then

dual alternative= if-then-else

Front 43

Condition-controlled loop

Back 43

uses true/false condition to control how many times a loop will iterate

Front 44

Count-controlled loops

Back 44

uses a specific number to control how many times the loop iterates

Front 45

3 types of condition-controlled loops

Back 45

While, do-while, do-until

Front 46

Parts of a loop

Back 46

initialization, test, increment/decrement

Front 47

What are pretest loops?

Back 47

Loops that test their condition before iterating

ex: while and For loops

Front 48

Posttest loops

Back 48

iterate before testing their condition

ex: do-until and do-while

Front 49

Accumulators

Back 49

calculates a running total

Front 50

sentinels

Back 50

prevents an infinite loop. it's a way of inserting a condition to make the loop stop or make the condition false.

Front 51

What's a function?

Back 51

group of statements that perform a specific task but returns a value when it is called, unlike a module

Front 52

Library functions

Back 52

functions that are built into the programming language

Front 53

Random number generator

Back 53

a function that generates a random number. useful in security

Front 54

IPO Chart

Back 54

Input, processing, output

a chart that describes the input, processing, and output of a program

Front 55

GIGO

Back 55

garbage in, garbage out

the idea that if a program reads bad data, it will produce bad data

Front 56

input validation

Back 56

a loop that iterates every time the user inputs bad data, which will only execute the next statements in the program once the data is valid

Front 57

defensive programming

Back 57

the practice of anticipating errors and designing programs to avoid those errors. input validation is a practice of defensive programming

Front 58

Sequential search

Back 58

simple way of for finding an item in an array. it looks for the item in order comparing the previous data to the next

Front 59

Off-by-one errors

Back 59

when a loop iterates one too many or too few times

ex: For index= 0 -- SIZE-1

N [index]= 1-SIZE

Front 60

Bounds checking

Back 60

where a programming language does not allow an array to use an invalid subscript

Front 61

parallel arrays

Back 61

2 or more arrays that hold related data

ex: an array for student IDs and an array for student test scores

Front 62

2 and 3 dimensional arrays

Back 62

are several identical arrays put together. useful for storing multiple sets of data

Front 63

Bubble sort

Back 63

sorts data in ascending or descending order. it's called this because certain values bubble towards the end

Front 64

swapping elements

Back 64

assign a temp variable and swap as many times as needed

ex: temp = a

a=b

b=temp

Front 65

selection sort

Back 65

uses fewer swaps because it moves items immediately to their final position in the array

Front 66

insertion sort

Back 66

more efficient than bubble sort

sorts the first 2 elements, compares elements and if necessary will swap elements into the correct order

Front 67

binary search

Back 67

is more efficient than a sequential search.it divides the array in half repeatedly until it locates an item but discards the half that does not have the item