Search CSNewbs

About CSNewbs Plus (CSN+) CSN+ is a premium collection of resources made for teachers that follows the Computer Science specifications covered on the website . Currently, these resources are in development , with the Eduqas GCSE resource pack arriving first, based on the Eduqas GCSE Computer Science 2020 specification . < Free zip folder download of all resources for Eduqas GCSE topic 1.1 (The CPU) *Updated Jan 2021* Resources included for each topic: Lesson Slides Starter activity (to print) Task resources (e.g. diagrams or worksheets to print) Task answers What is included in the CSNewbs+ GCSE collection? 39 presentation slides 39 starters 39 task answer documents 19 revision activity pages 7 topic tests & answers See below for more details: + Complete presentation slides for each of the 39 theory topics in the Eduqas GCSE 2020 specification . PowerPoint and Google Slides compatible. Activity resources to print . Including diagrams , tables and worksheets for lesson tasks . All answers included for teachers to use. Starter questions that recap the previous topic. For teachers to print before the lesson. All answers included in the lesson slides. 39 starters . Comprehensive answers for all lesson tasks . 39 task answer documents containing answers for over 100 lesson tasks for teachers to use . Revision templates for students to complete, to print on A3 paper . 19 pages and 7 revision lesson slides . Exercise book headings and the driving question (lesson focus) 7 end-of-topic tests with brand new questions . All answers included for teachers. What is included on the presentation slides? The following breakdown shows the presentation slides for 1.1 (The CPU): A title slide The content covered from the Eduqas GCSE specification Exercise book headings and the driving question (lesson focus) Answers to the starter activity questions Lesson objectives An explanation of the topic Clear explanations of the content First task. Students use slides or CSNewbs to complete. All answers on separate teacher document. Task 2. Table provided in teacher resource pack to print. Further explanations of the content Further explanations of the content with diagrams. Further explanations of the content with diagrams. Task 3. Answers in the teacher document. Plenary to check the students' understanding of the lesson topics. < Free zip folder download of all resources for Eduqas GCSE topic 1.1 (The CPU) *Updated Jan 2021*

Learn about searching algorithms such as linear and binary search. Also learn about sorting algorithms such as merge, bubble and insertion sorts. Based on the J277 OCR GCSE Computer Science specification (first taught from 2020 onwards). 1.3: Searching & Sorting Algorithms Exam Board: OCR Specification: J277 Watch on YouTube : Linear Search Binary Search Bubble Sort Merge Sort Insertion Sort Key features of a bubble sort: Uses an outer while loop (condition controlled ) to check no swaps have been made . Uses an inner for loop (count controlled ) to repeat through the length of the data set . Uses a flag (a Boolean value ) to track if a swap has been made and uses a temporary value to help correctly swap elements . Linear Search A linear search is the most simple search algorithm. Each data item is searched in order from the first value to the last as if they were all laid out in a line . The list does not have to be in any order before it is searched . This search is also known as a sequential search because the list is searched in a sequence from start to end. For large lists , this search is not very efficient . Binary Search A binary search is a much more efficient searching algorithm as it generally searches through fewer data and is often much quicker - especially for large data sets . In a binary search, the middle point of the data is selected with each iteration and compared to the value being searched for . When the midpoint matches the target value , it as been found and the search can stop. ! ! However there is a prerequisite of using a binary search - the list of data must already be sorted . A prerequisite is a condition that must be satisfied before an algorithm will work correctly . Merge Sort Merge sort is a sorting algorithm based on the idea of ‘divide and conquer ’. A merge sort divides a list into half , again and again until each data item is separate . Then the items are combined in the same way as they were divided , but now in the correct order . When the individual lists are all merged together as one list again, then the data is in order and the algorithm will end . Bubble Sort This algorithm is based on the comparison of adjacent data elements . Data elements are swapped if they are not in the correct order . The algorithm will only stop when a complete iteration through the data is completed with no swaps made . A bubble sort is not suitable for large sets of data . Insertion Sort The list is logically split into sorted values (on the left) and unsorted values (on the right). Starting from the left, values from the unsorted part are checked and inserted at the correct position in the sorted part. This continues through all elements of the list until the last item is reached, and sorted. Insertion sorts are efficient for small data sets but would be slow to sort large sets , compared to alternatives such as a merge sort. Key features of a linear search: A loop is used to check the first value in a list and increment by 1 , checking each value for a match to the target . Reaching the last element of the list without finding a match means the value is not included . Key features of a binary search: A midpoint , lowpoint and highpoint are calculated . A while loop is used to repeatedly compare the midpoint to a target value . The upper half or lower half of the data is ignored if the midpoint does not equal the target . Key features of a merge sort: This algorithm calls itself from within the subroutine (this is known as a recursive algorithm ). It continually splits sublists into a left side and a right side until each sublist has a length of 1 . Watch on YouTube Watch on YouTube Watch on YouTube Watch on YouTube Key features of a insertion sort: Uses an outer for loop (count controlled ) to iterate through each value in the list . Uses an inner while loop (condition controlled ) to find the current value’s correct position in the sorted part of the list . An insertion sort moves ‘ backwards ’ to find the correct position of each value, by decreasing the index within the while loop. Watch on YouTube Q uesto's Q uestions 1.3 - Searching & Sorting Algorithms: Linear Search Explain step-by-step how the number 8 would be found in the following list using a linear search : 12, 5, 3, 2, 8, 19, 14, 6 [4 ] Binary Search Explain step-by-step how the number 2 would be found in the following list using a binary search : 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 [6 ] Merge Sort Explain step-by-step how a merge sort would sort the following list of numbers: 4, 8, 5, 1, 3, 6, 7, 2 [6 ] Bubble Sort Explain step-by-step how a bubble sort would sort the following list of numbers: 3, 1, 6, 5, 2, 4 [6 ] Insertion Sort Explain step-by-step how an insertion sort would sort the following list of numbers: 5, 2, 6, 3, 1, 4 [6 ] 1.2 - Designing Algorithms Theory Topics 2.1 - Programming Fundamentals

