1Steps on how to solve it (george polya)
understand, plan, carry out plan, look back
2questions to ask to understand (polya)
what are you asked to find? Can you restate the problem in your own words?
3Data
any value that is provided or is calculated during the solution of the problem
4Bit
basic unit of information in computing
5Bit can have values
0 and 1
6example of bit positive number 10110
1(2^4)+0(2^3)+1(2^2)+1(2^1)+0(2^0)=22
8what is the smallest memory block computers address
bit
9how is an integer stored
four bytes that contain 32 bits
10what is the highest number of integers possible to store
2^32
11which bit indicates sign of integer
1st
12how is the integer stored in x-bits when its negative
2^x + negative number
13example: how is -2 stored as an 8-bit integer?
2^8-2=254, in binary form 11111110
14character
form of integer in terms of how its stored
15Boolean
A single value of either TRUE or FALSE
16string
A sequence of characters
17structure
way to collect different data into a single data type
18objects
structures that contain methods that the user can use to work on data
19Boolean logic
how logical variables can be combined and what the result is
20not(A)
¬(boolean) ~(matlab)
21object-oriented programming
designing a program by discovering objects, their properties, and their relationships
22Procedural Programming
a style of programming in which sets of operations are executed one after another in sequence
23Structured Programming
A method of programming which follows rules about selection, sequence, and iteration control structures.
24Exception Handling
When there's an error, the program makes an error object and passes it off to the runtime system, which looks for a method in the call stack to handle it.
25Modularity
The subdivision of a computer program into separate subprograms
26callable units
set of program instructions that perform a specific task
27block structure
section of code grouped together
28Abstraction
separation of a component behavior from its implementation
29Algorithm
A well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time
30characteristics of an algorithm
well-ordered, unambigous, effectively computable
31method for developing algorithim
define problem, list inputs, describe steps and test
32what control is similar to switch
if and a lot of if-else tests
33if a variable has global scope, which parts of a computer program have access to variable
all parts
3610011011 if unsigned
128+16+8+2+1=155
3710011011 if signed 2's complement
-128+16+8+2+1= -101
3810011011 if signed 1's complement
-(64+32+4)= -100
39a complex number could be implemented in an ooc, 2 attributes and 2 methods
attributes,- imageal or arg/mod
methods- complex_plus, imag_part, argument