Fundamentals of Computing Flashcards

(96 cards)

1
Q

What are the limiting factors of Moore’s law?

A

Microscopic sizes, as transistors get smaller, they obey the laws of quantum physics rather than conventional physics.
The more transistors, the more energy required and the more heat that needs to be dissipated.

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

What is parallel computing?

A

A collection of processing elements that cooperate to solve problems quickly

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

What is computing speed up?

A

The sequential execution time / parallel execution time

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

What is a task?

A

The function that needs to be executed

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

What is a thread?

A

A separate path of code execution and the code and computer resources necessary to compute a task

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

What’s a core?

A

A single processor before parallelization

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

What is multicore?

A

A CPU with multiple parallel cores

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

What is Multithreading?

A

A CPU with the ability to run multiple threads simultaneously

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

What is distributed computing?

A

Different computers work together to solve a common problem

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

What are the issues of distributed computing?

A

Communication (bandwidth limits)
Incomplete knowledge (not all processors have the same knowledge)
Fault tolerance (much higher chance for a CPU to fail)
Lack of global clock

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

What is a q bit?

A

look in notes

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

What is event based computing?

A

Computer doesnt trasmit data all the time, only when relevent events occur.

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

What is an operating system?

A

A collection of system programmes that control the operation of a computer

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

What is the main jobs of the OS

A

To manage hardward
To provide a user interface

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

What is a process?

A

A program that is currently executing, made of CPU instructions

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

What are the 2 types of processes?

A

The user process
The system process

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

What is the user process?

A

Started by and visible by users

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

What are system processes?

A

Processes that run in the background to manage system resources

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

What are the 5 process states?

A

New
Ready
Running
Waiting
Terminated

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

What is the new state?

A

The processes has just been created and is waitng for resources to be allocated to it

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

What is the ready state?

A

Process is ready to run

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

What is the running state?

A

The process is actively being executed

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

What is the waiting state?

A

The process is paused, while another instruction is being carried out

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

What is the terminated state?

A

The process is complete

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
What is the role of the process table?
It holds all process info, such as current state CPU scheduling allocated memoery
26
What is the role of a scheduler?
It determines what processes get CPU time
27
What is the role fo short term scheduler?
It gives the cpu a ready processes
28
What is a meduim term scheduler?
Moves inactive processes to the secondary memory
29
What is long term scheduling ?
Moves processes from the secondary memory to the ready state
30
What are the 2 main types of scheduling algorithms?
First in First Out Round Robin
31
What is FIFO algorithm?
First process in is the first one out, simples
32
What is Round Robin Scheduling?
Each processess gets a fixed amount of time, if incomplete then it returns to ready queue
33
What is a preemptive algorithm?
The OS may interrupt the process
34
What is nonpreemtive?
Process keeps cpu unless voluntarily released
35
What is deadlock?
When multiple processes are stuch waiting for each other to release resources
36
What are the 4 main causes of deadlock?
Mutual exclusion Hold and Wait No Preemption Circular Wait
37
What is mutual exclusion?
A resource can only be used by one process at a time
38
What is hold and wait?
A process hold resources while waiting for additional resources
39
What is no preemption?
Resources cant be taken away form the process
40
What is circular wait?
A cycle exists where one process is wainting for the resources held by another
41
What is memory management?
The OS allocating RAM efficiently through relocation of processes between primary and seconday memory.
42
What is best fit memory management?
Smallest possible memory space
43
What is worst fit memory management?
Assigns largest possible memory block for the largest expansion
44
What is first fit memoery management?
Assigns first available memory block
45
What is paging?
Breaking a process into fixed sized pages which are then stored in the memory
46
What is a page table?
A way of mapping the virtual memery to physical memory
47
What is file system management ?
organising, storing and retreiving data
48
Why would you use a disk instead of RAM for memeroy storage?
As RAM is volatile
49
What is the file system?
It maps a file name to a disk address
50
What is contiguous allocation?
Storing data in consevtuve blocks (blocks being multiple addresses)
51
What are the +ves and -ves of contiguous allocation?
It is fast, but is prone to fragmentation (which is wasted space)
52
What is the file allocation table (FAT)
Uses a linked list to store data in contiguous blocks
53
What is the +ves and -ves of FAT?
Each element can go anywhere, so no fragmentation but, it would take longer as it isnt consecutive
54
What aree inodes?
Contains meta-data, (size, permissions, blocks allocations)
55
What is a directory?
A file that has info about ther location of other files.
56
What is fragmentation?
When you store something and it gets deleted, the gap where the deleted memory was isnt filled.
57
What is a Database?
A multidimensional collection of data.
58
What are flatfiles?
A single dimension collection of data.
59
What is a database management system?
Translates a user command into actions on the storage systems.
60
What is tuple?
The row of the data table, representeing a ordered sequence of elements.
61
What is an attribute?
The collumn in a data table, all sharing a specific attribute.
62
What problem may you face with these data tables?
Repetition leading to redundancy and therefore storage limitations
63
How can redundancy issues be handled?
By breaking a larger table into smaller tables of different classification
64
What is datamining?
Techiniques used for discovering patterns in collections of data.
65
What is class description?
Identification of properties that are similar in a group
66
What is class discriminitaiton?
Idnetifies the differences in 2 groups
67
What is clutser analysis?
Groups raw data into classes
68
What is AI?
A field of computer science focusing on creating matchines that perform complex tasks with no human intervention
69
What is artificial narrow intelligence?
AI that can outperform humans in specific tasks
70
What is Artificial general intelligence?
AI can replace humans in all tasks
71
What is Artificial super intelligence?
Surpasses humanity in all tasks and can build upon itself.
72
What is the turing test?
A method to determine if a machine can exhibit human like intelligence
73
What are the 2 main types of ai
Expert systems Machine Learning
74
What are expert systems?
Ai that acts by following a predetermined set of instructions e.g chess
75
What is mahine learning?
Models that learn from input data
76
What is AI regression?
approxiateing data pnts witha curve for predictions
77
What is ai classification ?
Mapping data pnts to predefined classes
78
What is K-nearest?
Classifies data based on the majority class of its nearest neighbors.
79
What is Support Vector Machines?
Draws a boundary (hyperplane) between classes to maximize separation.
80
What is Atificial Neural Networks?
Inspired by biological neurons, used for regression and classification.
81
What is an issue that may be faced with SVM?
Not all data is linearly seperable
82
What are functions?
A way of modulating a program through having a set of instructions that can be used in another part of the code.
83
What does it mean to modulate a programme?
Breaking a programme into smaller parts
84
What are imperative languages?
Writing a sequence of step-by-step instructions followed by the computer.
85
What are declarative languages?
Describe the problem to the program and it solves it for you.
86
What are functional languages?
A program built by combining many functions that process data directly without storing any immediate results.
87
What are object-orientated languages?
Programs built using objects containing variables (attributes) and fns (methods).
88
What is encapsulation?
Data and methods bonded together
89
What is inheritance?
Objects inherit attributes and methods from other objects.
90
What are arrays?
A collection of data stored in a structured way
91
What are pointers?
A variable storing the memory address of another variable
92
What is a list?
An ordered collection of data with a beginning = head and end = tail
93
What is the static implementation of a list?
A contiguous list stored a block of memory consecutively in addresses.
94
What is a dynamic implementation of a list?
Uses pointers to link elements in the list making it easier to add/ remove elements.
95
What is a stack?
A list where entries are removed and inserted only at the head (FILO)
96