Remove pdfs

Hardware/Binary/Binary_arithmetic.md

@@ -33,7 +33,7 @@ Let's break down each column from the right:
 ### More examples to practise with
 
 ![Pasted image 20220319174839.png](../img/Pasted%20image%2020220319174839.png)
-
+![]()
 ## Binary multiplication
 
 Let's remind ourselves of how we do long multiplication within the denary number system:

Hardware/Binary/The_binary_number_system.md

@@ -17,7 +17,8 @@ When we have completed all the possible intervals between $0$ and $9$, we start
 
 The principle of counting in decimal: 
 
-![denary.gif](../img/denary.gif)
+![denary.gif](../../img/denary.gif)
+
 Thus each column is ten times larger than the previous column:
 
 * Ten \[$10^1$\] is ten times larger than one \[$10^0$\]
@@ -53,7 +54,7 @@ $$ 0001, 0010, 0011, 0100 $$
 
 Counting in binary:
 
-![binary.gif](../img/binary.gif)
+![binary.gif](../../img/binary.gif)
 
 ## Relation to Turing Machines
 
@@ -66,10 +67,12 @@ Let's convert 6 and into binary:
 If we have before us the binary place values ($1, 2, 4, 8$). We know that 6 is equal to: **1 in the two column and 1 in the 4 column → 110**
 
 More clearly:
-![Pasted image 20220319135558.png](../img/Pasted%20image%2020220319135558.png) 
+
+![](../../img/Pasted_image_20220319135558.png)
 
 And for comparison:
-![Pasted image 20220319135805.png](../img/Pasted%20image%2020220319135805.png)
+
+![](../../img/Pasted_image_20220319135805.png)
 
 Or we can express the binary as:
 
@@ -83,6 +86,6 @@ $$ 2^1 + 2^2 $$
 
 Let's convert 23 into binary:
 
-![Pasted image 20220319135823.png](../img/Pasted%20image%2020220319135823.png)
+![](../../img/Pasted_image_20220319135823.png)
 
-![binary_to_denary.gif](../img/binary_to_denary.gif)
+![](../../img/binary_to_denary.gif)

Hardware/Binary/Why_computers_use_binary.md

@@ -9,7 +9,7 @@ tags:
 The reason is straight forward: it is the simplest way on the level of pure engineering of representing numerical and logical values; both of which are the basic foundations of programming. An electronic circuit or transistor only needs to represent two states: on (1) and off (0) which corresponds to the switch on an electrical circuit.
 A single circuit representing the binary values of 1 and 0:
 
-![multi_on_off 1.gif](../img/multi_on_off%201.gif)
+![multi_on_off 1.gif](../../img/multi_on_off.gif)
 
 It would be much more complicated to have to represent ten different states under the decimal number system, although denary computers do exist.
 
@@ -18,7 +18,7 @@ It would be much more complicated to have to represent ten different states unde
 
 If we want more digits, we just need to add in more circuits, and we can represent as large a binary number as we need. We just need one switch for every digit we want to represent. The switches used in modern computers are so cheap and so small that you can literally get billions of them on a single circuit board.
 
-![multiple_circuits.gif](../img/multiple_circuits.gif)
+![multiple_circuits.gif](../../img/multiple_circuits.gif)
 
 When we use the term 'switch' we actually mean the transistor components of a circuit. We don't need to know the physical details at this level but we can say that a transistor turns a current on and off. They can also be used to amplify the current.
 

Linux/Package_management_in_Arch.md

@@ -1,13 +0,0 @@
----
-tags:
-  - Linux
-  - arch
----
-
-## Pacman, Yay
-
-|Function|Command / flag|
-|:-------|-------------:|
-|List all installed packages|`-Q`|
-|List all local installed packages|`-Qm`|
-|Remove package|`-R [package_name]`|

Theory_of_Computation/Assembly_programs.md

@@ -1,16 +0,0 @@
----
-tags:
-  - Theory_of_Computation
-  - assembly
----
-
-The Little Man was an example of a computer written in machine code → this can be very hard to easily decipher as it functions at such a low level of abstraction. For this reason there are types of programming languages called **Assembly Language**.
-
-Assembly languages are slightly higher level languages that can easily be converted into machine code. Think of them as one stage up. They are slightly easier to manage and understand. The conversion is carried out by something called an **assembler**.
-
-The table below is an example of how the LMC machine code could be converted into assembly.
-
-![Pasted image 20220319180227.png](../img/Pasted%20image%2020220319180227.png)
-
- > 
- > While Assembly is rarely used in modern computer programming, it is worthwhile spending a little time experimenting with this set of languages. Programming in Assembly can give you an appreciation for how much complexity is abstracted away by modern languages, and also what are the hardware and software limitations of modern computers. Although programmers nowadays use high-level programming languages, before computers can run them, they must be translated (or compiled) into machine code, which as you have seen is very close to Assembly.

Theory_of_Computation/Bits,_bytes,_nibbles.md

@@ -1,10 +0,0 @@
----
-tags:
-  - Theory_of_Computation
----
-
-So far, when talking about binary values we have referred to them as combinations of 1s and 0s or $2^2, 2^3$ etc.
-
-But actually there are nouns for the different groupings of binary digits:
-
-![Pasted image 20220319175450.png](../img/Pasted%20image%2020220319175450.png)