OPERATING SYSTEM
USER
O.S
-hardware resources
-user assess
-manages software
-serves ; internert, orubtubg
-utility; backup, defragment
eg.
windows 7, vista, Wp
mac osx
linux ubuntu, open sourse, etc
BASIC INPUT OUTPUT SYSTEM
versions of ubuntu
minumum specification - recommended
portable versions
google operating system
P.C
now more specifically to Ubuntu.. :)
Lynux is open source software so you are able to change it. this software is for free ;)
- has variety and ubuntu is one of the variations.
every 6 months they release a new one.
can run on any machine whether it be old or new so it is conveniently suited to make even your old computer look as good as a mac or windows operating system.
ubuntu loads of the cd or you can download the file on to a cd. install it from the internet and have double servers.
has open office which is also free and is compatiable with office. allowing you to open and save files also allowing them to be open or resaved to office and then with open office as well.
has its own ap store- the first ap store!
Wednesday, July 28, 2010
Friday, July 23, 2010
flowcharting
what is a flow chart?
a flow chart is a visual representation of the flow of data through the information processing system.
- decisions that are being made and the process.
Describe the basic flowchart symbols
A variable is a container that stores values.
with a rectangle- one arrow goes in and one comes out.
a diamond- making decisions- one arrow goes in and two come out- though the bottom and side. the text you put in the diamond can only be a yes or no answer or true or false.
the arrow joins another arrow and not the box. no lines coming back to a box and no lines that go diagonally.
always start with a start symbol and end with an end symbol.
With the decision making symbol (diamond) and the process symbol (rectangle), what are the rules for how many lines may enter and leave the symbol.
rectangle- one arrow goes in, one arrow comes out.
diamond- one arrow goes in, two arrows go out.
a flow chart is a visual representation of the flow of data through the information processing system.
- decisions that are being made and the process.
Describe the basic flowchart symbols
A variable is a container that stores values.
with a rectangle- one arrow goes in and one comes out.
a diamond- making decisions- one arrow goes in and two come out- though the bottom and side. the text you put in the diamond can only be a yes or no answer or true or false.
the arrow joins another arrow and not the box. no lines coming back to a box and no lines that go diagonally.
always start with a start symbol and end with an end symbol.
With the decision making symbol (diamond) and the process symbol (rectangle), what are the rules for how many lines may enter and leave the symbol.
rectangle- one arrow goes in, one arrow comes out.
diamond- one arrow goes in, two arrows go out.
Wednesday, July 21, 2010
ariadne is too cool.
What is an Algorithm?
An unambiguous set of steps, which when performed correctly by a processor, will result in a process being carried out in a finite time.
For example if you were to explain to someone how to make a cup of coffee you would be defining an algorithm;
1. boil the water,
2. place coffee in the cup,
3. place sugar in the cup,
4. add the boiling water,
5. add milk,
6. stir.
1. Examine the algorithm above. What two properties of the algorithm enable it to correctly describe the solution to the problem of making a cup of coffee? What is it that makes an algorithm correct?(Hint: what would happen if you swapped step "6" and step "2"?)
2. Define Algorithms for the following processes.
Making toast and consuming.
1. buy bread.
2. buy toaster
3. buy topping
4.place bread in toaster
5. choose setting for idea toasting degree
6. press the toaster button thing down.
7. wait for the bread to toast.
8. take bread out of toaster
9. place toast on plate
10. dress your toast
11. place toast in hand
12. open mouth
13. place toast in open mouth
14. close mouth
15. chew
16 .repeat steps 12-15 until all consumed.
17. clean up.
Calling a friend on the phone.
1. gain friend
2.
An unambiguous set of steps, which when performed correctly by a processor, will result in a process being carried out in a finite time.
For example if you were to explain to someone how to make a cup of coffee you would be defining an algorithm;
1. boil the water,
2. place coffee in the cup,
3. place sugar in the cup,
4. add the boiling water,
5. add milk,
6. stir.
1. Examine the algorithm above. What two properties of the algorithm enable it to correctly describe the solution to the problem of making a cup of coffee? What is it that makes an algorithm correct?(Hint: what would happen if you swapped step "6" and step "2"?)
2. Define Algorithms for the following processes.
Making toast and consuming.
1. buy bread.
2. buy toaster
3. buy topping
4.place bread in toaster
5. choose setting for idea toasting degree
6. press the toaster button thing down.
7. wait for the bread to toast.
8. take bread out of toaster
9. place toast on plate
10. dress your toast
11. place toast in hand
12. open mouth
13. place toast in open mouth
14. close mouth
15. chew
16 .repeat steps 12-15 until all consumed.
17. clean up.
Calling a friend on the phone.
1. gain friend
2.
Subscribe to:
Comments (Atom)