OpenLLM-France/wikimedia huggingface dataset:
# World War I/Powers/Belgium

Belgium's involvement in World War I began with their refusal to allow German forces to pass through Belgium to reach the French borders in order to invade. This was as part of the Schlieffen Plan, an attempt to invade Paris before allies of France could mobilize. Following this refusal, Germany invaded Belgium and attempted to push through to France anyway.
Germany then proceeded to take over 95% of Belgium, with only Ypres still under Belgian command. This occupation caused a mass evacuation, with 200,000 refugees fleeing to Britain, 300,000 refugees fleeing to France, with many of the remaining refugees fleeing to the Netherlands.
Several of the remaining inhabitants suffered "The Rape of Belgium", which occurred during this time. Germany feared that Belgium's "guerilla fighters" would retaliate to their acquisition of Germany. This resulted in several war crimes, including the execution of several innocent women and children. This incident was widely recognised as a war crime.
# World War I/Militarism
## Militarism

Natural suspicion and rivalries led to a race of armaments. Europe became on armed camp with each nation possessing a military machine ready for use. Naval rivalry strained the relations between England and Germany while the competition of land armies and armanents increased fear and hostility among all countries of Europe. It is rightly observed, that the national industry of Prussia was war.
# Yet Another Haskell Tutorial/Language advanced/Solutions
## Partial Application

Function func3 cannot be converted into point-free style. The others look something like:
You might have been tempted to try to write func2 as filter f . map, trying to eta-reduce off the g. In this case, this isn't possible. This is because the function composition operator (.) has type (b -> c) -> (a -> b) -> (a -> c). In this case, we're trying to use map as the second argument. But map takes two arguments, while (.) expects a function which takes only one.

## The Final Word on Lists

We can start out with a recursive definition:
From here, we can clearly rewrite this as:
We can write this recursively as:
This hints that we can write this as:
Now, we can do point elimination to get:
# A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Abstract data types and data structures

In Computer Science an abstract data type (ADT) is a mathematical model for a certain data types or structures. This doesn't mean that the ADTs can't be programmed, but that we must first understand them mathematically before we can implement them. ADTs are generally complex things that you have functions and procedures to interface with.
Several of the ADTs we are going to look at will be 'dynamic', this means that they can change in size at run time, taking up more or less memory depending on the what is needed
# A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Pointers

A pointer is a data type whose value refers directly to (or "points to") another value stored elsewhere in the computer memory using its address.
Pointers are incredibly important computing concepts as we need pointers to create many of the ADTs (Abstract Data Types) we are going to talk about. Some languages don't allow you to directly manipulate them, but all languages use them. For this section of the book you need to be familiar with the concept of pointers as we'll be using them heavily when we talk about linked lists, queues and stacks.
Quick examples of pointers might include the next free memory location in an array, or the location in memory that an array is stored at.
Example: Pointers
Let's take a look at how pointers are used in the C programming Language.
We are going to deal with two variables:
a
ptr
We are also going to meet two key characters:
& - where &a would return the address location of variable a
* - where *ptr = 8 means follow the memory address stored in ptr and set that location to 8
Assume that a is located at address 0x8130 in memory and ptr at 0x8134; also assume this is a 32-bit machine such that an int is 32-bits in size. The following is what would be in memory after the following code snippet is executed:
int a = 5;
int *ptr = NULL;
AddressContents
0x81300x00000005
0x81340x00000000
(The NULL pointer shown here is 0x00000000.)
By assigning the address of a to ptr:
ptr = &a;
yields the following memory values:
AddressContents
0x81300x00000005
0x81340x00008130
Then by dereferencing ptr by coding:
*ptr = 8;
the computer will take the contents of ptr (which is 0x8130), 'locate' that address, and assign 8 to that location yielding the following memory:
AddressContents
0x81300x00000008
0x81340x00008130
Clearly, accessing a will yield the value of 8 because the previous instruction modified the contents of a by way of the pointer ptr. :
* Exercise: Pointers
* Give a uses for pointers:
* Answer:
* storing next free memory addresses. Used to create abstract data types.
* What would the following output, where cout << writes a line to the screen:
* int q = 89;
* int *next = NULL;
* next = &q;
* cout << *next;
* q = 23;
* *next = 56;
* cout << q;
* Answer:
* 89
* 56
# A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Real Numbers

