Search CSNewbs

Learn about computational methods including problem recognition, decomposition, divide and conquer, abstraction, backtracking, data mining, heuristics, performance modelling, pipelining and visualisation. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level Specification: Computer Science H446 3.1f - Standard Algorithms Watch on YouTube : Bubble sort Merge sort Insertion sort Quick sort Linear search Binary search Djisktra's algorithm A* algorithm The OCR A-Level course requires an understanding of algorithms used for sorting , searching and pathfinding including how they can be used for traversing and how to write them in pseudocode or a high-level programming langauge . Bubble Sort Bubble sort repeatedly compares adjacent items and swaps them if they are in the wrong order . Its advantage is that it is very simple to understand and easy to implement . However, it is extremely slow for large lists , with a worst- and average-case time complexity of O(n²) . It performs slightly better (O(n)) if the list is already nearly sorted and the algorithm is optimised t o detect no swaps . Overall, it is easy but inefficient . YouTube video uploading soon Merge Sort Merge sort is a divide-and-conquer algorithm that repeatedly splits a list into smaller sublists , sorts them recursively and then merges them back together . Its major benefit is that it is consistently fast with a time complexity of O(n log n) in the best , average and worst cases , making it very efficient for large datasets . It is also stable and works well with linked lists . However, a drawback is that it requires additional memory to store the temporary sublists , making its space complexity O(n) . Merge sort is therefore reliable but not memory-efficient . YouTube video uploading soon This page is under active development. Check here for the latest progress update. Insertion Sort Insertion sort works by taking each item and inserting it into the correct position in a growing sorted portion of the list . It is efficient for small or nearly sorted datasets and has a best-case complexity of O(n) , making it useful in real-time systems or hybrid algorithms . However, for large , randomly ordered datasets it becomes slow , with average- and worst-case performance of O(n²) . It uses very little memory space - (O(1) - which is one of its key benefits compared to more complex sorts like merge or quick . YouTube video uploading soon Quick Sort Quick sort is a divide-and-conquer algorithm that chooses a pivot , partitions the list into smaller elements and larger elements , and recursively sorts the partitions . Its main advantage is speed : the average-case time complexity is O(n log n) and it is often faster in practice than merge sort due to good cache performance and in-place partitioning . However, if poor pivot choices are made (e.g., always picking the first item in an already sorted list ), the worst case becomes O(n²) . Despite this, quick sort is widely used because good pivot-selection strategies minimise this risk . YouTube video uploading soon Linear Search Linear search checks each item in a list one by one until it finds the target value or reaches the end . Its benefit is that it works on any list (sorted or unsorted ) and is extremely simple to use and implement . The drawback is inefficiency for large datasets because its best , average and worst time complexity is O(n) . This means the time taken grows directly with the size of the list , making it suitable only for small collections of data . YouTube video uploading soon Binary Search Binary search repeatedly halves a sorted list to locate a target value , making it much faster than linear search . Its key benefit is efficiency : the time complexity is O(log n) for best , average and worst cases , meaning performance scales extremely well with large datasets . However, its major limitation is that the data must be sorted beforehand , and maintaining a sorted list can itself be costly . When this condition is met , binary search is one of the most efficient searching algorithms available. YouTube video uploading soon Dijkstra's Algorithm Dijkstra’s algorithm is a pathfinding algorithm used to find the shortest path from a starting node to all other nodes in a weighted graph with non-negative edge weights . It works by gradually exploring the graph , always choosing the next closest unvisited node , updating the shortest known distances to its neighbours and marking nodes as 'visited ' once the shortest path to them is confirmed . The algorithm continues until all nodes have been processed or the destination is reached , guaranteeing the shortest path . YouTube video uploading soon A* Algorithm The A* algorithm is an informed pathfinding algorithm that also finds the shortest path in a weighted graph , but it uses a heuristic (an estimate of the distance to the goal ) to guide its search more efficiently toward the target . A* combines the actual cost from the start to a node with a heuristic estimate of the remaining distance , allowing it to prioritise exploring nodes that appear more promising . YouTube video uploading soon Q uesto's K ey T erms Sorting Algorithms: bubble sort, flag, pass, merge sort, insertion sort, quick sort, pivot Seraching Algorithms: linear search, binary search, precondition Pathfinding Algorithms: Dijsktra's algorithm, A* algorithm, heuristic D id Y ou K now? Halo: Combat Evolved released on the Xbox in 2001 and introduced groundbreakingly convincing enemy AI for the time. Pathfinding algorithms were used more realistically than older games so that enemies wouldn't just run directly at the player but behaved in different ways depending on the situation , such as cooperating , flanking or retreating by reacting dynamically to the player . 3.1e - Data Structure Algorithms A-Level Topics

