Monkeys deck for getting an A star Flashcards

1
Q

What is CISC

A

Complex Instruction Set Computer

  • Single Instruction can execute several low operations within single cycle
  • takes less space in memory
  • More expensive
  • Makes programmers life easier
  • Emphasis on hardware
  • High Cycles per second
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Application Software

A

Program Designed for user, people who actually use the product

-Communication Software, Digital Graphics, Animation, XBOX

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

General Purpose Software

A

Software for many purposes

-Word, PowerPoint Etc

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Special Purpose Software

A

Specific Task

-Anti virus, Compression tool, Disk Defragmenter etc

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Open Source

A
  • Source Code can be accessed and modified by user
  • Usually free
  • Flexible
  • Community Supported
  • No warranty
  • No updates from devs
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Closed Source

A

Software where compiled code is released and the source code is closed.

  • Restricts modification
  • Can cost a lot
  • May not fit user needs
  • Comes with warranties
  • Developers can hold copyright and restrict how software can be used
  • Dev support
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

High Level Language

A

Source code is easy for human to write to , but computer needs to translate it into machine code before they can read it

  • Code is easy to modify
  • Must be translated into machine code
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Low level Language

A

Hard for humans to red and write to but easy for computer to run

-Usually written for one type of machine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Sequence

A

Two or more statements executed one after the other, line by line and top down

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Selection (Branching)

A

Used to select which statements will be executed next, depending on conditions i.e. IF , ELSE Statements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Iteration

A

Repetition, including Loop programs to repeat a number of statements i.e. FOR , WHILE Loops

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Assembly Language

A

Part of low level languages
converted to machine code using assembler
uses mnemonics rather than binary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Assembly Language - (ADD)

A

Addition , add value at given memory address to value in accumulator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Assembly Language - (SUB)

A

Subtract , Subtract the value at given memory address to accumulator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Assembly Language - (STA)

A

Store, Store the value in Accumulator and the given memory address

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Assembly Language - (LDA)

A

Load, Load the value at given memory into accumulator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Assembly Language - (INP)

A

Input , Allows the user to input a value which will be held in accumulator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Assembly Language - (OUT)

A

Output, Prints the value currently held in accumulator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Assembly Language - (HLT)

A

Halt, Stops the program at that line

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Assembly Language - (DAT)

A

Data, Creates a flag with a label at which data is stored

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Assembly Language - (BRZ)

A

Branch If Zero , Branches to a given address if the value in the accumulator is zero, This is conditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Assembly Language - (BRP)

A

Branch If Positive , Branches to a given address if the value in the accumulator is Positive, This is conditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Assembly Language - (BRA)

A

Branch If Always , Branches to a given address no matter the value of the accumulator, This is unconditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

TCP

A

Transmission Control Protocol

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
IP
Internet Protocol
26
Stages of TCP/IP Stack
1. Application Layer - Specify what is being sent i.e Pop3 , HTTPS etc 2. Transport Layer - Uses TCP to establish End-to-End connection. Splits data into Packets and labels packet with number 3. Internet Layer - Adds source and destination IP address and IP port number (socket address). Router uses IP address to forward packet. Socket specifies device being sent to. 4. Network Access/Link Layer - Physical Connection between network devices. Adds MAC address so packets can arrive at destination properly.
27
What is Abstraction
Abstraction - The process of removing excessive details to arrive at a representation of a problems that consist of only the key features. -Hides complex information , prevents program from getting too large
28
Caching
Process of storing instruction or values in cache memory after they have been used. Prefetching algorithms predict which instruction is likely to be fetched soon. -Less time waiting -difficult to implement -accuracy of prefetched algorithm as information is predicted
29
Thinking Procedurally
-Breaks down into smaller parts which are easier to understand - First stage - Break down into component parts. Decompose the problem into sub problems. Becomes more feasible to manage and divided between a group of people. - Commonly used in top down design.
30
A Function
A subroutine which returns a value
31
A Procedure
A subroutine which does not return a value
32
Sections of Development in Waterfall and Rapid
1. Feasibility 2. Requirments 3. Analysis and Design 4. Implementation (Code) 5. Testing 6. Evaluation 7. Maintaincance
33
Waterfall Application
Goes from one section to another allowing changes along the way each time. Very simple and fast allowing constant changes back. Well defined start and end. Client can only see product near end. - Simple - Clear stages - Easy to keep to schedule - Suitable for large products - Carries risk
34
Rapid Application
Goes through cycle similar to waterfall but instead can only revert at the evaluation stage and go back to development, if its good it goes to maintenance. Great for rapidly developing software. Client needed at every stage. - Continuous feedback from client - Not good for large projects
35
Spiral
A spiral chain with 4 areas being identifying, deigning , construction and evaluation. Spiral starts in the middle with fundamentals and spirals outwards through more depth. Takes longer, More accurate, Thorough, less risk and reliable. - Good for large scale projects - High costs - High skills needed
36
Extreme Programming
Mid sized teams producing very high quality code and software. Its about precision and worker Woking together to make high quality code. - High quality code - Requires programmers to work closely and check over the code
37
Black Box Testing
Make sure that the inputs and outputs produce expected result. Testing team
38
White box testing
Testing the algorithm of the code to make sure it all works as should. Quality check
39
Alpha Testing
Early stages of development, usually by employees, small scale. Employee feedback
40
Beta Testing
Beta Testing done during the end of development. is done commercially as software is almost ready
41
What is RISC
Reduced Instruction Set Computer - Simple instructions such as LOAD/STORE - Takes more cycles for complex tasks - Less heat - Emphasis on software - Larger Code Sizes - Smaller and cheap
42
Von Neuman Architecture
- Shared memory space for instruction and data - instructions and data stored in the same format - a single control unit - one instruction at a time - fast access to instructions and data - 1 data bus going back and forth with main memory and CPU
43
Harvard Architecture
- Instructions and data stored in separate memory - Each has its own bus - reading and writing can be done at the same time as fetching - used by RISC Processors and embedded systems
44
BIOS
BASIC INPUT OUTPUT SYSTEMS - Responsible for loading OS - First checks all hardware is connected and working using the power-on-self-check (POST). - BOOT loader or BOOTSTRAP load the OS is kernel memory allowing OS to take over - Initial start-up stored in ROM - BIOS Settings stored in Flash Memory
45
Ethics Card
- Technology is taking low skilled jobs, this impacts the customer, emplyees,company and communities (Other business/local area - Automated Decision Making, Computer making decisions on rules and parameters with no human involvement. - AI (Artificial Intelligence), Applied/Weak/Narrow AI = Designed to manage specific task , most common AI. generalised Ai = Can evolve to handle other tasks through machine learning -Machine Learning - A machine learning without instructions Robot - A machine that carries out work following instructions - Ethics with AI , Accountability, Safety Legal liability for loss of life, algorithm bias/priorities certain outputs. - Environmental impacts - 2% of global energy is in data storage. Computers contain toxins like Cadmium, Mercury and Aluminium and if disposed wrong can affect local communities , especially in poorer countries. -Censorship, ISP in UK block access to extreme politics, Extreme adult content and copyright infringement. Passive monitoring is CCTV and forced tracking is police or work based tracking employees or criminals. Data collection is when a computer collects personal information on the user through search history , web browsing , chats , shopping etc. Software Piracy - User illegally accessing paid services for free. The company can protect their content through copyright , trademark and licensing. - Computer Misuse Act - Unauthorised access to computer material , intent to commit offense - Data Protection Act - Use data fairly, lawfully, transparency, specific and accurate. must not be kept for longer than necessary.
46
Thinking Logically
-Logical Decisions - identifying points in a solution where a decision needs to be made. - Determine the logical conditions that affect the outcome of a decision - Determine how decisions can affect the flow of program - Determine conditions like IF statements.
47
Round Robin Scheduling
Its gives each process an equal set amount of time to complete and if it fails to complete in the time window it is set to the back of the queue
48
First Come First Serve (FCFS)
The first process to request the services of the CPU is served , all processers are queued up in the order they arrive. This is bad performance for a PC
49
Shortest Job First
Algorithm Prioritises the shortest and fastest jobs first.
50
Shortest Time Remaining
Algorithm will prioritise the job with the shortest processing time remaining. This multitasking algorithm is fairly efficient at finishing as many jobs as possible
51
Multi-level feedback Queue
- Algorithm makes use of a range of queues, with each queue given a different priority. ensures the CPU works as efficiently as it can.
52
Paging
Main memory divided into fixed size blocks called page frames and programs are divided into blocks (4kb) sizes called pages. pages are swapped between secondary storage and the page frames as necessary. - Pages are physical divisions of memory - pages are small
53
Segmentation
- Segmentation is when main memory is divided into variable size blocks called segments where each segment corresponds to a program routine - Splits program logically - Segments logically divided - no physical split - variable size
54
Device Drivers
Enable OS to control and communicate with devices
55
OS types
- Embedded - Washing machine - Real time - Heart rate monitor - Multiuser - super computer server - Multitasking - Desktop PC
56
ALU
Arithmetic Logic Unit | deals with basic arithmetic such as binary addition or subtraction
57
CU
Control Unit -Coordinates the various units inside the processor using control signals. instructions are decoded in the control unit during fetch decode execute
58
PC
Program Counter | Contains the address of the next instruction to be executed
59
MAR
Memory address register, Contains the address of the memory location in use
60
MDR
Memory Data Register, Contains instructions/data to be executed
61
CIR
Current instruction Register , Holds the instruction whilst its decoded
62
ACC
Accumulator, Stores the results of calculations by ALU
63
Pipelining
Pipelining improves the performance of the CPU, whilst the processor is decoding an instruction, the next instruction can be fetched from memory
64
Factors Affecting CPU
Cores - Each core operates independently each having there own FDE cycles and tasks Clock Speed - How many FDE cycles per second the CPU can perform i.e. 3.4GHz 3.4 Billion cycles per sec Cache Memory - Faster than RAM, close to registers, expensive, used for frequently used tasks like parts of OS - Temperature - Bus width - Register size
65
Data Bus
Data transmitted between CPU and memory. Can travel either direction 1 at a time
66
Address Bus
Data is saved/loaded from memory. it travels along address bus. the CPU only ever sends out address bus , not receive it
67
Control Bus
When the control unit sends and receives signals, they travel along the control bus
68
Compiler
Translate all the source code at the same time and create executable files Only needed once to create executable file Returns a list of errors Can take long
69
Interpreter
Translate and runs source code, does one instruction at a time and doesn't create an executable file Needed every time you want to run a program Slow as code is being translated
70
Assembler
Uses low level source code to translate assembly language into machine code Each assembly code is equal to one machine code instruction. Each program has a different assembler
71
Dedicated servers
Keeps running all of the time. Server farms​ Better Performance/Handles lots of traffic/Less lag​ Better Security. ​ If the server goes down , the whole game shuts off​
72
Listen Server
Halfway between dedicated client server and peer to peer. Host acts as temporary server.​ Free​ Dependent on hosts internet.​ If host leaves , host migration goes to another player.​
73
Peer-to-peer
Cheaper​ Slows down the more users trying to get in​ If one goes down , others still stay up​ Data is sent as raw streams/ Player count limited​ More users = more slow server Limited amount​ No need for pc in charge on network/all equal​ Simpler and lower cost​
74
Client-server
One pc acts as network controller ​ Network access centrally controlled ​ More complex.​
75
Modem
Transforms digital information from your computer into analogue signal that can be transmitted through wires Two ports - one that connects to outside world - An ethernet port for router or computer
76
Router
Mainly responsible for routing data - between devices on small home network - between devices on a network and internet
77
Cables
Twisted pair - cable made up of pair of insultated copper wires. more affordable and provide low bandwidht Coaxile -
78
Cables
Twisted pair - cable made up of pair of insulated copper wires. more affordable and provide low bandwidth Coaxial - Moderate bandwidth , more expensive than twisted but cheaper than fibre optic - good for radio transmissions Fibre Optic - High Bandwidth and most expensive. for long distance data transfer
79
Network interface card
Allows a computer to connect to a network
80
Wireless Access Point (WAP)
Device that creates a wireless local area network (WLAN)
81
Hub
Allows you to connect multiple devices to one network on a physical layer . much slower than a switch for data transfer
82
Switch
Allows you to connect multiple devices to one network on a data link layer. much faster than a hub at data transfer
83
Virtual Memory
when main memory is running low it can use virtual memory within the hard disk to run other tasks - much slower
84
Sign and Magnitude
``` 1 = negative 0 = Postive ``` e.g 10000101 = -5 0000101 = 5
85
Twos complement
Most significant bit is negative e.g ``` 00010001 = 17 1110111 = -17 ``` for positive number start with 0 , for negative number start with 1
86
Normalised Floating point
All positive normalised floating point numbers start with 01 | All negative normalised floating point numbers start with 10