* Specification link : Floating Point Numbers
* Describe the format of floating point numbers, including the concept of mantissa and exponent and the need for normalisation.
* Only Two’s Complement representation of mantissa and exponent needs to be covered (IEEE standard does not need to be covered).
* Minifloat representations are not expected to be recalled.
* Floating point numbers
* Normalisation
* Specification link : Floating Point Numbers
* Explain the limitations of representing real numbers in a computer system, and how errors occur.
* Significant digits
* Precision
* Rounding errors (absolute errors, relative errors)
* Cancellation Error
* Underflow
* Overflow
# A-level Computing/AQA/Processing and Programming Techniques
## Contents

* Data Representation in Computers Questions Answers
* Machine Level Structure
* Machine Operation and Assembly Language
* Programming Concepts
* Operating Systems
# A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Simulations

One of the main uses of computers is to simulate real life scenarios. You might have made a spreadsheet at school to simulate the amount of money made by a shop, or driven a formula one car on your console at home. Some of the most powerful computers in the world are used to simulate complex phenomena including
* Financial models
* Weather
* Nuclear explosions
* Coastal erosion
If you ever watch the weather forecast all the predictions are made by software simulating weather patterns. If you ever wonder why there aren't so many nuclear tests any more, there is no need as computers can simulate what happens.

## Chaos Theory

With such powerful computers simulating models you might question why we are so bad at predicting the weather and how simulations can give the wrong results. This may be because the model being used is set up in completely the wrong way, but it may also be a result of chaos theory. Chaos theory states that any tiny differences in the initial starting conditions (such as those due to rounding errors in numerical computation) will have a huge effect on how the system performs in the long run. Rendering long-term prediction impossible in general. This can be seen in the inability of weather forecasts to get long term forecasts correct. This is also known through the butterfly effect, where Philip Merilees stated "Does the flap of a butterfly’s wings in Brazil set off a tornado in Texas?"
* Exercise: Simulations
* What is a simulation?
* Answer:
* The imitation of a process of a real system.
* Give two examples of models that are simulated
* Answer:
* Formula one racing car designs
* nuclear bomb tests
* weapons
* weather patterns
* Give one reason why simulation might not work in the long term:
* Answer:
* - The margin of error increases over time, as more variables interact with the system, causing errors and unforeseen circumstances that could enter the system, causing it to stop accurately working in the long term.
* A petrol station needs to model the number of vehicles it can serve petrol in a day. It can serve petrol and diesel and often has queues for each pump. Name the entities and attributes of each entity.
* Answer:
* Entities
* vehicle
* type
* fuel type
* fuel level
* being served
* payed
* pump
* busy
* diesel working
* petrol working
* staff
* serving
* speed of serving
# A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Trees traversal algorithms for a binary tree

* Exercise: Binary Trees
* Create a binary tree for the following data input:
* 5, 2, 6, 8, 4, 1, 9, 7, 3
* Answer:
* Sorted tree
* Create a binary tree for the following major city input:
* Monaco, Paris, Vatican, Rome, Norwich, Lewisham, New York, Partington
* Answer:
* sorted major global cities. This tree is very right heavy and if you continue Computer Science to University level you would be asked to find ways of balancing trees
# A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Programming Concepts/Binary search