Learn about different types computers such a desktops, games consoles, laptops, smart speakers, smart TVs, smartphones, tablets, augmented reality (AR), virtual reality (VR) and mixed reality (MR) devices. Based on Unit F160 (Fundamentals of Application Development) for the OCR Cambridge Advanced National in Computing (H029 / H129) (AAQ - Alternative Academic Qualification). Qualification: Cambridge Advanced National in Computing (AAQ) Unit: F160: Fundamentals of Application Development Certificate: Computing: Application Development (H029 / H129) 5.1.2 - Types of Device Watch on YouTube : Types of Device Applications can be developed for a range of different devices , each type of device having its own characteristics and common uses . The characteristics of popular devices, such as laptop and tablets , may be well known, but ensure you know the difference between augmented reality ( AR ), virtual reality ( VR ) and mixed reality ( MR ) devices. Types of Device Common Devices Desktops are powerful and customisable personal computers designed for use at a desk . Game consoles are designed specifically for playing video games , usually connected to a TV . Laptops are portable computers with a built-in screen and keyboard , suitable for work on the go . Smart speakers are voice-controlled devices that play music , answer questions and can control smart home gadgets . Smart TVs have internet access , interactive features and apps for streaming and browsing . Smartphones have internet , GPS and Bluetooth connectivity , apps and communication functions . Tablets use a touchscreen larger than a phone, they are more portable than a laptop and good for browsing and media . Augmented Reality (AR ) is technology that overlays digital images or information onto the real world . Virtual Reality (VR ) uses a computer-generated 3D environment that fully immerses the user , usually with a headset . Mixed Reality (MR ) is a blend of AR and VR where digital objects interact with the real world in real time . Q uesto's Q uestions 5.1.2 - Types of Device: 1. Explain the difference between the three types of 'reality ' devices . [3 ] 2. Justify which devices a streaming service should consider for an app . [4 ] 3. Describe the characteristics of any devices not covered in your responses to Q1 and Q2 . [ 5 ] The AR app Pokémon Go was so popular when it released in 2016 that within the first 6 months players had walked a combined 8.7 billion kilometres ( 200,000 trips around the Earth ). D id Y ou K now? 5.1.1 - Human-Computer Inter. Topic List 5.2 - Visual Design Considerations

Learn about the different types of data and information sources. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification for Unit 2 (Global Information). 5.1 - Data Types & Sources Exam Board: OCR Specification: 2016 - Unit 2 Sources of Information Internal Source Information that comes from within an organisation , such as financial reports, data analysis or employee surveys. External Source Information that comes from outside of an organisation , such as government reports, financial data of competitors or price lists from suppliers. Types of Data Primary Data Data that has been created and collected by yourself or another employee within an organisation . For example, interviews or questionnaires sent within the company. Secondary Data Data that has been created and collected by someone outside of the organisation , such as national census data collected by the government or surveys taken by a competitor. Some secondary data may need to be purchased . Qualitative Data This is descriptive data , often composed of text , that can be observed but not measured . For example, survey responses where customers are asked why they visit a particular shop. Quantitative Data This is measured data , often in the form of numbers , percentages or statistics . For example, survey responses of the amount of time it takes to reach a shop. Q uesto's Q uestions 5.1 - Data Types & Sources: 1. A supermarket wants to find out how many of their customers have bought peaches this year compared to customers at a rival shop . Describe data that they could use for each of the source and data types below (e.g. stock information for peaches in the supermarket would be an internal source of information). Internal source External source Primary data Secondary data Qualitative data Quantitative data [6 ] "Why do you visit this supermarket?" 'Because it is close to home.' 'I like the easy access to parking.' 'I've always gone here.' "How many minutes does it take you to get here ?" 10 25 30 4.3 - Green IT Topic List 5.2 - Data Flow Diagrams

