Homepage for learning about computer science in school. Discover topics across GCSE and Level 3 IT subjects, plus programming languages including Python, HTML and Greenfoot. C omputer S cience P ros Official 2026 CSPros: Henry C Rohan Finlay Adam Chantel Olivia Jessie Kelvin Lucas Gajanan Danny Marcus José Claudia Charlie Ryan Harry Ethan Henry P Yash Marcus Thomas Walter Folu Asher Pippa Zach Leighton Jess James Holly Zac Ryan 2025 CSPros: Jack Harry Aarav Trisha Mario Hiba Rory Clark Lucy Divya Luke Callum James Zoya Timucin Matthew 2024 CSPros: 2023 CSPros: Henry Zain Iman Alex I-C Alex B Tomos Aidan Rahul Hussain Diyar Sam Harry Will Alex H 2022 CSPros: Logan Eleanor Mark Edward Alfie Henry Enzo Sam George Harry Ella Kav

Learn about the advantages and disadvantages to individuals and organisations when using the internet. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification for Unit 2 (Global Information). 1.7 & 1.8 - Internet Pros & Cons Exam Board: OCR Specification: 2016 - Unit 2 The internet has become easier and cheaper to access since the mid 1990s and today it is almost taken for granted. The rise of the internet, and the services it provides, has lead to advantages and disadvantages for both individuals and organisations . Advantages for Individuals Increased speed of personal communication Allows for instant messaging, emails and video chats across the world. Easy access to information The internet has free resources such as CSNewbs and Wikipedia, plus academic journals for research & study. 24/7 access to services Shopping, browsing and banking can be completed when convenient for the user. Social interaction with others Social media, discussion forums and online games provide entertainment and social interaction. Disadvantages for Individuals Potential for identity theft Uploading personal data and storing sensitive information risks hackers obtaining and utilising it. Cost of connection & services Internet service providers (ISPs) charge a monthly fee and equipment like a router needs installation. Cyberbullying & trolling The abuse of others on social media is possible. Anonymisation makes it harder to catch offenders. Spreading misinformation 'Fake news' or biased information can be easily spread on social media and lead to incorrect assumptions. Source of distraction Staff and students may neglect their work and study for entertainment or social media. Advantages for Organisations Share data quickly globally Files and information can be sent instantly to locations across the world. Cloud storage can store data. Online services always available E-commerce businesses can operate 24/7 globally, permit users to browse and accept payments. Easy internal communication Staff can use emails, video calls or instant messages to communicate. Open up the workplace Staff can work from home, on the commute to/from work and outside of the office. Disadvantages for Organisations Malicious attacks & threats Websites can be hacked / taken offline with DDoS attacks. Data can be stolen or corrupted. Cost of maintaining services Most companies require an IT department to oversee device installation and maintenance. Reputation and controversies Companies that leak data will damage their reputations. Social media posts could backfire. Q uesto's Q uestions 1.7 - Internet Pros & Cons: 1. List 5 points for the following categories (you may need to include researched / your own points for some): a. Advantages of the internet for individuals [5 ] b. Disadvantages of the internet for individuals [5 ] c. Advantages of the internet for organisations [5 ] d. Disadvantages of the internet for organisations [5 ] 1.6 - Information Formats Topic List 2.1 - Information Styles

