compsci 2

analog (continuous):

good for highly variable data

digital (discrete):

good for reproducibility

bits

 (base 2)

digits

 (base 10)

 integer

binary number with sign bit

 real

scientific notation → two integers

 text

each character as 8-bit ASCII code

Galileo pioneers the use of experimentation to validate observed theories and as as result is considered the father of modern science

true

An algorithm is a step-by-step sequence of instructions for carrying out some task

true

Suppose you have been given a list of 100 names and you need to find a particular name on the list. Using sequential search, it is possible that you may have to look at every location before finding the name on the list.

true

sequential search

can be fine for small lists, but it is not super fast and efficient

Suppose you have been given a list of 100 names and you need to find a particular name on the list. Using Binary Search, it is possible that you may have to look at every location before finding the name on the list.

false

Binary search

more efficient that sequential

JavaScript statements within a Web page are executed by an interpreter that is embedded in the browser software.

true

The three recurring themes that define the discipline of computer science are

Hardware, Software, and Theory

Since an analogue representation of data uses a continuous, potentially infinite, range of values, reproducing analog data exactly can be difficult

true

3 high level characteristics of computational thinking

decomposition, abstraction, pattern matching

if there were 32 people in the room, how many rounds of Bday comparisons would it take to find the oldest

5

Binary number that represents the decimal value of 13

1101↓2

The steps of the scientific method

OHDEAR

O

Observation

H

Hypothesize

D

design

E

experiment

A

analyze

R

revise

odd number

ends in 1

even number

ends in 0

accuracy is a measure of how close an experiment result is to the expected result

true

abstraction is the ability to ignore irrelevant details and focus only on the aspects that are essential to designing a solution

true

Binary search is an example of 0(log N) algorithm, where the numbers of items in the list to be searched is N.

true

assembly languages

use words

machine languages

use binary number sequences

java script

in the head, gives the function of what the page should do, kind of like behind the scenes work

HTML

written in the body, is what is displayed in the page

parallel processing occurs when a computers computational task is split across multiple CPU’s, allowing for computations to be performed simultaneously

true

The Turing test was proposed by Alan Turing to determine whether an AI machine has been constructed

true

binary #’s

only 1’s and 0’s

decimal #’s

all numbers