Binary search locates the position of an item in a sorted array.
A quick way to remember how this search works is to imagine searching for words beginning with 'S' in a dictionary. You know that the dictionary is in alphabetical order but you don't yet know if there are any words beginning with 'S' in it, nor do you know where the 'S' section begins and ends.
| Description | Traced Alphabet |
| Open the Dictionary in the centre - you find the letter 'L' Letters before 'L' aren't any good, so ignore that part of the dictionary Taking the 'L' to 'Z' section, you split it in half and find 'P' Letters before 'P' aren't any good, so ignore that part of the dictionary Taking the 'P' to 'Z' section, you split it in half and find 'U' Letters after 'U' aren't any good, so ignore that part of the dictionary Taking the 'P' to 'U' section, you split it in half and find 'S' | abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz abcdefghijklmnopqrstuvwxyz |
how efficient is it? how many searches for x number of items? what is the equation? give an example. Why is it better than a linear search. Can you use it on ordered lists or unordered lists?
How to work out the maximum number of searches (n) on a x sized array:
For example, if we had a 3 item array
Note: This code assumes 1-based array indexing. For languages that use 0-based indexing (most modern languages), min and max should be initialized to 0 and N-1.
Note 2: The code above does not return a result, nor indicates whether the element was found or not.
Note 3: The code above will not work correctly for empty arrays, because it attempts to access an element before checking to see if min > max.
* Exercise: Linear Search
* Given a 256 item sorted list, what is the maximum number of searches needed to find an item?
* Answer:
* 9 as:
* 2^n > size of list where n = max searches
* 2^9 = 512 > 256
* Given a 1000 item sorted list, what is the maximum number of searches needed to find an item?
* Answer:
* 10 as:
* 2^n > size of list where n = max searches
* 2^10 = 1024 > 1000
# Adventist Adventurer Awards and Answers/Shapes And Sizes

* Shapes And Sizes
* Eager Beaver

## Internal Resources

Wikijunior:Shapes
vteAdventist Adventurer Awards :
# Adventist Adventurer Awards and Answers/Scavenger Hunt

* Scavenger Hunt
* Eager Beaver

## Bible Verse

But ask the animals, and they will teach you, or the birds in the sky, and they will tell you; or speak to the earth, and it will teach you, or let the fish in the sea inform you. Which of all these does not know that the hand of the Lord has done this? Job 12:7-9

## Song

My God is so big
My God is so big, so strong and so mighty
There's nothing my God cannot do for you
My God is so big, so strong and so mighty
There's nothing my God cannot do for you
He made the trees
He made the seas
He made the elephants too
My God is so big, so strong and so mighty
There's nothing my God cannot do for you (for you, for you)
My God is so great, so strong and so mighty
There's nothing my God cannot do for you
My God is so great, so strong and so mighty
There's nothing my God cannot do for you
The mountains are his
The rivers are his
The skies are his handy works too
My God is so great, so strong and so mighty
There's nothing my God cannot do for you
My God is so great, so strong and so mighty
There's nothing my God cannot do for you
For you, for you, for you

## Graphic Scavenger Hunt Bag

I saw this fun idea on Counting Coconuts and immediately set to work creating something similar for my Adventurers. We recently went on a scavenger hunt with our Adventurers and they had a blast looking for and finding the items on the list

## Find a plastic egg (or another type of container), open it and share with another Eager Beaver. (Can put grapes, raisins, candy, or whatever you like.)

vteAdventist Adventurer Awards :
# Adventist Adventurer Awards and Answers/Sewing Fun

* Sewing Fun
* Builder

## Tell what the first sewing needles were made of.

The oldest needle we know of dates back around 60,000 years ago: a human-constructed, animal (most likely bird) bone needle found in South Africa. Other needles made of bone and ivory have been discovered in Slovenia, Liaoning, China, and Russia, dating back to between 45,000 and 30,000 years ago.

## Tell what was first used as thread.

Egyptians were efficient in making threads from plant fibers and wool and hair from tamed/pet animals. At that time threads were hand spun using spindles. Even Egyptian queen Cleopatra wore the premium cotton grown in the Egyptian Nile Valley. Some scientists found 7000 years old cotton wearer from Mexico.

## State when sewing machines first came into existence.

1830
In France, the first mechanical sewing machine was patented in 1830 by tailor Barthélemy Thimonnier, whose machine used a hooked or barbed needle to produce a chain stitch.

## Make a bean bag.

https://www.thesprucecrafts.com/how-to-make-a-bean-bag-1251122

## Read the story in Acts 9:36-41 and plan a way to do something similar.

36 In Joppa there was a disciple named Tabitha (in Greek her name is Dorcas); she was always doing good and helping the poor. 37 About that time she became sick and died, and her body was washed and placed in an upstairs room. 38 Lydda was near Joppa; so when the disciples heard that Peter was in Lydda, they sent two men to him and urged him, “Please come at once!”
39 Peter went with them, and when he arrived he was taken upstairs to the room. All the widows stood around him, crying and showing him the robes and other clothing that Dorcas had made while she was still with them.
40 Peter sent them all out of the room; then he got down on his knees and prayed. Turning toward the dead woman, he said, “Tabitha, get up.” She opened her eyes, and seeing Peter she sat up. 41 He took her by the hand and helped her to her feet. Then he called for the believers, especially the widows, and presented her to them alive.
vteAdventist Adventurer Awards :
# AP Chemistry/Thermodynamics
## Kinetic Energy

Energy of an object due to the motion of the object. It is represented: $KE={\frac {1}{2}}mv^{2}.$

## Enthalpy versus Entropy

Enthalpy (H) - heat of a system. Negative enthalpy means that the temperature increases. Entropy (S) - randomness of a substance.

## Trends in Entropy

Different phases have different amount of entropy.
Generally, substances in the phases towards the beginning of the list below have lower entropy, while substances at the end of the list have high entropy.
Solid, Liquid, Aqueous, Gas
Another trend is that when there are more moles of a substance produced and the particles or the particles are more spread out, the entropy increases.
Since, S is the amount of disorder, The delta S (change in entropy) is positive if the disorder increases. The delta S is negative if the disorder decreases. The delta S can be predicted without thermodynamic values using the trends listed above. For example:
${\ce {N2 (l) -> N2 (g)}}$
This physical change would be predicted to have a positive delta S because gasses are more disordered than liquids.
Meanwhile:
${\ce {N2 (g) -> N2 (l)}}$
The reverse process would have a negatve because of amount of disorder in liquids are less than gases and Hess's law applies to entropy as well as enthalpy.
Entropy also applies to chemical processes with or without a phase change. Chemical reactions without phase changes and changes in the number of moles would have an entropy change close to zero. The same trends can be used to predict the entropy change in a chemical process.
${\ce {2H2 (g) + O2 (g) -> 2H2O (l)}}$
Since gasses are on the reactants side and liquids are on the products, the delta S of this reaction is negative. The reverse of this chemical reaction would have a positive delta S.

## Other Stuff

Specific heat capacity - number of joules of heat needed to warm 1 gram of a substance by 1K. Water's specific heat, in case you didn't remember, is 4.184J/g.
First Law of Thermodynamics = Law of Conservation of energy
Second Law of Thermodynamics = spontaneous reactions increase entropy (randomness).

## Gibb's Free Energy

$\Delta G=\Delta H-T\Delta S$, where $T$ is temperature in Kelvin. If $\Delta G$ is negative, a reaction is spontaneous. Note that some reactions are always spontaneous, some are never, and some depend on the temperature. Also, $H$ is measured in $kJ$, and $S$ in $J$.
The Basics · Periodicity · Solids and Liquids · Gasses · Reactions · Stoichometry · Thermodynamics · Solutions · Acids and Bases · Equilibrium · Electrochemistry · Nuclear Chemistry · Organic Chemistry
Constants and Equations · About the AP Exam
# AP Computer Science

This book is intended to help the reader prepare for the AP Computer Science A Exam.

## Table of Contents
### Overview

* Introduction
* About the Exam
* About Java
* Testing Java
* Object-Oriented Programming
* Additional Resources

### Basic Java Language Features

* Packages and Classes

### Standard Algorithms

* Sorting
# AP Computer Science/About

Now that you've decided to take the AP Computer Science A exam and prepare for it, it's important to learn more about the test.

## Exam Format

The AP Computer Science A exam is administered in two parts: a multiple choice section and a free response section. The first section has 40 multiple-choice questions, to be answered in 90 minutes. Because this section is multiple-choice, no partial credit is given for wrong answers. The second section gives a set of four free-response questions, each having multiple parts. Each question will give you the code for part of a program, leaving space for additional code, and each part of the question will give you instructions for what code you should write to fill the spaces left in the original program. Partial credit is given for wrong attempts and incomplete answers on this section.

## Scoring

The enterprice multiple-choice and free-response sections are each scored separately. The free-response section is given a weighted value, and both are added together to provide a raw score. This score is then compared to other scores, and a final scaled score is given between 1 and 5, with 5 being the best score. Generally, most colleges in the United States will accept a 3 as a passing score for college credit, roughly equivalent to a "C" on the A-F grading scale. Some schools may require a "4", roughly equivalent to a "B", and the most competitive universities in the nation will only accept a "5", roughly equivalent to an "A". Many schools who do not offer college credit may offer accelerated or advance placement in college-level courses for those who have taken the exam.
# A-level Computing/AQA/Paper 1/Fundamentals of databases/Entity relationship modelling

Databases will probably store data about a variety of things. For example, if we look at the tables required for an online store:
    Staff
    Products
    Receipts
    Customers
These tables could sit on their own, but when we start to describe each of them we notice that they are related to each other. For example:
    The Receipt table records which product a customer has bought, and which date it was purchased on.
This describes the Receipt record, and looking at its structure we see that the primary keys from other tables are included in it.
In other words we could say:
We can then draw this diagram like so:
To link tables together and allow for us to query a database we use relationships. There are three types of relationship that you need to know. Each is shown below using 'crows foot notation' which is one of many ways to describe these relationships:
| Diagram | Name | Description |
| An Author can write several Books, and a Book can be written by several Authors | Many to Many | An Author can write several Books, and a Book can be written by several Authors |
| A Biological Mother can have many children, and a child can have only one Biological Mother | One to Many | A Biological Mother can have many children, and a child can have only one Biological Mother |
| A Country has only Capital City, and a Capital City is in only one Country | One to One | A Country has only one Capital City, and a Capital City is in only one Country |
* Exercise: Relationships
* Describe the following relationships:
* Answer:
* An animal has one genome
* A genome describes only one animal
* Answer:
* A student has many classes
* A class has many students
* Answer:
* A league has many teams
* A team is only in one league
* Answer:
* A player answers many questions
* A question can be answered many times
* Each answer is only applicable to one question
* A player can give many answers
* Each answer has only one player contributing
* Draw the following relationships:
* A vehicle has many wheels, each wheel has one vehicle
* Answer:
* vehicle ---< wheel
* The relationship between a father and a child
* Answer:
* Father >--< Child (unless we are talking about biological fathers: Father--<Child )
* The relationship between a politician and a nose
* Answer:
* politician ---- nose
* The relationship between an owner and a cat
* Answer:
* Cat >---< Owner (even though an Owner may own more than one cat, a cat might have more than one owner)
* The relationship between a car and a driver
* Answer:
* car --- driver (a car can only be driven by one driver, a driver can only drive one car at one time)
* The relationship between a unicycle and a wheel
* Answer:
* wheel --- unicycle
* The relationship between a house and a postcode
* Answer:
* House >--- Postcode (a house is assign one postcode, but that same postcode might be assigned to many houses)