Learn about designing algorithms including constructing pseudocode and flowcharts. Based on the J277 OCR GCSE Computer Science specification (first taught from 2020 onwards). Exam Board: OCR 1.2: Designing Algorithms Specification: J277 Watch on YouTube : Inputs, Processes & Outputs Structure Diagrams Pseudocode Flowcharts Writing Code in Exams Trace Tables What is an algorithm? An algorithm is a set of instructions , presented in a logical sequence . In an exam you may be asked to read and understand an algorithm that has been written. To prove your understanding you may be asked to respond by actions such as listing the outputs of the algorithm, correcting errors or identifying an error within it. Programmers create algorithm designs as a method of planning a program before writing any code. This helps them to consider the potential problems of the program and makes it easier to start creating source code. There are two main methods of defining algorithms are pseudocode and flowcharts . In exams , OCR will display algorithms in their own 'OCR Exam Reference Language '. Visit the Python section of CSNewbs ---> OCR Exam Reference Language Below is a list of all of the code concepts from the OCR J277 GCSE specification that you need to know , presented in OCR Exam Reference Language (OCR ERL ), which is how code will be presented in the paper two exam . The code below is NOT Python . There are several differences between OCR ERL and real high-level languages like Python or Java , especially in the 'String Handling ' section and with for loops . In an exam, you can write in OCR ERL or a programming language you have learnt. All code-related videos in the CSNewbs YouTube series for Paper 2 show both OCR ERL and Python side-by-side . Basic Commands Annotation // Comments are written using two slashes Assignment name = "Harold" age = 49 Constants and Global Variables constant tax = 15 global name = "Admin" Input / Output name = input ( "Enter your name") print ("Transaction Complete") Casting str (29) int ("102") float (30) bool ("False") Random Number number = random (1,100) Selection Selection (if - then - else) if firstname == "Steven" then print("Hello" + firstname) elif firstname == "Steve" then print("Please use full name") else print("Who are you?") end if Selection (case select) switch day: case “Sat”: print(“It is Saturday”) case “Sun”: print(“It is Sunday”) default : print(“It is a Weekday”) endswitch Iteration Iteration (for loop) for i = 1 to 10 step 1 input item next i Iteration (while loop) while firstname ! = "Steven" firstname = input("Try again:") endwhile Iteration (do while loop) do firstname = input("Guess name:") until firstname == "Steven" String Handling Length of a String word = "dictionary" print(word.length ) outputs 10 Substrings word = "dinosaurs" print(word.substring (2,3)) outputs nos print(word.left (3)) outputs din print(word.right (4)) outputs aurs Concatenation name = "Penelope" surname = "Sunflower" print(name + surname) String Cases phrase = "The Cat Sat On The Mat" print(phrase .lower ) print(phrase .upper ) ASCII Conversion ASC ("C") returns 67 CHR (100) r eturns "d" File Handling File Handling - Reading Lines file1 = open ("Customers.txt") while NOT file1.endOfFile() print(file1.readLine() ) endwhile file1.close() File Handling - Writing to a (New) File newFile ("paint.txt") file2 = open ("paint.txt") paint = input("Enter a paint colour:") file.writeLine (paint) file2.close() Arrays Declare Array array names[3] array names = "Ella", "Sam", "Ali" Declare 2D Array array grid[4,5] Assign Values names[2] = "Samantha" grid[1,3] = "X" More Programming Keywords Connecting strings together using the + symbol is called concatenation . Extracting certain parts of a string (e.g. using .substring() ) is called slicing . An if statement within an if statement or a loop within a loop is called nesting . Flowcharts A flowchart can be used to visually represent an algorithm. It is more likely you will need to be able to interpret a flowchart rather than draw one. The flowchart symbols are: The terminator symbol is also known as a terminal . Algorithm Examples Below are two different methods for representing the same algorithm - a program to encourage people to buy items cheaply at a supermarket. The program allows the price of items in a supermarket to be entered until the total reaches 100. The total price and the number of items entered are tracked as the program loops. Once the total reaches 100 or more, an if statement checks how many items have been entered and a different message is printed if there are 20 or more items, 30 or more items or less than 20 items. Pseudocode // This is a program to see how many items you can buy in a supermarket before you spend over £100} total = 0 itemsentered = 0 while total < 100 itemprice = input ("enter the price of the next item") total = total + itemprice itemsentered = itemsentered + 1 endwhile if itemsentered >= 20 then print ("You are on your way to saving money.") elif itemsentered => 30 then print ("You're a real money saver.") else print ("Look for better deals next time.") endif Flowchart Reading Algorithms In an exam you may be asked to read an algorithm and prove your understanding , most commonly by listing the outputs . Start from the first line and follow the program line by line , recording the value of variables as you go . When you encounter a for loop , repeat the indented code as many times as stated in the range . Example Algorithm: procedure NewProgram() maxvalue = input() for i = 1 to maxvalue output (i * i) ??????? print("program finished") endprocedure Example Questions: 1. List the outputs produced by the algorithm if the 'maxvalue' input is 5 . 2. State the code that has been replaced by '???????' and what the code's purpose is. Example Answers: 1. Outputs: 1 4 9 16 25 program finished 2. Missing Code: next i Purpose: Moves the loop to the next iteration. Watch on YouTube Structure Diagrams Structure diagrams display the organisation (structure ) of a problem in a visual format , showing the subsections to a problem and how they link to other subsections . The noughts and crosses structure diagram below has subsections in light yellow. Each subsection could be coded by a different person . Structure diagrams are different to flowcharts (those show how data is input, processed and output within a program or system). You may be asked in an exam to draw or fill in a simple structure diagram . Trace Tables Trace tables are used to track the value of variables as a program is run . They can be used to manually track the values in order to investigate why the program isn't working as intended . Each row in the trace table represents another iteration . Each column stores the value of a variable as it changes. See below how the trace table is updated for the simple algorithm on the left. num1 = 2 num2 = 5 for i = 1 to 3 output (num1 + num2) num2 = num2 - 1 next i print("complete") For most algorithms, not every variable will be updated in each iteration . Values may not be entered in the order of the trace table either. For example, each iteration outputs num1 + num2 and then decreases the value of num2 by 1. Q uesto's Q uestions 1.2 - Designing Algorithms: 1. What is the definition of an algorithm ? Name two ways an algorithm can be designed . [ 3 ] 2. Using a high-level programming language such as Python , or the OCR Exam Reference Language , write an algorithm that inputs 6 decimal numbers and outputs the total , largest , smallest and average values. [ 8 ] For example, entering 3.1 , 5.3 , 2.3 , 5.4 , 2.9 and 4.4 would output 23.3 (total), 5.4 (largest), 2.3 (smallest) and 3.9 (average). 3. Draw and label the flowchart symbols . [ 6 ] 4. What is the purpose of a structure diagram ? [ 2 ] 5. Create a trace table for the NewProgram() algorithm in the Reading Algorithms section on this page. [ 7 ] 1.1 - Computational Thinking Theory Topics 1.3 - Searching & Sorting

Learn how to use the style tags in an HTML document to edit the background colour and font text and colour. 9. Style (Colours & Fonts) HTML Guide Watch on YouTube: Before you add any colours or font styles, you need to add tags. The style tags must be written within your head of your HTML document! Add them below your title tags: Add the

Learn how to embed images into your HTML web page using the img tag. Learn how to resize an image to your desired width and height. 5. Images HTML Guide Watch on YouTube: Images can be added to your web page to make it more visual. The guide below shows you how to find a picture online, download it and place it in your web page. Find & Save the Image Firstly you can perform a Google Image search to find a picture that you like. As an ethical Computer Scientist, you should be searching for copyright free images. Click on Tools and then Usage Rights to change it to 'Labeled for reuse'. Choose an appropriate image and download it to the same folder as your html file. Save the image in the same folder as where your HTML file is saved . If you don't do this, your image won't work . If you are using a school computer and the image automatically downloads , without giving you the option to rename it and save it, click on 'Show in folder' and move it to the folder where your HTML file is . Make sure that the image is saved in the exact same folder as your HTML file and that is has a suitable name . Create the Image Tag The tag for images does not have an end tag - it is all written within one set of angle brackets. src stands for source . You must type the image exactly as it is saved , including the file type (e.g. .jpg or .png). Don't forget the speech marks either. Create the img tag, using the exact name of the image you downloaded. Change the Image Size You can directly state the width and height of the image by defining the style within the image tag. If your image is too large or too small, change the size of it yourself. Next it is time to organise the web page further so it looks more like a professional site. 4. Hyperlinks HTML Guide 6. Organisation

Explains the components of the CPU, the different registers, buses, how the FDE cycle works, CPU performance factors, pipelining, Von Neumann architecture and Harvard architecture. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level 1.1 - Structure and Function of the Processor Specification: Computer Science H446 Watch on YouTube : CPU components Registers Buses The FDE cycle CPU performance Pipelining Von Neumann vs Harvard Contemporary architecture The Central Processing Unit ( CPU ) is the most important component in every computer system. The purpose of the CPU is to process data and instructions by constantly repeating the fetch-decode-execute cycle . In this cycle, instructions are fetched from RAM and transferred into the registers of the CPU to be decoded and executed . CPU Components The CPU has three key components : The control unit directs the flow of data and instructions inside the CPU and manages the FDE cycle , especially decoding instructions . The arithmetic logic unit ( ALU ) performs all arithmetic calculations and logical operations inside the CPU . Registers are small , ultra-fast storage locations that temporarily hold data , instructions or addresses during processing . The CPU also contains cache memory , which is temporary storage space for frequently accessed data . Registers A register is a small storage space for temporary data , instructions or addresses in the CPU . Each register has a specific role in the FDE cycle : The Program Counter ( PC ) stores the memory address of the next instruction to be fetched from RAM . The Memory Address Register ( MAR ) stores the memory address currently being accessed , which may be an instruction or data . The Memory Data Register ( MDR ) stores the data that is transferred from RAM to the CPU . The Current Instruction Register ( CIR ) stores the instruction that has been fetched from RAM . The Accumulator ( ACC ) stores data currently being processed and the result of calculations or logical operations made by the ALU . Buses Data and signals are transmitted between components across internal connections called buses . There are three types of computer bus : The data bus transmits data and instructions between the CPU , memory and other components such as input/output devices . It is bidirectional (data is sent both ways ). The address bus transmits the location in memory that the CPU is accessing . It is unidirectional (one-way ) from the CPU to RAM . The control bus transmits control signals (e.g. 'read ' or 'write ') from the CPU to coordinate other components . It is bidirectional . The FDE Cycle In the Fetch Decode Execute (FDE ) cycle , instructions are fetched from RAM , then decoded (understood) and executed (processed) in the CPU . This cycle is performed by the CPU millions of times every second using the registers and buses explained above. This cycle is how the CPU processes data and instructions for each program or service that requires its attention . CPU Performance The performance of the CPU is affected by three main factors : Clock speed is t he number of cycles per second , so a higher clock speed means more instructions can be executed per second . The number of cores is important as more cores allow a CPU to carry out multiple instructions simultaneously , improving multitasking and parallel processing . Cache memory is small and very fast memory inside the CPU that stores frequently used instructions , reducing the time needed to access RAM . Pipelining Pipelining is the concurrent processing of multiple instructions . An instruction can be fetched while another is decoded and another is executed . This overlapping of instructions increases the overall speed of program execution . Computer Architecture Computer architecture refers to the design and organisation of a system’s components and how they interact . There are two types of architecture to know: Von Neumann architecture uses a single main memory (RAM ) that stores both program instructions and data . This means instructions and data travel along the same buses , which can cause a bottleneck (congestion ). Harvard architecture separates the storage of program instructions and data into two different memory locations . This allows instructions and data to be fetched at the same time , improving performance . You also need to know about c ontemporary (modern) architecture , which includes features such as onboard ( integrated ) graphics , performance boosting mode , out-of-order execution and virtual cores . Q uesto's K ey T erms Components of the CPU: control unit (CU), arithmetic logic unit (ALU), registers, cache memory Registers: program counter (PC), memory address register (MAR), memory data register (MAR), current instruction register ( CIR), accumulator (ACC) Buses: data bus, address bus, control bus, unidirectional, bidirectional FDE Cycle: fetch stage, decode stage, execute stage CPU Performance: clock speed , number of cores , cache memory Pipelining: pipelining Computer architecture: Von Neumann, Harvard, contemporary D id Y ou K now? The Apollo Guidance Computer ( AGC ) for NASA's Apollo 11 mission , when humans first set foot on the moon , had a CPU clock speed of about 1 megahertz - slower than many GCSE-level calculators used today. A-Level Topics 1.2 - Types of Processor

Learn about the different parts of computational thinking including thinking abstractly, ahead, procedurally, logically and concurrently. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level Specification: Computer Science H446 1.1 - Computational Thinking Watch on YouTube : Thinking Abstractly Thinking Ahead Thinking Procedurally Thinking Logically Thinking Concurrently Computational thinking is the process of approaching and solving problems in a logical , systematic way (like a computer would ) using techniques such as abstraction , decomposition , pattern recognition and algorithmic thinking . There are five categories of computational thinking you need to know. Thinking Abstractly Abstraction is the process of removing unnecessary detail so that a problem can be represented more simply . It helps programmers focus on the essential features of a task, reducing complexity and making solutions easier to design , understand and maintain . When programming , abstraction can be applied by simplifying real-world systems into models that contain only the information needed for solving the problem . Because abstractions leave out certain details , they always differ from reality , and it is important to understand which elements have been included , which have been excluded and why . YouTube video uploading soon Thinking Ahead Programs often make use of inputs and outputs to receive data from the user or another system and then return results or feedback. Many programs rely on preconditions - rules or requirements that must be met before a function or procedure runs correctly - to prevent errors and ensure reliable behaviour . Caching is a technique where previously calculated or frequently accessed data is stored temporarily so it can be retrieved more quickly . This improves performance but can use extra memory and risks becoming outdated if the cached data no longer matches the current state . Reusable program components , such as functions , procedures and modules , are important because they reduce duplication , make programs easier to maintain , and allow well-tested code to be used across multiple solutions . YouTube video uploading soon Thinking Procedurally Pseudocode , program code and flowcharts are ways of representing a sequence of steps in an algorithm , showing clearly the order in which instructions should be carried out . Sub-procedures (such as functions and procedures ) are used in programs to break complex tasks into smaller , reusable parts , making the code easier to understand , test , maintain and debug . A structure diagram is a visual representation that shows how a program is broken down into its main components and sub-components , helping programmers plan the overall design and understand how different parts of the program fit together . YouTube video uploading soon Thinking Logically Decisions are needed in computer programs so that the software can choose different actions based on the data it receives or the situation it is in , rather than always following the same sequence of instructions. These decisions are controlled by logical conditions - statements that evaluate to true or false - which determine which path the program will take; for example, if score > 100 might trigger a bonus feature only when the condition is true . Because decisions allow the program to branch , they directly affect the flow of execution , enabling different outcomes , repeated actions or alternative processes depending on the conditions met . YouTube video uploading soon Thinking Concurrently Concurrency means designing a program so that multiple tasks can be processed at the same time , rather than strictly one after another. Programmers need to identify which parts of a program can safely run concurrently - for example, independent calculations or background tasks - and which parts must wait for others to finish because they rely on shared data or sequential results . Concurrent processing can bring benefits such as faster performance , better use of multicore processors and improved responsiveness , but it also introduces drawbacks, including increased complexity and the need for careful coordination to avoid errors when tasks depend on one another . YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Computational Thinking: abstraction, thinking abstractly, thinking ahead, precondition, caching, reusable components, thinking procedurally, thinking logically, concurrency, thinking concurrently D id Y ou K now? Building a Lego set is a great example of both abstraction and decompostition . For example, the Eiffel Tower Lego set is an abstracted version of it is real-life counterpart condensed into 10,001 pieces . There are over 75 numbered bags inside the box to follow instructions step-by-step to construct the 4'11" model . A-Level Topics 2.1 - Programming Techniques

Learn about the advantages and disadvantages of different types of software including open-source, closed-source, off-the-shelf and bespoke. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification. 2.1: Software Types Exam Board: OCR Specification: 2016 - Unit 1 Software refers to the programs and applications that run on a computer system. Open Source Software Source code is the software code written by programmers . If the software is open source it means that users can view and modify the code . Linux, Python and Firefox are examples of open source software. Benefits Drawbacks Because the source code is available to edit , it can be customised to the organisation's needs . Often shared in the public domain so users can work together to modify, debug and improve a product. Unwanted features can be removed to make the software run faster . There are security risks - some editors may add malicious code to the program. Open source software is often low in price and sometimes free. It may be difficult to receive support as development is often distributed between people in different locations. The code may be prone to errors as it may not have been tested fully. It requires technical skills to be able to adapt source code efficiently and to maintain the code . Closed Source Software If the software is closed source it means the code is restricted for users to view or modify . You buy the right to use the software but you don't actually own it. Microsoft Office, Fortnite and Spotify are examples of closed source software. Closed source software is also known as proprietary software because it is another company's property and protected by law. Benefits Drawbacks The code is well tested and has been professionally developed. Updates will generally be secure . Users must rely on the company to provide updates and fix issues. This might be infrequent or stop completely. The company can be held to account if it does not perform as listed in the terms and conditions upon purchase. Often not free (see Freeware below for free closed source software). Most developers will provide some form of help/support . Users cannot modify, debug or improve the code for their own benefit. Off-the-Shelf Software This is any software made for general use , with features that can be used in different ways and for different purposes . Examples include office software (e.g. Microsoft Office), video games (e.g. Minecraft) and image editors (e.g. Adobe PhotoShop). Back before internet downloads, people had to actually go to shops and buy software off the shelf and install it at home, hence the name. Benefits Drawbacks Should have been tested thoroughly so users can be confident that features will work as expected . Secure updates will be regular. It can be expensive to purchase some software , especially for a single user rather than a business. Some software, such as anti-virus protection, requires yearly licenses . It can be cheaper to purchase than bespoke software as it is not customised for a specific user or organisation. The software may contain additional features that the user / organisation doesn’t need which can reduce the performance of the system. The end users might be familiar with the software and trust the company (e.g. Microsoft Word). Bespoke Software This is any software that has been custom made for a specific organisation or user. For example, programmers might be hired by a company to create software for a specific task. Hospitals and schools use bespoke software to track and manage patients / students. It can be expensive to commission bespoke software as programmers and user interface designers need to be hired and there could be issues with rights to any created software. Benefits Drawbacks The software is built to the company's requirements , it is unique to their needs. Unwanted features can be removed to make the software run faster . Bespoke software is expensive to develop because it is tailor-made for the company. Staff may require training on using the system because it is unique . The look of the software (e.g. design & layout ) can be customised to fit the company's image. Because it has been custom-made, the original programmers may be needed to maintain the software and fix errors . Shareware This software allows the user to trial the program for a limited time before forcing them to buy the product or stop using it. For example, WinRAR is utility software that asks the user to buy the full version after 40 days. This allows the user to get a taste of what the software offers before choosing whether to buy it fully or not . Freeware This is software that is freely available to download and use . These are usually closed-source software that earn money through adverts or additional purchases. Rights to the software remain with the author despite the free access. App developers may release their app as freeware to allow users to try the software and then encourage them to purchase a full version with more features. Unlike shareware, the user should be able to keep using the product for free indefinitely, though their version may have features restricted or adverts enabled. Examples of freeware software include iTunes , Clash of Clans and Adobe Acrobat Reader (for PDFs). Embedded Software An embedded system is when a smaller computer system is installed within a larger device , such as a washing machine, traffic light or car. Embedded systems have a dedicated purpose and often run in real-time . Because of the small size, the embedded software will usually have memory and storage restrictions . Q uesto's Q uestions 2.1 - Software Types: 1. Describe the 7 types of software , listing the advantages and disadvantages of each. a. Open Source b. Closed Source c. Off-the-Shelf d. Bespoke e. Shareware f. Freeware g. Embedded [6 each ] 1.8 & 1.9 - Number Systems Topic List 2.2 - Applications Software

Learn about the technical difference between data and information, with examples. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification for Unit 2 (Global Information). 3.1 - Data vs. Information Exam Board: OCR Specification: 2016 - Unit 2 The terms 'data ' and 'information ' are often used interchangeably but they do not mean the same thing . The term 'data ' refers to unprocessed facts or statistics that have no context . For example, 53% is data - it is a statistic that has no context. The term 'information ' refers to data that has been processed , organised and structured into context . For example, 53% of pumpkin stock was sold in 2019 is information - it is data that has been given context (meaning). Data Processing Information Q uesto's Q uestions 3.1 - Data vs. Information: 1. Describe , using examples , the difference between data and information . [4 ] 2.4 - Information Management 3.2 & 3.3 - Information Categories Topic List

Learn about security threats, including botnets and DDoS attacks and both physical and digital security mitigations. Resources based on Unit F161 (Developing Application Software) for the OCR Cambridge Advanced Nationals in Computing (H029 / H129) AAQ (Alternative Academic Qualification). Qualification: Cambridge Advanced Nationals in Computing (AAQ) Certificate: Computing: Application Development (H029 / H129) Unit: F161: Developing Application Software 4.1 - Security Considerations Watch on YouTube : Security threats Physical security Digital security You need to know the risks that specific security threats pose to applications , including botnets , DDoS attacks , hacking and malware . You need to know how both physical security mitigations (e.g. biometrics , locks and RFID ) and digital security mitigations (e.g. encryption , firewalls and anti-malware ) protect application software against threats . What You Need to Know Security Threats ? YouTube video uploading soon Physical Security Mitigations ? YouTube video uploading soon Digital Security Mitigations ? YouTube video uploading soon Q uesto's Q uestions 4.1 - Security Considerations: 1. What? [2 ] 2. What? [1 ] 3. What? [1 ] 4. What? [1 ] ? D id Y ou K now? 3.2 - Protocols Topic List 5.1 - Testing

Learn about 11 key attributes that a respected and successful member of staff should develop in a work environment. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification. 4.3 - Personal Attributes Exam Board: OCR Specification: 2016 - Unit 1 Any employee in an organisation must demonstrate positive qualities that makes them a useful worker . The following are some of the key attributes that a successful employee of an IT organisation should have. Self-motivation: Workers must be able to motivate themselves to produce high-quality work . They must arrive to work willing to face new challenges and retain a good attitude even when faced with difficulties. Leadership: Managers must show good leadership skills by respecting members of their team so that they are motivated and produce good work. A leader must delegate tasks and take responsibility for negative outcomes. Respect: Respect must be shown at all times to other members of staff and to customers . Employees should be polite and patient when dealing with requests and uphold the company's values . Dependability: Managers must be able to depend on their employees to complete work to the best of their ability and complete it on time . Employees should also be trustworthy and reliable to work on tasks independently. Punctuality: Arriving to work on time is important and shows a commitment to your job . Employees must show up on time to meetings and scheduled events so they don't miss out or upset others. Problem Solving: An employee must be able to look at a problem from different angles and perspectives in order to solve it. Workers must use logic and learn from previous mistakes . Determination: Workers should be focused on their job role and not give up on challenging tasks. Workers must be prepared to work on a dedicated task until it is fully completed . Independence: Workers should be able to work alone on tasks and not rely on other members of staff . They should be confident in finding a solution to a problem independently. Time Management: Most tasks will have a deadline and it is the worker or team's responsibility to ensure all work is completed before that date. Workers must be organised and plan ahead in case of unforeseen circumstances. Team Working: Most modern IT jobs involve group work , either within the office or using online communication across different sites. Workers must cooperate with their peers, share ideas and work together to complete tasks on time. Numerical Skills: Maths skills are required in IT jobs to ensure that jobs are completed accurately and within the budget . Workers may use calculators or spreadsheets to prevent mistakes. Verbal Skills: Spoken communication is a huge part of most jobs, whether that be face-to-face , on the phone or through video calls . Workers must be polite to customers and respectful to co-workers , using appropriate language at all times. Planning & Organisation: To ensure all deadlines are met , teams must carefully plan who will complete each task and by when. Companies must be well organised so that departments can work together and share information when necessary. Q uesto's Q uestions 4.3 - Personal Attributes: The Job Roles section (4.5 ) may help you answer these questions. 1. A games company are looking to hire a new manager to oversee the development of their next video game. Describe 4 personal attributes that the manager should have. [10 ] 2. A software company that develops web browsers is hiring a new programmer . Describe 4 personal attributes that the programmer should have. You must not describe the same attributes as Q1 . [10 ] 3. An animator is required at a large design and movie production studio. Describe 4 personal attributes that the animator should have. You must not describe the same attributes as Q1 or Q2 . [10 ] 4.2 - Communication Technology Topic List 4.4 - Ready for Work