Learn about the four network topology types - bus, ring, star and mesh - plus advantages and disadvantages of each. Based on the 2020 Eduqas (WJEC) GCSE specification. 3.3: Network Topology Exam Board: Eduqas Specification: 2020 What is a network topology? Network topology refers to layout of computer systems on a network . Devices in a network topology diagram are often called 'nodes' . What are the different types of network topology? Bus Topology The nodes are connected to a bus (a central cable along which all data is transferred across the network). How it works: Data packets are sent along the main cable (sometimes known as the 'backbone') from the source computer to each other system in turn . Each system checks the destination address of the data packets. If the addresses match then the data is accepted otherwise it is passed on to the next system. Terminators are required at both ends of the bus to mark the end of the cable. Advantages: Because of the simple layout, it is easy to attach another system to the main cable without disrupting the whole network . A bus topology is quick to set up once the main cable has been established making it optimal for temporary networks . A bus topology is cost-effective because it usually contains less cabling than other topologies and requires no additional hardware (like a hub or switch). Disadvantages: Poor security as data packets are passed on to each system on the network. Data collisions are likely - this is when two systems attempt to transfer data on the same line at the exact same time. Resending the data wastes time and slows down the network . The main cable will only have a limited length which can become crowded and slows the network speed as more systems are attached. The main cable must also be terminated properly . Ring Topology Computer systems are connected together in a single loop . How it works: Packets are transferred around the ring in one direction , passing from one computer system to the next in a loop . As the packets arrive at each computer system, the computer checks the destination address contained in the data packet to see if it matches its own address. If the addresses match the computer accepts and processes the data packet, otherwise it passes it on to the next system. Advantages: Data collisions are avoided as data packets are transmitted in one direction around the ring. Attaching more systems to a ring topology won't affect the transfer speed (bandwidth ) as much as other layouts like a bus topology because the data is transferred at a consistent speed . Disadvantages: If any system on the network fails then the whole network fails as the loop is broken and data can't be transferred to all systems. To add a new system to a ring topology the network must be temporarily shut down . Star Topology Each computer system is connected to a central device , usually a hub or switch . How it works: Each computer system is connected to the central hub or switch and transfers its data packets there. The hub or switch looks at the destination address and transfers the packets directly to the intended computer. Advantages: A star topology has improved security because data packets are sent directly to and from the hub / switch in the centre and not necessarily all devices like in a bus or ring topology. New systems can be attached directly to the central system so the network doesn't need to be shut down . System failures of attached computers won't usually cause complete network failure. Transfer speeds are generally fast in a star topology as there are minimal network collisions . Disadvantages: Extra hardware (the hub or switch) is required to be purchased, installed and maintained. If the central system (the hub or switch) fails then the whole network will be unusable until the error is fixed. Mesh Topology In a full mesh network, each computer system is connected to every other computer system . There is also a partial mesh network where only some nodes (e.g. a printer) are connected to every other node. How it works: Data packets are transferred to the destination address along the quickest path , travelling from node to node. If a pathway is broken , there are many alternative paths that the packets can take. Advantages: If one cable or system fails then data packets can take an alternative route and still reach the destination address. Because of the large possible number of systems and connections, a mesh topology can usually withstand large amounts of data traffic . New systems can be added to the network without disrupting the entire topology . Disadvantages: Because of the possibly large amount of cables required (especially in a full mesh topology) this network layout can be expensive to install and maintain . Redundant cabling should be avoided - this is when cables are connected between systems that won't ever need to communicate . Q uesto's Q uestions 3.3 - Network Topology: 1. Draw and label diagrams of all four topologies . [12 ] 2a. A school currently uses a bus topology but is considering changing to a ring topology . Describe two advantages and two disadvantages of both topologies. [ 8 ] 2b. An office currently uses a star topology but is considering changing to a mesh topology . Describe two advantages and two disadvantages of both topologies. [ 8 ] 3.2 - Data Packets & Switching Theory Topics 3.4 - Network Hardware & Routing

Learn about algorithms for data structures such as stacks, queues, linked lists and trees, as well as how to traverse trees with depth-first and breadth-first traversal methods. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level Specification: Computer Science H446 3.1e - Data Structure Algorithms Watch on YouTube : Stacks Queues Linked Lists Trees Tree traversal Being able to read , trace and write code for data structure algorithms (stacks , queues , linked lists and trees ) is vital. Stacks A stack stores data in a last in , first out (LIFO ) order, meaning the most recently added item is the first one to be removed . It works much like a stack of plates - you can only add or remove from the top . Two integral functions are push and pop . The push operation adds (or “pushes”) a new item onto the top of the stack . The pop operation removes (or “pops”) the item from the top of the stack . Stacks are commonly used in undo features , function calls and expression evaluation , where tracking the most recent item first is important . YouTube video uploading soon Queues A queue stores items in a first in , first out (FIFO ) order, meaning the first item added is the first one removed . New items are added at the rear of the queue using an enqueue operation, and items are removed from the front using a dequeue operation. Queues are often used in task scheduling , print spooling and data buffering , where operations must occur in the same order they were requested . YouTube video uploading soon Linked Lists A linked list is a dynamic data structure made up of a series of elements called nodes , where each node contains data and a pointer to the next node in the sequence . Unlike arrays, linked lists do not store elements in contiguous memory locations , making it easy to insert or delete items without having to shift other elements . The head is the first node in the list , and the last node usually points to null , indicating the end of the list . YouTube video uploading soon Trees A tree is a hierarchical data structure made up of nodes connected by branches , starting from a single root node . Each node can have child nodes , and nodes without children are called leaf nodes . Trees are useful for representing data with natural hierarchies , such as file systems or organisational charts . A binary search tree is a special type of tree where each node has at most two children - a left and a right . All values in the left subtree are smaller than the parent node , and all values in the right subtree are larger . This structure allows for efficient searching , insertion and deletion of data , often much faster than in lists or arrays . YouTube video uploading soon Tree Traversal 'Tree traversal ' refers to the method used to visit every node in a tree data structure in a specific , organised order . Depth-first (also called post-order ) traversal explores a tree by moving as far down one branch as possible before backtracking , visiting nodes in a deep , top-to-bottom manner . It uses a stack to keep track of nodes still to explore , pushing new branches onto the stack and popping them when backtracking . Breadth-first traversal explores the tree level by level , visiting all nodes on one level before moving down to the next . It uses a queue to hold nodes in the order they should be visited , ensuring the traversal expands outward evenly from the root . YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Stacks and Queues: stack, queue, last in first out (LIFO), first in first out (FIFO), push, pop, enqueue, dequeue, pointer Linked Lists: linked list, null Trees: tree, binary tree, binary search tree, root node, branch, depth-first traversal, breadth-first traversal D id Y ou K now? Spotify playlists work like linked lists because each song links to the next , allowing tracks to be added , removed or reordered instantly without reshuffling the whole playlist. This makes the app fast and efficient even when handling huge playlists with thousands of songs . 3.1a-d - Algorithm Complexity A-Level Topics 3.1f - Standard Algorithms

A simple Little Man Computer (LMC) editor. Perfect for students learning A-Level Computer Science in UK schools. Little Man Computer (LMC) Editor You can use this simple Little Man Computer ( LMC ) editor below to check any LMC code you have written to ensure it outputs correctly . Use the reminders on the right for the 11 commands needed in the OCR A-Level specification . LMC is a simplified form of assembly language . This page is under active development. INP is used without a label to input a number . The number is temporarily stored in the accumulator. Example: INP OUT will output the current value of the accumulator. Example: OUT STA stores the value that is currently in the accumulator into a named memory location. Example: STA num1 ADD is used to add the value of a named memory location to the value currently stored in the accumulator. Example: ADD num1 SUB takes away the value of a named memory location from the value currently stored in the accumulator. Example: SUB num1 LDA is used to load the value of a stored variable into the accumulator. Example: LDA num1 BRZ is used to branch to a labelled line of code if the value in the accumulator is exactly 0 . Example: BRZ ifzero BRP is used to branch if the value in the accumulator is currently positive (including 0). Example: BRP repeat BRA is used to branch regardless of the accumulator's current value . Example: BRA loop HLT will stop the program. Example: HLT DAT defines and stores data in memory. It creates a variable or memory location that can hold a specific value. It is written after the final HLT command. Example: fifty DAT 50

Learn about laws regarding suitable data disposal of information and computer systems as well as methods including electromagnetic wipe and physical destruction. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification. 5.6 - Data & System Disposal Exam Board: OCR Specification: 2016 - Unit 1 Computer components such as circuit boards, processors and monitors contain hazardous materials that cannot be disposed of in traditional ways such as rubbish collection and landfills. For security reasons, data must also be disposed of carefully so that it is not returned to a readable format by unauthorised viewers . Legislation In recent years, the government has introduced different laws that relate to the safe disposal of computer equipment to help reduce environmental impact . Waste Electronic and Electrical Equipment ( WEEE ) Directive : This provides guidance on how hazardous materials should be disposed of safely . This includes materials such as mercury (found in smartphones and newer monitors ) and toner cartridges in printers . These materials can damage the environment if not disposed of appropriately . Waste Acceptance Criteria ( WAC ): Equipment must meet these rules before it can be sent to a landfill . Hazardous materials, such as the elements in computer monitors , do not meet these criteria and should not be accepted . Hazardous Waste Directive : This ensures businesses safely store hazardous materials and use authorised businesses to dispose of the waste . Hazardous materials include mercury and hexavalent chromium . Data Protection Act ( DPA ): One principle of the DPA specifies that data should only be kept for a reasonable amount of time until it is securely deleted . Data stored on customers should be checked regularly and permanently deleted if no longer required . Methods of Data & System Disposal Overwriting is when new data is written to the hard disk drive to replace the current data - essentially resetting the data . Remember all data stored by a computer is in a binary format . Overwriting just once is usually not enough to remove all evidence of the data and the process may be repeated several times . Overwriting data causes no damage and means the drive can still be used for other purposes afterwards. Electromagnetic wiping uses a machine called a degausser , which has a very strong electromagnetic coil , to completely wipe the hard disk drive . Many large organisations use degaussers to be sure that their data is no longer on the devices they have used so it can’t be restored and accessed by unauthorised viewers . Degaussers are expensive to buy but it allows the device to be used again for other purposes afterwards as it is not physically damaged. A third option is the physical destruction of a computer system or storage device , like a hard disk drive , which guarantees the data is permanently inaccessible . However, physical destruction also renders the storage media unusable again for other purposes. Examples of physical destruction include shredding (e.g. a CD shredder ) or tools such as sledgehammers if no other option is available. Q uesto's Q uestions 5.6 - Data & System Disposal: 1. Describe the purpose of 4 different pieces of legislation relating to how data or computer systems should be disposed of safely . [8 ] 2a. State 3 methods of data and system disposal . [3 ] 2b. Describe 1 advantage and 1 disadvantage of using each method you stated in 2a. [6 ] 5.5 - Digital Security Topic List

Frequently asked questions about CSNewbs including content, the creator and contact. Frequently Asked Questions about Computer Science Newbies What is CSNewbs? Hi, I'm Mr. Pulsford, I've been teaching Computer Science for over 11 years and CSNewbs is a solo project of mine that I created in 2017 and regularly keep updated . Here you can find concise information for a number of British Computer Science exams boards for GCSE and A-Level courses as well as programming help . In 2025 I started actively creating and uploading videos on YouTube , you can find the channel here . This website covers all necessary content from relevant specifications , but breaks it down so it is easier to understand and gets straight to the point . It is made by just one person , but updates are frequent . Which courses does CSNewbs cover? The ' Year 10 & 11 ' section follows the OCR J277 specification and Eduqas specification ( 2020 edition ) . The ' Year 12 & 13 ' section follows the OCR A-Level H446 specification and OCR Cambridge Advanced Nationals in Computing specification for Application Development . There is also content for the now-finished Cambridge Technicals IT course. The ' Programming ' section contains material for Python , HTML , Greenfoot and others. The ' Year 7, 8 & 9 ' section covers basic Computer Science topics including computer components and cybersecurity. Is the site linked to any exam boards? CSNewbs is not affiliated with any exam board , financially or in any other way . The information on this site has been independently created by closely manually analysing (without AI ) the publicly released specifications by exam boards such as Eduqas and OCR and their previous exams and mark schemes . How was this website made? CSNewbs.com was created and is maintained using Wix . What's the deal with copyright? CSNewbs is protected by copyright , and some copy / paste features have been disabled on the site. All images have either been self-created or used from Wix's copyright-free vector gallery / their stock image library / or with a licence from Noun Project . Embedded videos are linked to content from the CSNewbs YouTube page. Will other exam boards be added? The site continues to expand over time with new content . The eventual aim is to cover every exam board for GCSE and A-Level Computer Science but that will take a lot of time! Why is something on the site not working at my school? Your school's IT administrators may have blocked some elements such as JavaScript or embedded YouTube videos . The videos can be watched directly on YouTube (if not blocked on your school network). Who is the robot? The robot is called Questo . It's the site logo and appears on some pages to ask questions about the content (' Questo's Questions ') or to display key terms . What else? If you work for an exam board or educational resource organisation , and your organisation has opportunities available , please send me an email. I have previously done work for Educake . How can I contact the creator of CSNewbs? The contact email is: Privacy Policy

Learn about the three principles of information security - confidentially, integrity and availability. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification for Unit 2 (Global Information). 6.1 - Security Principles Exam Board: OCR Specification: 2016 - Unit 2 There are three key principles of data security that are protected in legislation such as the Data Protection Act (2018 ). Organisations storing personal or sensitive information must ensure that these three principles are upheld at all times . Confidentiality What it means: Information should only be accessed by individuals or groups with the authorisation to do so. How to uphold this principle: An organisation should use protection measures like usernames and passwords to ensure that only authorised people can access the sensitive data. Tiered levels of access or permissions can also limit who has access to the data. Integrity What it means: Information is maintained so that it is up-to-date , correct and fit for purpose . How to uphold this principle: Organisations should carry out regular data maintenance to update information (e.g. confirm contact details once a year). If storing data in a spreadsheet or database, record-locking should be used so that only person can edit at a time, preventing the data from becoming incorrect. Availability What it means: Information is available to the individuals or groups that need to use it. It should only be available to those who are authorised . How to uphold this principle: Staff should have the correct privileges so that they can easily access data when required. Data could be stored online , e.g. cloud storage so that it is available remotely using an internet connection. Data must also be kept safe from unauthorised access . Staff should not make additional copies of information which could be lost or stolen. Q uesto's Q uestions 6.1 - Security Principles: 1a. Describe what is meant by ' confidentiality ' . [1 ] 1b. Explain two ways that an organisation can keep data confidential . [4 ] 2a. Describe what is meant by ' integrity ' . [1 ] 2b. Explain two ways that an organisation can preserve the integrity of its data . [4 ] 3a. Describe what is meant by ' availability ' . [2 ] 3b. Explain two ways that an organisation can keep its data available . [4 ] 5.2 - Data Flow Diagrams Topic List 6.2 - Risks

Learn about the three factors that affect computer performance - cache memory size and levels, clock speed and the number of cores. Based on the 2020 Eduqas (WJEC) GCSE specification. 1.5: Performance Exam Board: Eduqas Specification: 2020 The performance of a computer system is affected by three main factors: Cache Memory: Size & Levels What is cache memory? Cache memory is temporary storage for frequently accessed data . Cache memory is very quick to access because it is closer to the CPU than other types of memory like RAM . What are the 3 levels of cache memory? Level 1 cache is the smallest level but it is also the fastest . Level 2 cache is larger than level 1 but slightly slower. Level 3 cache is located outside of the CPU core which makes it slower than the first two levels but it is much larger . How does cache memory work? When the CPU searches for data , it looks first in level 1 cache, then level 2 and then level 3 . If the data has been found , this is called a 'cache hit '. If the data is not found then the CPU searches in RAM instead which takes more time - this is called a 'cache miss '. How does cache memory improve performance? Cache memory is closer to the CPU than RAM , meaning that it can provide data and instructions to the CPU at a faster rate . A computer with more cache memory (e.g. 8MB instead of 4MB) should have a higher performance because repeatedly used instructions can be stored and accessed faster . Larger level 1 and level 2 cache sizes will improve a computer's performance as data can be accessed extremely quickly . What is the limitation of cache memory? Cache memory is costly, so most computers only have a small amount . Multiple cache misses will result in data latency (delay) as information is accessed from RAM which is further away from the CPU. Clock Speed What is clock speed? Clock speed is the measure of how quickly a CPU can process instructions . Clock speed is measured in Gigahertz (GHz) . A typical desktop computer might have a clock speed of 3.5 GHz . This means it can perform 3.5 billion cycles a second . How does clock speed improve performance? The faster the clock speed, the faster the computer can perform the FDE cycle resulting in better performance because more instructions can be processed each second . How does overclocking and underclocking affect performance? Typical clock speed: 3.5 GHz Underclocking Overclocking 3.9 GHz 3.1 GHz Overclocking is when the computer's clock speed is increased higher than the recommended rate. This will make the computer perform faster, but it can lead to overheating and could damage the machine . Underclocking is when the computer's clock speed is decreased lower than the recommended rate. This will make the computer perform slower but will increase the lifespan of the machine . Number of Cores What is a core? A core is a complete set of CPU components (control unit, ALU and registers). Each core is able to perform its own FDE cycle . A multi-core CPU has more than one set of components within the same CPU. How does the number of cores improve performance? In theory, a single-core processor can execute one instruction at a time , a dual-core processor can execute two instructions, and a quad-core can execute four instructions simultaneously . Therefore, a computer with more cores will have a higher performance because it can process more instructions at once . What are the limitations of having more cores? If one core is waiting for another core to finish processing, performance may not increase at all. Some software is not written to make use of multiple cores , so it will not run any quicker on a multi-core computer. Q uesto's Q uestions 1.5 - Performance: Cache Size & Levels 1a. What is cache memory ? [ 2 ] 1b. Describe the three levels of cache memory . [ 3 ] 1c. Describe what is meant by a ' cache hit ' and a ' cache miss '. [ 2 ] 1d. Describe two ways that more c ache memory will mean performance is higher . [ 4 ] 1e. Explain why most computers only have a small amount of cache memory. [ 1 ] Clock Speed 2a. What is clock speed ? What is it measured in? [ 2 ] 2b. Explain how a higher clock speed improves performance . [ 2 ] 2c. Explain the terms 'overclocking ' and 'underclocking ' and explain the effects of both on the performance of a computer. [ 4 ] Number of Cores 3a. What is a core ? [ 2 ] 3b. Explain why a quad-core processor should have a higher performance than a dual-core processor . [ 3 ] 3c. Explain two reasons why having more cores doesn't necessarily mean the performance will be better . [ 2 ] 1.4 - Secondary Storage 1.6 - Additional Hardware Theory Topics

A splash page for the previous Cambridge Technicals units - Unit 1 (Fundamentals of IT) and Unit 2 (Global Information). OCR Cambridge Technicals IT Level 3 These pages are based on content from the OCR Cambridge Technicals 2016 Level 3 IT specification . This qualification stopped in July 2025. The pages on the site will remain for at least two years. Unit 1 Fundamentals of IT Unit 2 Global Information

Learn about the elements of a data flow diagram and factors that may disrupt them. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification for Unit 2 (Global Information). 5.2 - Data Flow Diagrams Exam Board: OCR Specification: 2016 - Unit 2 A data flow diagram is a visual representation of how data is transferred within a system or organisation . Data flow diagrams are often abbreviated to just 'DFD '. You will need to recognise the symbols , understand the diagrams and explain how data flow can be affected . Data Flow Diagram Symbols The common symbols used in a DFD are shown below: External Entity (e.g. Employee, Customer) Alternative DFD symbols you may see on the exam paper (both sets of symbols have been accepted in previous exam papers): Process (e.g. Calculate Pay, Review Application) Data Store (e.g. Staff Database, Customer Database) External Entity Process Data Store Data Flow Level 0 data flow diagrams show the transfer of data in a simple manner . Processes may be generalised and not shown separately , for a more basic overview . Below is an example of a Level 0 DFD to show the process of an employee submitting an application to be promoted : Level 1 data flow diagrams show the transfer of data in a more detailed manner . Processes are shown separately , for a more complex and realistic overview . Below is an example of a Level 1 DFD to show the process of an employee submitting an application to be promoted . The individual processes have been expanded from the Level 0 DFD above to show how the application must first be signed off by an administrator before it is reviewed by management: Rules for Drawing a Level 1 DFD Data flows only in one direction . Every data flow is labelled (with the data itself , not the action). Every data flow connects to at least one process . At least one input or output for each external entity . Impacts Affecting the Flow of Information There are several reasons why the flow of information within an organisation may be delayed or inefficient , such as: Information characteristics e.g. information is entered incorrectly, causing delays. Human error e.g. information is lost or staff don't follow protocol. Hardware failure e.g. network connection breaking or system failure. Communication breakdown e.g. meetings postponed or emails unread. Q uesto's Q uestions 5.2 - Data Flow Diagrams: 1. Draw the symbols for the four parts of a data flow diagram . [4 ] 2. Look at the image of the Level 1 DFD . State one example of: An external entity A process A data flow A data store [1 each ] 3. Give one difference between a Level 0 and Level 1 DFD . [2 ] 4. State three rules for drawing a correct data flow diagram . [3 ] 5. After heavy snow, a school has decided to shut for the next two days. Many parents were not informed of this decision and are angry that they brought their children in. Give three reasons why the transfer of data (the data being a message about school closure) might not have flowed efficiently in this example. [6 ] 1 Level 0 Data Flow Diagram Level 1 Data Flow Diagram 5.1 - Data Types & Sources Topic List 6.1 - Security Principles

Learn how to spot a phishing email and other ways to stay secure online including choosing strong passwords. Scams & Staying Safe Part 1: Phishing Scams A phishing scam is when an attacker will send you an email pretending to be someone you trust . They are trying to get your username, password or other sensitive information . What does a phishing email look like? Capital letters and exclamation marks may be used to create a sense of urgency. A phishing email might be sent from a long, unrecognisable email address . It may be similar but slightly different to a real email address. An attacker might not know your name , so they will use your email address. A phishing email might contain spelling and grammar mistakes , so look carefully. Check any links carefully , if it looks suspicious, don't click it. Phishing emails try to rush you into making a silly decision. Don't panic and read the email carefully. Part 2: Secure webpages When you are browsing the web , you should stick to websites that you know and trust. Don't click on any links that you don't recognise , especially from strangers . How do i know a web page is secure? HTTP is a protocol (set of rules) for displaying a web page . If the web address at the top of your web browser starts with HTTP then it is not secure . Do not enter any personal information on an insecure web page. HTTPS is a protocol (set of rules) for displaying a secure web page. If you see a padlock in the address bar of your web browser then you know it is safer to enter information . Part 3: Strong passwords Your passwords must be secure so they cannot be broken easily. How to choose a strong password: ********* Passwords should be more than at least 8 characters long. Passwords should use numbers and punctuation marks . Aa Bb Cc Dd Ee Passwords should use uppercase and lowercase letters . You should use a different password for each account that you have. Passwords should not use words found in the dictionary . KS3 Home