A simple HTML and CSS editor using Code Minrror libraries. Learn how to create simple web pages using HTML. Try practice tasks and learn through text and images. Perfect for students learning GCSE Computer Science in UK schools. Simple HTML & CSS Editor This page is under active development.

Learn about data formats such as ASCII, Unicode, CSV, fixed-width, JSON and XML and data types, including Boolean, character, date, integer, real and string. 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 2.1 - Data Formats & Types Watch on YouTube : Data Formats Data Types You need to know the characteristics , uses , advantages and disadvantages of six data formats (ASCII , Unicode , CSV , fixed-length , JSON and XML ). You also need to know the characteristics , uses , advantages and disadvantages of six data types (Boolean , character , date , integer , real and string ). What You Need to Know Data Formats ? YouTube video uploading soon Data Types ? YouTube video uploading soon Q uesto's Q uestions 2.1 - Data Formats & Types: 1. What? [2 ] 2. What? [1 ] 3. What? [1 ] 4. What? [1 ] ? D id Y ou K now? 1.3 - Storage Topic List 2.2 - Data Flow

Learn about the six main validation checks - range, type, length, format, lookup table and presence. Also, discover three verification checks - double entry, proof-reading and check digits. Based on the 2020 Eduqas (WJEC) GCSE specification. 8.5: Validation & Verification Exam Board: Eduqas / WJEC Specification: 2020 + What are validation and verification checks? Validation is a process to check that data is reasonable or sensible before it is accepted . Verification is the process of checking that data is correct after it has been entered. Validation Checks Range Check Checks data is within a certain range . Age: 34 203 Type Check Checks data is a certain data type . Height (in cm): 182 Two metres Format Check Checks data is entered in a certain way . Date of Birth (DD/MM/YYYY) 25/03/2001 25th March 01 Presence Check Checks that data has actually been entered and not left blank . Password: fluffythecat123 Lookup Table A table of acceptable entries , also known as a list . Length Check Checks the length of the input is within a certain amount. Telephone Number 08323877319 07383 Verification Checks Double Entry Typing in the data twice to make sure there were no spelling errors the first time. Password: fluffythecat123 flufythecat123 Proofreading Checking two copies of data to ensure they are exactly the same . Check Digit Similar to a checksum in a data packet, a check digit is calculated on barcodes to ensure the rest of the numbers are correct . Address: 11 Cherry Lane 11 Cherry Road Confirm Q uesto's Q uestions 8.4 - Validation & Verification: 1. Describe each type of validation check and give an example . a. Range Check [ 3 ] b. Type Check [ 3 ] c. Format Check [ 3 ] d. Presence Check [ 3 ] e. Lookup Table (List) [ 3 ] f. Length Check [ 3 ] 2. For the following data, suggest which validation check would be most suitable and why : a. Password [ 3 ] b. Country of Birth [ 3 ] c. Number of Tickets [ 3 ] d. Weight (in kilograms) [ 3 ] 3. Describe three types of verification check and give an example : a. Double Entry [ 3 ] b. Proofreading [ 3 ] c. Check Digit [ 2 ] 8.4 - Sorting & Searching Theory Topics 9.1 - IDE Tools

Learn about boolean logic and expressions using NOT, AND OR and XOR, Karnaugh maps, Boolean algebra rules including De Morgan’s Laws, distribution, association, commutation and double negation, logic gate diagrams, truth tables, D-type flip flops, half adders and full adders. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level Specification: Computer Science H446 4.3 - Boolean Algebra Watch on YouTube : Boolean Logic (NOT, AND, OR, XOR) Karnaugh maps Boolean algebra rules Logic gate diagrams Truth tables D-type flip flops Half & full adders This topic explores how the logical operations NOT , AND , OR and XOR are used to process binary data and control digital systems . It also looks at how to simplify and represent logic using Karnaugh maps , Boolean algebra rules , logic gate diagrams and truth tables . Boolean Logic Boolean logic is a form of algebra in which all values are either True (1 ) or False (0 ). It’s used in computing and digital circuits to make decisions and control the flow of programs . NOT (negation ) (¬ ) reverses the input value - 1 becomes 0 and 0 becomes 1 . AND (conjunction ) (∧ ) outputs 1 only if both inputs are 1 (e.g. 1 AND 1 = 1 , otherwise 0 ). OR (disjunction ) (v ) outputs 1 if at least one input is 1 (e.g. 1 OR 0 = 1 ). XOR (exclusive disjunction ) (v ) outputs 1 only if one input is 1 but not both (e.g. 1 XOR 1 = 0 , 1 XOR 0 = 1 ). YouTube video uploading soon Karnaugh Maps A Karnaugh map is a visual method used to simplify Boolean expressions and make logic circuits more efficient . It organises all possible input combinations into a grid , where adjacent cells differ by only one bit (following Gray code order ). By grouping together 1s (representing True outputs ) in powers of two (1 , 2 , 4 or 8 cells ), you can identify and remove redundant terms in a Boolean expression . The simplified result reduces the number of logic gates needed in a circuit, making it faster and easier to build . YouTube video uploading soon Boolean Algebra Rules Boolean algebra rules are used to simplify Boolean expressions . De Morgan’s Laws show how to distribute negation across AND and OR operations: ¬(A AND B) = (¬A OR ¬B) and ¬(A OR B) = (¬A AND ¬B) . Distributive Law allows expressions to be expanded or factored , e.g., A AND (B OR C) = (A AND B) OR (A AND C) and vice versa for OR over AND. Associative Law means the grouping of terms doesn’t affect the result . (A AND B) AND C = A AND (B AND C) and (A OR B) OR C = A OR (B OR C) . Commutative Law means the order of terms doesn’t matter in Boolean operations, e.g., A AND B = B AND A and A OR B = B OR A . With Double Negation , two NOTs cancel each other out , returning the original value , e.g., ¬¬A = A . YouTube video uploading soon Logic Gate Diagrams Logic gate diagrams are visual representations of Boolean expressions or digital circuits , showing how data flows through logic gates to produce an output . Each gate performs a basic logical operation (such as NOT , AND , OR or XOR ) and is represented by a distinct symbol . NOT AND OR XOR YouTube video uploading soon Truth Tables A truth table is used to show all possible input combinations for a logic circuit or Boolean expression , along with the resulting output for each combination . Each row in the table represents a unique set of input values (usually 0 for False and 1 for True ). The final column shows the output produced by applying the logical operations to those inputs . The number of rows in a truth table doubles with each additional input , e.g. 4 rows for 2 inputs and 8 rows for 3 inputs . YouTube video uploading soon D-Type Flip Flops A D-type flip-flop i s a sequential logic circuit that stores a single bit of data - either 0 or 1 . It has two inputs , D (data ) and CLK (clock ), and two outputs , Q and ¬Q . When a clock pulse occurs , the flip-flop copies the value of D to the Q output , and that value is held (stored ) until the next clock pulse . This makes D-type flip-flops useful for memory storage , registers and data synchronisation . Essentially, they act as a 1-bit memory cell , storing the last value of D whenever the clock signal triggers . YouTube video uploading soon Half Adders & Full Adders A half adder is a logic circuit with two inputs (A and B ) that are added to produce two outputs - S (sum ), the result of A XOR B - and C (carry ), the result of A AND B . Half adders can only add two bits and cannot handle an input carry from a previous addition . A full adder is an extension of a half adder with three inputs : A , B , and C in (a carry-in from a previous calculation ). It produces two outputs : S (sum ) (A XOR B XOR Cin ) and C out (carry out ) ((A AND B) OR (B AND Cin) OR (A AND Cin) ). Full adders can be linked together to perform multi-bit binary addition in arithmetic circuits. YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Boolean Logic: NOT, AND, OR, XOR, Karnaugh maps, logic gate diagrams, truth tables Boolean Algebra Rules: De Morgan’s Laws, distribution, association, commutation, double negation D-Type Flip Flops: data, clock, Q, NOT Q Adders: half adder, full adder D id Y ou K now? The word ' Boolean ' is always spelt with a capital B because it is named after George Boole , a 19th-century English mathematician . His work has become the foundation of all modern digital electronics and computing . 4.2 - Data Structures A-Level Topics 5.1 - Computing Legislation

Learn about ways to measure the success of protection. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification for Unit 2 (Global Information). 6.4 - Protection Measures Exam Board: OCR Specification: 2016 - Unit 2 Staff Responsibilities It is the staff of an organisation that will spend the most time handling and amending data so the company must have sufficient and effective protection measures in place so that staff are confident in their role and know their responsibilities of information security. Certain staff members may be responsible for types of data within an organisation, such as personal and confidential data. Clearly assigning specific people to roles ensures that they know what their job is and that they are responsible if data is lost. Organisations also need to carefully consider which members of staff have access rights to certain information. If data is sensitive or confidential then the more people that have access to that data , the higher the risk of it being lost or tampered with (accidentally or on purpose). Sensitive data should only be handled and accessed by those who need to use it as part of their job role to limit the chance of data loss. Staff should be trained so that they know how to adequately handle information including basic data security techniques and how to protect data from unauthorised access and loss. Disaster & Recovery Planning With important data often stored on a computer network, it is absolutely vital that a detailed and effective disaster recovery policy is in place in the event of data being lost due to an unexpected disaster. Disasters include natural disasters (e.g. fire, flood, lightning), hardware failure (e.g. power supply unit failing), software failure (e.g. virus damage) and malicious damage (e.g. hacking). There are three clear parts to a disaster recovery policy: Before the disaster: All of the possible risks should be analysed to spot if there are any weaknesses in preparation. Preventative measures should be taken after the analysis, such as making rooms flood-proof or storing important data at a different location . Staff training should take place to inform employees what should happen in the event of a disaster. During the disaster: The staff response is very important – employees should follow their training and ensure that data is protected and appropriate measures are put in place. Contingency plans should be implemented while the disaster is taking place, such as uploading recent data to cloud storage or securing backups in a safe room and using alternative equipment until the disaster is over. After the disaster: Recovery measures should be followed, such as using backups to repopulate computer systems. Replacement hardware needs to be purchased for equipment that is corrupted or destroyed. Software needs to be reinstalled on the new hardware. Disaster recovery policies should also be updated and improved . Assessment and Effectiveness Organisations should conduct information security risk assessments periodically to ensure that their physical and logical measures are up-to-date and that they provide the most effective methods of protection. There may be training drills of what should happen if a disaster or substantial data loss occurs so that the company is prepared . By testing the security measures in place, they can identify any weak-points and fix those highlighted vulnerabilities to minimise the possibility of external and internal data intrusion. As part of an organisation's security assessment, they may identify specific cost impacts . These are necessary financial expenditures to ensure the security of data and systems, such as: Software - e.g. security software such as firewalls may be purchased to protect networked systems. Hardware - e.g. buying secure storage devices and new computer systems. Training - e.g. hiring industry experts to train staff on how to keep data secure. Security - e.g. hiring staff to protect server rooms. Q uesto's Q uestions 6.4 - Protection Measures: 1. Describe why staff are so important when it comes to data protection . [3 ] 2. Explain the steps an organisation should take as part of a disaster recovery plan . Split your answer into before, during and after the disaster. [12 ] 3. Why is it important to conduct information security risk assessments ? [2 ] 4. Describe two cost impacts to a bank of keeping customer data secure. [4 ] 6.3 - Impacts Topic List 6.5 - Physical Protection

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 characteristics, diagrammatic representations, advantages, disadvantages, and suitability of software development models. These include the waterfall, rapid throwaway, incremental, evolutionary, rapid application development (RAD), spiral and agile models. Resources 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) 2.1 - Software Development Models Watch on YouTube : Software Development Models Waterfall Rapid Throwaway Incremental Evolutionary Rapid Application Development Spiral Agile There are seven software development models you need to know : Traditional models: Waterfall Prototype models: Rapid Throwaway , Incremental , Evolutionary Iterative models: Rapid Application Development (RAD) , Spiral , Agile For each development model , you need to know : Its characteristics . How to represent it in a diagram . Its advantages and disadvantages . The types of development it is suitable for. Software Development Models Each development model has its own video below but you also need to know the advantages and disadvantages of using development models in general. Waterfall Model The waterfall model is a linear and structured approach where each phase is completed one at a time in order . It needs all requirements to be clearly defined at the start , with little to no changes allowed once a phase is finished . This model is best suited for projects with fixed requirements and minimal risk of change . Rapid Throwaway Prototype Model The rapid throwaway prototype model involves quickly creating temporary prototypes to explore ideas and gather user feedback before building the final system . Prototypes are discarded after they help refine requirements , and are especially useful in projects where user needs are initially unclear . This model is suitable when user interaction and efficient interface design are critical . Incremental Model The incremental model develops a system in small , manageable sections with each part being designed , built and tested individually . Functionality is added step by step until the full system is complete . This approach allows for early partial deployment and easier handling of changing requirements over time. Evolutionary Prototype Model The evolutionary prototyping model involves building an initial prototype that is continuously improved based on user feedback until it becomes the final system . Unlike throwaway prototyping, the prototype is not discarded but gradually evolves into the full product , once the user is satisfied . This model is ideal when user requirements are expected to change or develop over time . Rapid Application Development (RAD) The rapid application development ( RAD ) model focuses on quickly building software through iterative development and frequent user feedback . It uses reusable components , time-boxing and constant feedback to speed up the delivery of an effective final product . RAD is best suited for projects that need to be completed quickly and where requirements can evolve during development . Spiral Model The spiral model combines iterative development and risk management , progressing through repeated cycles of planning , risk assessment , engineering ( development and testing ) and evaluation . Each loop focuses on identifying and addressing risks early in the project. It is ideal for complex and high-risk projects where requirements may change over time . Agile Model The agile model is an iterative and flexible approach that progresses in small , usable chunks called iterations (or sprints ). It relies on frequent collaboration with stakeholders and user feedback to adapt to changing requirements . This model is ideal for dynamic projects where quick delivery and frequent updates are important. Q uesto's Q uestions 2.1 - Software Development Models: 1. Choose three development models to explain and draw a diagram for each. [6 ] 2. A large company is making the next sequel in a hugely popular video game series , FieldBattle 2043 . Justify which application development model(s) they should use (and which they shouldn't ). [5 ] 3. Describe the advantages and disadvantages of any development models you have not covered in Q1 or Q2 . [6 ] Agile development is named after the ' Agile Manifesto ' - a set of principles for software development agreed by a group of developers at a ski resort in Utah , USA in 2001 . D id Y ou K now? 1.3.3 - App. Software Types Topic List 2.2 - Phases of Development Models

Learn about utility software including antivirus, firewall, compression, disk partitioners, defragmenters, backup and file managers. Based on the 2020 Eduqas (WJEC) GCSE specification. 6.2: Utility Software Exam Board: Eduqas / WJEC Specification: 2020 + What is utility software? Utility software are dedicated programs used for the maintenance and organisation of a computer system. Antivirus Antivirus software is used to locate and delete viruses on a computer system. The antivirus scans each file on the computer and compares it against a database of known viruses . Files with similar features to viruses in the database are identified and deleted . Firewall A firewall manages incoming and outgoing network traffic . Each data packet is processed to check whether it should be given access to the network by examining the source and destination address . Unexpected data packets will be filtered out and not accepted to the network. Disk Defragmenter As files are edited over time they will become fragmented - this is when the file is split into parts that are stored in different locations on the hard disk drive . Files that are fragmented take longer to load and read because of the distance between the fragments of the file. Defragmentation software is used to rearrange the file on the hard disk drive so that all parts are together again in order. Defragmentation improves the speed of accessing data on the hard disk drive. Backup Software System backup copies data onto a separate storage device in case the original information is lost or corrupted . Backups should be saved regularly and stored in a different location to the rest of the data. Magnetic tape is a common backup medium. A typical backup policy is one known as 'grandfather - father - son' which uses three different backups at a time. Disk Compression Compression is the process of decreasing the size of a file . Disk compression is a utility tool that automatically compresses files when saved so that more data can be stored on the hard disk drive. When a file is to be opened, the program is automatically decompressed . Disk compression increases the amount of space on a hard disk drive but it takes longer to open and close files . Disk Checker This utility is used to scan a hard drive for any corrupted data . The corrupted data is deleted to speed up reading from and writing to the hard drive. More advanced disk checkers are used to scan for bad sectors . A bad sector is a permanently damaged section of the hard drive which can no longer be used and must be skipped over. Disk Formatter Disk Partition Editor This utility tool prepares a storage device such as the hard disk drive to be used by removing the current data and creating a file system . A file system manages how data is stored and accessed . Other devices like a USB stick may need to be formatted before they can be used for the first time . Within memory, partitions are segments of data that have been grouped together logically on the hard disk drive . A disk partition editor allows a user to view and modify these memory partitions . Options include creating, editing and deleting partitions. Clipboard Manager The clipboard is a temporary storage space for copied data. For example, a large amount of text can be copied and stored on the clipboard to be pasted into another document, even when the original file has been closed . The clipboard manager adds more functionality to the clipboard to allow multiple pieces of data to be copied, cut and pasted . System Profiles A system profiler displays detailed information about the applications on a computer system, as well as data about any attached hardware devices . Information is provided and updated in real-time about the performance of software and internal components such as the CPU . Data Recovery Data recovery tools allow deleted, corrupted or otherwise inaccessible data to be returned to a usable state . The data loss may have been caused by physical damage to a drive, corrupt memory partitions or accidental deletion . Most data is not permanently removed when it is deleted so data recovery software can often be used to reaccess files . Revision Control Revision control software manages previous versions of an application so that if an error occurs the program can be returned to a previous state . This is also called version control software and can be used to manage and monitor changes made to files over time. Archiver Archiving is the process of storing important data that is not currently required . It must not be deleted but it shouldn't take up valuable storage space either. An archiver compresses multiple files using lossless compression into one folder . This archived folder can be stored on a computer system or transferred to a storage device and won't take up much space . Cryptographic Utilities A cryptographic utility is used to encrypt data so that it cannot be understood if intercepted . Encryption is commonly for data in transit - being sent between devices . Cryptographic software can also encrypt data at rest - when stored on a hard disk drive for example - so that hackers would be unable to use the data . File Manager This utility tool provides an interface to the user for accessing, editing and moving files and folders on the system. Programs will be displayed in a hierarchical ( ordered ) structure with icons representing the application logo or file type. Files can be ordered in alphabetical, chronological or other orders and the manager provides an abstracted visualisation of where the data is stored. Q uesto's Q uestions 6.2 - Utility Software: 1. What is meant by utility software ? [1 ] 2. Describe each type of utility software : a. Antivirus b . Firewall c . Disk Defragmenter d . Backup Software e . Disk Compression f . Disk Checker g . Disk Formatter h . Disk Partition Editor i . Clipboard Manager j . System Profiles k . Data Recovery l . Revision Control m . Archiver n . Cryptographic Utilities o . File Manager [2 ] 6.1 - Operating Systems Theory Topics 7.1 - Language Levels

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

Learn about the tags that improve the layout of a web page, including how to centre content and add horizontal lines, bullet points and block quotes. 6. Organisation HTML Guide Watch on YouTube: This page explains the following tags which can be used to structure a simple page layout: Horizontal Line Centre Quote Bullet Points Numbered Points hr Horizontal Line You can add a horizontal line by simply adding to your document. There is no close tag. Add at least one horizontal line to your web page. center Centre Align This tag places the content within the tags on the centre of the page . Be careful - you need to use the American spelling - 'center ' - in your tags. Add tags to place your main heading in the centre of the page. blockquote Blockquote A blockquote is used to display a quote from another person or place. Text is indented further from the margin than the other content. It is not used very often, but can be found in some online articles and essays. Add at least one block quote to your web page. uo list Unordered List An unordered list is a set of bullet points . The tag is placed before the bullet points and afterwards. Each bullet point is placed within tags. That stands for list item . Add either an unordered or ordered list to your web page. Include at least three items in your list. o list Ordered List An ordered list will number each line . The tag is placed before the list and afterwards. Each list item is placed within tags. Add either an unordered or ordered list to your web page. Include at least three items in your list. Next it is time to add tags to the head, including a page title and metadata. 5. Images HTML Guide 7. Head Tags