Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

cs > Theory > Flashcards

Theory Flashcards

1
Q

Symmetric Encryption

A

A
Symmetric Encryption is when the same key is used to encrypt and decrypt the message. Both party’s must know the key and also keep it secret.

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

linked lists

A

A list of data together with a set of links to sort the data. Data is stored in the order its input and pointers are used to link the data into the desired order.

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

Peer-to-Peer Networking

A

No central computer, all computers are connected to each other locally or over a WAN

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

components of a packet

A

senders address, recievers address, packet contents, sequence number

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

Program Counter

A

stores the address of the next instruction

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

Real-time Operating system

A

Designed to carry out actions within a guaranteed amount of time even when left running for long period.

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

Asymmetric Encryption

A

Asymmetric Encryption is when a public key and a private key is used. The public key is used to encrypt the data and the private key is used to decrypt the data. If you use person X’s public key to encrypt the data only person X’s private key will be able to decrypt it

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

Current instruction register

A

stores the actual instruction that is being decoded

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

Optical storage advantages

A

Cheap
light weight and portable
Resilient

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

Address Bus

A

A one directional bus that transmits memory addresses that are used as operands in programming instructions, so that data can be retrieved from main memory

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

stack data structure

A

A stack is known as a LIFO, a single pointer is used to point to the top item of the stack, when a new item is pushed onto the stack the pointer is incremented. When an item is popped off the stack the pointer decrements to point to the new top of the stack.

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

second normal form

A

Check the data is already in 1NF
Remove any partial dependencies
‘fix’ any many to many relationships you discover

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

polling

A

The CPU checks with each device if it needs attention. Inefficient and wastes time as some devices will not want attention when called upon

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

Solid-State Storage

A

uses flash memory so data is read and written directly to blocks and pages on the silicon micro-chips

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

De Morgan’s Law

A

¬ (A∨B) = (¬ A) ∧(¬ B)

NOT (A OR B) is the same as (NOT A) AND (NOT B)

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

Peer-to-Peer Model:

A

all terminals have equal status and there is no powerful central server, each computer acts as both a client and a server.

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

Absorbtion Law OR

A

A∧(A∨B)=A
X AND (X OR Y) is the same as X

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

Algorithm for insertion into a binary tree:

A

If tree is empty enter data item at root and stop; Current node = root
Else repeat:
a. If new data item is less than value at current node go left, else go right.
b. Current node = node reach (null if no node)
c. Until current node is null
Create new node and enter data

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

TCP/IP stack

A

Application Layer
Transport Layer
Internet layer
Link Layer

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

Hashing

A

Hashing is the process used to transform a data item into something different. A hashing function provides a mapping between an arbitrary length input and a fixed length output. It is a one-way transformation meaning you cannot get back to the original form.

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

Open Source Software

A

the source code for the software is available,
it is free

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

Lossy Compression

A

Actual data is removed from the file in order to reduce its size. An algorithm is used to strip out the least important data. The original file cannot be restored as data is physically removed.

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

Packet Switching

A

the data to be transmitted is broke up into individual packets at the source computer. each packet is labelled with an address and sequence number. The packet is then forwarded onto the network and follows its own individual route. Depending on network traffic each packet will take different routes at different times to reach their destination where is is then reassembled.

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

Uses of virtual machines

A

used on networks to avoid redundant processors
translating code (Java)
running different operating systems

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

Memory Data register (MDR)

A

stores the data which is to be sent or fetched from memory

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

uses of a GPU

A
  • Machine learning
  • Oil exploration
  • Image processing
  • Financial transactions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Embedded Operating Systems

A

embedded systems are often run on dedicated hardware so they run with maximum efficiency, with low powered processors and minimal memory

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

Multi-tasking operating system

A

one processor is scheduled so that each process receives a very small time slice of processor time giving the impression of them running simultaneously.

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

Utility software

A

small programs each with a very specific purpose, which is normally concerned with the maintenance and wellbeing of a computer system

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

Buffer

A

a region of a physical memory storage used to temporarily store data while it is being moved from one place to another

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

scheduler

A

manages which process to execute next and how much time is allowed to execute a process

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

interpreter

A

takes one line of high level source code and converts it directly into machine code then runs it.
this has a one to many relationship and is useful for debugging code however the security is bad and the code is executed slowly

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

virtual memory

A

when the main memory is almost full sections which are less frequently used are stored on the hard disk to free up RAM space

34
Q

Advantages of the waterfall model

A

Everyone on the project is very clear on their responsibilities at each stage.
Simplicity
Easy to see if programming is running to schedule

35
Q

Atomic

A

data is in its lowest level of detail and cannot be split into separate attributes

36
Q

CISC advantage

A

simpler software
more likely to have a single instruction to carry out an action, larger instruction sets
works better with more intensive tasks

37
Q

disadvantages of peer-to-peer

A

no central backing up
slower performance
bad security

38
Q

Drawbacks of packet switching

A

protocols are complex and expensive
packets may be lost
not neccessarily secure

39
Q

Lossless Compression

A

Reduces the file size but allows the original data be perfectly reconstructed from the compressed data. Actual data is still removed however the data is encoded in such a way that the original can be recreated.
Less effect at reducing file size than lossy.

40
Q

Harvard architecture

A

instructions and data are stored in separate memory units
instructions and data are each served by their own buses
allows for pipelining

41
Q

Local Area Network (LAN):

A

method of connecting computers together in a small geographical area. All the hardware and infrastructure is owned by the business/ organisation that uses it.

