Create unit1.json

subjects/Computer Science/unit1.json

@@ -0,0 +1,62 @@
+[
+    {
+        "term": "Algorithm",
+        "meaning": "A set of instructions to complete a task or solve a problem"
+    },
+    {
+        "term": "Decomposition",
+        "meaning": "The process of dividing a problem into smaller, more manageable sub-problems - these sub-problems are then divided further and so on."
+    },
+    {
+        "term": "Abstraction",
+        "meaning": "The process of removing unnecessary details from a problem to focus on the important parts"
+    },
+    {
+        "term": "Pseudocode",
+        "meaning": "A notation resembling a programming language, used to describe the steps in an algorithm or the logic flow of an algorithm"
+    },
+    {
+        "term": "Flowchart",
+        "meaning": "A type of diagram using arrows and boxes, which allows the programmer to visualise an algorithm before it is turned into code."
+    },
+    {
+        "term": "Input",
+        "meaning": "The data that is sent to a program to be processed"
+    },
+    {
+        "term": "Processing",
+        "meaning": "The process of taking the input, applying an algorithm to it, and then outputting the result"
+    },
+    {
+        "term": "Output",
+        "meaning": "Anything that is sent out of a program"
+    },
+    {
+        "term": "Efficiency",
+        "meaning": "The amount of time and/or resources required to complete a task"
+    },
+    {
+        "term": "Searching Algorithm",
+        "meaning": "An algorithm that locates a specific item in a list of items"
+    },
+    {
+        "term": "Sorting Algorithm",
+        "meaning": "An algorithm that sorts a list of items into a specific order"
+    },
+    {
+        "term": "Linear search",
+        "meaning": "A searching algorithm that searches through a list of items one at a time, until the item is found"
+    },
+    {
+        "term": "Binary search",
+        "meaning": "A searching algorithm that searches through a list of items by splitting the list in half and comparing the item to be found to the item in the middle of the list"
+    },
+    {
+        "term": "Bubble sort",
+        "meaning": "A sorting algorithm that compares two items at a time and swaps them if they are in the wrong order"
+    },
+    {
+        "term": "Merge sort",
+        "meaning": "A sorting algorithm that splits a list of items into two halves and then sorts each one separately, then merges the two sorted lists back together"
+    }
+]