42
Q

Benefits of Open source software

A

usually free
users are free to amend the source code and tailor the program to their needs
not constrained by commercial considerations
many people are continuously finding and fixing bugs

43
Q

CISC disadvantages

A

more complex circuitry/hardware
Single machine instruction takes multiple machine cycles to carry out
greater energy consumtion
can’t support pipelining
more silicon require to make
physically larger in size

44
Q

Benefits of packet switching

A

efficient use of the network
can be rerouted to avoid problems in the network
data is transmitted immediately

45
Q

Advantages of rapid application development

A

flexible to changes
quick
simple
can reduce risk

46
Q

RISC disadvantages

A

complicated software
more machine code (not as many instructions)
lower clock speed, not good with complicated tasks

47
Q

third normal form

A

Check the data is already in 2NF

  1. Check there are no non-key-dependencies
48
Q

What does an OS provide?

A

User interface
Memory Management
Interrupt handling
Processor scheduling

49
Q

ROM

A

non-volatile read only memory embedded into the motherboard of a computer and used to hold important instructions the computer needs for starting up

50
Q

Agile Modelling

A

Methodology which stages of software are not completed in a linear sequence
Throughout the process feedback is obtained which changes the software
It is a smaller version of spiral

51
Q

Von neumann architechture

A

instructions and data share the same memory space
instructions and data served by the same system bus
instructions and data are stored in the same format
single CU and ALU

52
Q

Syntax analysis

A

(stages of compilation stage 2)
the syntax is checked against the rules and an abstract syntax tree is created
if any code breaks the syntax rules an error is generated

53
Q

Round robin (RR)

A

each process is allocated a specific amount of time known as a time slice or quantum. if a process is not complete at the end of the time slice it returns to the back of the queue, so the next process can have its turn.

54
Q

Absorbtion Law AND

A

A∨(A∧B) = A
X OR (X AND Y) is the same as X

55
Q

Spiral Model

A

designed to try and manage risk. made of four stages:
1. determine objectives
2. Identify and resolve risks
3. development and testing
4. plan next iteration

56
Q

segmentation

A

when memory is split up however the logical divisions of a program are kept together, rather than having fixed page sizes

57
Q

relationship between the DNS server and IP addresses

A

a registered domain name is held on the DNS server. The corresponding IP address to a searched domain name is loaded on the users computer.

58
Q

Disadvantages of the waterfall model

A

The absence of user feedback
not suitable for large projects
Requirements must be very well understood

59
Q

Registers

A

Registers are small storage locations used to hold data temporarily. They have high read and write speeds.

60
Q

Advantages to Peer-to-peer networking

A

Cheap
Enables users to share resources
not difficult to maintain

61
Q

lexical analysis

A

(stages of compilation stage 1)
white space is removed
remaining code is turned into tokens
a symbol table is created (including variables, data types and scope)

62
Q

RISC advantages

A

very simple hardware/circuitry less silicon needed
each instruction is a single machine cycle therefore pipelining can be used to improve performance
lower energy consumption (can go into sleep mode)

63
Q

Run Length Encoding

A

Run length encoding is used when there is repeated redundant data. It stores the item once and then an index with how often the item is repeated.

64
Q

stages of compilation

A

Lexical analysis
syntax analysis
code generation
code optimisation

65
Q

TCP

A

Transmission Control Protocol – used with IP to ensure error free transmission and package switching

66
Q

Fetch

A

The address of the next instruction is copied from the PC to the MAR
The fetch signal is sent across the control bus. The content of the MAR are transferred across the address bus.
The contents of the memory location stored in the MAR are sent across the data bus and stored in the CIR
the PC increments by 1

67
Q

GPUs and their uses

A

Audio processing
machine learning
modelling physical sysytems

67
Q

cloud storage

A

can be accessed from anywhere/ multiple locations
more security

68
Q

memory ,management

A

there are to two ways which are paging and segmentation

paging is giving a process an equal amount memory

segmentation is giving a process realistic amount of

69
Q

what is memory management

A

A computer has a limited memory capacity. Yet, multiple processes run simultaneously, each requiring specific memory spaces. Memory management keeps track of each process in the system, from where it begins and ends, to the space it occupies in the memory, making memory utilization efficient and reliable.

70
Q

what is an operating system

A

the software that manages the computer hardware and software.

71
Q

what does an operating system do

A

manage hardware
provide user interface
to manage the security of the system
to manage available memory

72
Q

name different types of scheduling

A

round robin: in round robbing each process is given an even amount of time, and if a task has not been completed it goes to the back of the queue.

first come first serve: each process is run until complition

shortest job first shortest job picks the the job with the shortest amount of fde cycles and runs them till completion

73
Q

what is aploication software and give an exapmple

A

software that allows the user to perform a task or produce something

examples: web browser , spreadsheet, wotrd processor

74
Q

Lexical analysis

A

comments and white spaces are removed from the program, A symbol table is created ,the code is turned into tokens

75
Q

syntax analysis

A

checks that the code uses valid syntax

76
Q

code generation and codeoptimisation

A

code generation is when the compiler converts the ouput of syntax analysis into object code

77
Q

linkers and loaders

A

linkers are used to incorporate library code into the final program

A loader is the part of the OS responsible for loading an executable file in memory

78
Q

what is hashing?

and why use it

A

generating a value or values from a string of text using a mathematical function.

faster searching
encrypting passwords
verifying the integrity of files

79
Q
A
80
Q
A

cs (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions