Search CSNewbs

Learn about the moral and ethical issues of computing such as computers in the workforce, automated decision making, artificial intelligence, environmental effects, censorship and the internet, monitor behaviour, analysing personal information, piracy and offensive communications, layout, colour paradigms and character sets. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level Specification: Computer Science H446 5.2 - Moral & Ethical Issues Watch on YouTube : Moral & Ethical Issues #1 Moral & Ethical Issues #2 Artifical Intelligence Technology and the internet have transformed society , bringing huge benefits but also raising new ethical , social and environmental challenges . Below are some key modern issues linked to computing and digital systems . Moral & Ethical Issues Computers in the Workforce: Computers and automation have increased productivity and created new tech-based jobs , but they have also led to job losses in areas where machines can replace human labour . This raises concerns about unemployment and retraining in many industries . Automated Decision Making: Systems such as credit checks and recruitment tools now make decisions automatically using algorithms . While this can save time and reduce human bias , it can also lead to unfair or inaccurate outcomes if the data or programming is flawed . Artificial Intelligence (AI): AI allows machines to learn and make decisions without explicit human control , improving fields like healthcare and transport . However, it also raises ethical questions about accountability , job loss and the potential misuse of intelligent systems . Environmental Effects: Computers require energy to manufacture , use and dispose of , contributing to electronic waste and carbon emissions . Recycling and energy-efficient design can help reduce the environmental impact of modern technology . Censorship and the Internet: Some governments and organisations restrict access to information online to control what people can see or share . While this can protect users from harmful content , it can also limit freedom of expression and access to knowledge . Monitoring Behaviour: Digital systems and surveillance tools can track users’ actions , such as browsing history or location . This can improve safety and security but also raises privacy concerns about who collects this data and how it’s used . Analysing Personal Information: Companies and governments can collect and analyse large amounts of personal data to improve services or target advertising . However, this creates risks of data misuse , discrimination or identity theft if information isn’t protected properly. Piracy and Offensive Communications: The internet makes it easy to copy and share content illegally , such as music , films or software , leading to lost income for creators . It can also be a platform for offensive or harmful communication , such as trolling or cyberbullying , which can have serious social effects . Layout, Colour Paradigms, and Character Sets: Design choices like layout , colour schemes and character sets affect how accessible and inclusive digital content is. Using clear design , appropriate colours and Unicode character sets helps ensure that websites and software can be used by people of all languages and abilities . YouTube video uploading soon YouTube video uploading soon YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Moral & Ethical Issues: moral, social, ethical, cultural, opportunities, risks, computers in the workforce, automated decision making, artificial intelligence (AI), environmental effects, censorship, the internet, monitor behaviour, analysing personal information, piracy, offensive communications, layout, colour paradigms, character sets D id Y ou K now? In 2022 , the world generated 62 million tonnes of e-waste (roughly 7.8 kg per person globally) and only 22% of it was formally collected and recycled . 5.1 - Computing Legislation A-Level Topics

Navigate between all topics in the OCR A-Level Computer Science H446 specification. Includes all topics from Component 1 (Computer Systems) and Component 2 (Algorithms and Programming). OCR Computer Science A-Level These pages are based on content from the OCR H446 Computer Science specification . This website is in no way affiliated with OCR . Component 1: Computer Systems Paper 1 Playlist on YouTube This content is under active development. Check here for the latest progress update. 1. Hardware 1.1 - Structure & Function of the Processor (The CPU) 1.2 - Types of Processor 1.3 - Input, Output & Storage 2. Software 2.1 - Systems Software 2.2 - Applications Generation 2.3 - Software Development 2.4 - Types of Programming Language 3. Networks & Databases 3.1 - Compression, Encryption & Hashing 3.2 - Databases 3.3 - Networks 3.4 - Web Technologies 4. Data & Logic 4.1 - Data Types 4.2 - Data Structures 4.3 - Boolean Algebra 5. Laws 5.1 - Computing-Related Legislation 5.2 - Moral & Ethical Issues Component 2: Algorithms & Programming 1. Computational Thinking 1.1 - 1.5 - Computational Thinking 2. Problem Solving & Programming 2.1 - Programming Techniques 2.2 - Computational Methods 3. Algorithms 3.1 - Algorithm Complexity 3.1 - Data Structure Algorithms 3.1 - Sorting & Searching Algorithms 3.1 - Pathfinding Algorithms

Learn about the laws related to computing - the Data Protection Act, Computer Misuse Act, Copyright Design and Patents Act and Regulation of Investigatory Powers Act. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level Specification: Computer Science H446 5.1 - Computing-related Legislation Watch on YouTube : Data Protection Act Computer Misuse Act Copyright Design and Patents Act Regulation of Investigatory Powers Act Several key UK laws govern the ethical and legal use of computers and digital information including the Data Protection Act and Computer Misuse Act . Each act is designed to protect data , users or intellectual property in the digital age. Data Protection Act (2018) The Data Protection Act is a UK law designed to ensure that personal data is collected , stored and used responsibly . It gives individuals (data subjects ) rights over their personal information and sets rules for organisations that process it . Introduced in 1998 , it was updated in 2018 to align with the EU’s General Data Protection Regulation (GDPR ). The Data Protection Act's key principles include that data must be processed lawfully , fairly and transparently , used for specific purposes , kept accurate and up to date , stored securely and not kept longer than necessary . It also gives data subjects rights such as accessing their data , correcting inaccuracies , objecting to processing and requesting deletion . Organisations that break the law can face heavy fines and legal action from the Information Commissioner’s Office (ICO ). YouTube video uploading soon Computer Misuse Act (1990) The Computer Misuse Act (1990 ) is a UK law created to make unauthorised access and use of computer systems illegal . It was introduced in response to the rise of hacking and other cybercrimes as computers became more common . This act defines several offences , including: Unauthorised access to computer material , such as hacking into a system without permission . Unauthorised access with the intent to commit further offences , such as fraud or data theft . Unauthorised modification of data or programs , for example, spreading viruses or deleting files . Making , supplying or obtaining tools used for committing these offences . Penalties range from fines to imprisonment , depending on the severity of the crime . This act helps protect individuals , organisations and data from malicious attacks and misuse . YouTube video uploading soon Copyright, Designs & Patents Act (1988) The Copyright, Designs and Patents Act (1988 ) is a UK law that protects people’s creative and intellectual work from being copied or used without permission . It gives creators automatic legal rights over their original work , such as books , music , films and software . The act states that the copyright owner controls how their work is used , including the rights to copy , distribute or adapt it. Anyone wishing to use the work must get permission or a licence from the owner. It also includes exceptions , allowing limited use for purposes like education or research . This act helps ensure that creators are fairly rewarded for their work and that their intellectual property is legally protected . YouTube video uploading soon Regulation of Investigatory Powers Act (2000) The Regulation of Investigatory Powers Act (RIPA ) (2000 ) is a UK law that governs how public bodies and law enforcement can carry out surveillance and access electronic communications . It was introduced to balance national security and crime prevention with individuals’ right to privacy . RIPA allows authorised agencies , such as the police , intelligence services and local councils , to monitor communications , intercept phone calls or emails and use covert surveillance , but only with proper legal authorisation . It also regulates the use of informants and access to encrypted data . This act aims to ensure that surveillance is done lawfully , proportionately and for legitimate purposes , such as preventing or detecting serious crime or protecting public safety . YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Legislation: Data Protection Act (2018) Computer Misuse Act (1990) Copyright Design and Patents Act (1988) Regulation of Investigatory Powers Act (2000) D id Y ou K now? In 1985 , two journalists were arrested for ‘ hacking ’ into the emails of the Duke of Edinburgh ( Prince Philip ) after discovering an engineer’s username was ‘ 2222222222 ’ and password was ‘ 1234 ’. They were acquitted in court because no UK laws covered hacking , exposing a major legal gap that led to the creation of the Computer Misuse Act ( 1990 ) . 4.3 - Boolean Algebra A-Level Topics 5.2 - Moral & Ethical Issues

Learn about data structures including arrays, records, lists, tuples, linked-lists, graphs, stacks, queues, trees, binary search trees and hash tables. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level 4.2 - Data Structures Specification: Computer Science H446 Watch on YouTube : Arrays Records Lists & tuples Stacks Queues Linked lists Trees Graphs Hash tables Data structures are used to organise and store data so it can be accessed and processed efficiently , often through the use of an index or reference . They can be static , meaning their size is fixed during program execution , or dynamic , allowing them to grow or shrink as data changes . Arrays An array is a data structure that stores a collection of items of the same data type , with each item accessed using an index . A one-dimensional (1D ) array is a simple sequence of values , such as test scores for a single person : scores = [12, 15, 18, 20] . A two-dimensional (2D ) array is like a table or grid , made up of rows and columns - for example, storing a timetable or test scores for a class . A three-dimensional (3D ) array stores data in multiple layers , like a series of 2D grids . For example, test scores for a class across multiple subjects . This page is under active development. Check here for the latest progress update. YouTube video uploading soon Records A record groups together related but different types of data under one name . Each individual piece of data within a record is called a field and each field can have a different data type (e.g. string , integer , Boolean ). For example, a student record might include fields such as Name (string ), Age (integer ) and Enrolled (Boolean ). Records are often used in databases or programming to represent real-world entities where multiple attributes need to be stored together . YouTube video uploading soon Lists & Tuples A list stores an ordered collection of items , which can be changed (mutable ) after creation. Items in a list can be added , removed or modified , and they can be of different data types . For example, in Python : myList = [10, "apple", True] . A tuple is similar to a list but is immutable , meaning its contents cannot be changed once created . Tuples are often used for fixed sets of data that should not be altered , such as coordinates or dates . For example: myTuple = (3, 5, 7) . YouTube video uploading soon 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 Graphs A graph is made up of nodes (also called vertices ) connected by edges and is used to represent relationships between items. Graphs can be directed , where edges have a specific (one-way) direction , or undirected , where connections go both ways . They can also be weighted , where edges have values such as distance or cost , or unweighted , where all connections are equal . Graphs are widely used in computing, for example, in social networks (users and friendships ), maps (locations and routes ) and network routing algorithms . YouTube video uploading soon Hash Tables A hash table stores key–value pairs and allows for very fast data access . It uses a hash function to convert a key (such as a name or ID ) into an index (hash value ), which determines where the associated data (value ) is stored in memory . When retrieving data , the same hash function is applied to the key to find the value’s location instantly , making lookups close to constant time complexity on average . If two keys produce the same hash (a collision ), techniques such as chaining or linear probing are used to handle it . Hash tables are commonly used in databases , caches and programming languages for tasks like fast searching and indexing . YouTube video uploading soon Q uesto's K ey T erms Arrays: array, 1-dimensional, 2-dimensional, 3-dimensional, static Records: record, field, data type, primary key Lists and Tuples: list, tuple, mutable, immutable, dynamic 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 & Graphs: tree, binary tree, binary search tree, root node, branch, graph, weights, directions Hash Table: hash table, key, value, collision, linear probing, chaining D id Y ou K now? Trees are used for dialogue options in narrative video games , displaying possible paths based on the player’s previous choices . The final ' suicide mission ' of Mass Effect 2 has hundreds of possible variations depending on ship upgrades , squad member loyalty , and assigned roles during the last mission . 4.1 - Data Types A-Level Topics 4.3 - Boolean Algebra

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 data types (integer, real, character, string, Boolean), positive and negative binary, denary, hexadecimal, sign and magnitude, two’s complement, binary addition, binary subtraction, normalisation of floating point numbers, floating point arithmetc, bitwise manipulation, masks (AND, OR, XOR) and character sets (ASCII, Unicode). Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level 4.1 - Data Types Specification: Computer Science H446 Watch on YouTube : Data types Denary & binary Sign and magntiude Two's complement Binary addition Binary subtraction Hexadecimal & binary Hexadecimal & denary Floating point Floating point normalisation Floating point addition Floating point subtraction Binary shifts Masks (AND, OR, XOR) Character sets This is a mathematical topic that requires conversion between the binary , denary (decimal ) and hexadecimal number systems . Representing positive and negative binary values is included, as well as adding and subtracting binary numbers and using normalised floating point to represent decimal numbers . Data Types Data types are needed so that the computer knows how to store , process and interpret data correctly . They help ensure that only valid operations are performed on data . For example, you can add two numbers , but not a number and a word . Common data types: Integer : A whole number , e.g. 7 or -12 . Real : A decimal number , e.g. 3.14 or -0.5 . Boolean : A data type with only two possible values - True or False . Character : A single letter , digit or symbol , e.g. ‘k ’, ‘7 ’, or ‘? ’. String : A sequence of characters treated as text, e.g. “CSNewbs ”. Converting from one data type to another is called casting , e.g. age = str(age) would convert the variable age to a string in Python . YouTube video uploading soon Binary Binary is a base-2 number system with all values comprised only of 0 and 1 , e.g. 01011001 . Denary (also called decimal ) is the base-10 number system you grew up learning, with 10 possible values between 0 and 9 , e.g. 453 . Computers use binary because they are built from electronic components (transistors ) that have two states (on and off ), which are easily represented by 1s and 0s . All data processed and stored by the computer (e.g. numbers , text , images and sounds ) are represented in binary . To convert an 8-bit binary value to denary , write 128 - 64 - 32 - 16 - 8 - 4 - 2 - 1 above the binary and add together the values with a 1 underneath . For example, 10101101 is 173 (128 + 32 + 8 + 4 + 1 ). YouTube video uploading soon Storing Negative Numbers -183 Sign and Magnitude and Two’s Complement are two methods of representing negative numbers in binary . In Sign and Magnitude , the most significant bit (MSB ) represents the sign - 0 for positive and 1 for negative - while the remaining bits store the number’s magnitude (value ). For example, in 8-bit form, 0 101 0010 is +82 and 1 101 0010 is -82 . However, this method has two representations of zero (+0 and -0 ), which can cause problems and may give incorrect results if used to add or subtract . In Two’s Complement , negative numbers are represented by inverting all bits of the positive value and adding 1 to the result. This method has only one zero and makes binary addition and subtraction simpler . YouTube video uploading soon YouTube video uploading soon Binary Addition & Subtraction Binary addition works from right to left but only uses the digits 0 and 1 . The key rules are: 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 10 (write down 0 and carry 1 to the next left column ). 1 + 1 = 1 = 11 (write down 1 and carry 1 to the next left column ). If the final addition produces an extra carry bit , it may indicate an overflow error , if the result is too large to fit in the available bits . Binary subtraction can be done using borrowing , similar to denary subtraction , or more commonly by using two’s complement . In two’s complement subtraction , you add the negative version of one number (found by inverting the bits and adding 1 ) to the other to perform subtraction using binary addition rules . YouTube video uploading soon YouTube video uploading soon Hexadecimal 9E8A Hexadecimal is a base-16 number system using the digits 0 to 9 and the letters A to F, where A = 10 and F = 15 in denary . It’s often used in computing because it provides a shorter , more readable way to represent long binary values . For example, two hex digits represent eight binary bits , making conversions quick and efficient . To convert from binary to hexadecimal , split the binary number into groups of four bits (from right to left ) and convert each group into its hex equivalent . Example: 1101 0110 → 1101 (14 → D ) and 0110 (6 ) → D6 . To convert hexadecimal to binary , replace each hex digit with its 4-bit binary equivalent . Example: 2F → 0010 (2 ) and 1111 (15 → F ) → 0010 1111 . The easiest method to convert between denary and hexadecimal is to convert the value to binary first . Example: 26 → 0001 1010 → 1A . YouTube video uploading soon YouTube video uploading soon Floating Point Floating point is a way of representing real (decimal ) numbers in binary using a mantissa and an exponent . It allows computers to store a wide range of values efficiently , including very small and very large numbers . Floating point normalisation means adjusting the number so that the mantissa begins with a 01 (if it is positive ) or 10 (if it is negative ). This ensures the representation is unique and uses all available bits in the mantissa for precision . To add or subtract floating point numbers , the exponents must first be made equal by shifting the mantissa of the smaller number . Once aligned , the mantissas are added or subtracted , and the result is then normalised again to maintain the correct form . YouTube video uploading soon YouTube video uploading soon Binary Shifts A binary shift moves all the bits in a binary number left or right by a set number of places . A left shift moves all bits to the left , filling the empty right-hand bits with zeros . Each left shift multiplies the number by 2 . For example, shifting 0001 0100 (20 ) one place left gives 0010 1000 (40 ). A right shift moves all bits to the right , discarding the rightmost bits . Each right shift divides the number by 2 . For example, shifting 0010 1000 (40 ) two places right gives 0000 1010 (10 ). YouTube video uploading soon Masks A mask is a binary pattern used with bitwise operations (such as AND , OR and XOR ) to manipulate specific bits within a binary value . An AND mask is used to clear (set to 0 ) specific bits . Any bit ANDed with 0 becomes 0 , and any bit ANDed with 1 stays the same . For example, 1011 0110 AND 0000 1111 = 0000 0110 - the mask keeps only the lower four bits . An OR mask is used to set (turn on ) specific bits . Any bit ORed with 1 becomes 1 , and with 0 stays the same . For example, 1010 0000 OR 0000 1111 = 1010 1111 . An XOR mask is used to toggle (invert ) specific bits . Any bit XORed with 1 flips (0 → 1 or 1 → 0 ), while XORed with 0 stays the same . For example, 1010 1010 XOR 0000 1111 = 1010 0101 . YouTube video uploading soon Character Sets A character set is a collection of characters (letters , numbers , symbols and control codes ) that a computer can recognise , store and process . Each character is represented by a unique binary code . ASCII (American Standard Code for Information Interchange ) is an early character set that uses 7 bits to represent 128 characters , including English letters , digits , punctuation and control characters . It’s simple and compact but limited to English and basic symbols . Extended ASCII uses 8 bits for 256 characters . Unicode was developed to overcome ASCII’s limitations by representing characters from all languages and writing systems . It uses up to 32 bits and includes over 140,000 characters , allowing consistent representation of text across different devices and platforms . YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Data Types: integer, real, Boolean, character, string Number Systems: binary, denary (decimal), hexadecimal, sign and magnitude, two's complement, binary addition, binary subtraction, floating point, floating point normalisation, floating point addition, floating point subtraction Binary shifts: left shift, right shift Masks: mask, bitwise operator, AND, OR, XOR Character Sets: character set, ASCII, Unicode D id Y ou K now? Gottfried Wilhelm Leibniz , a German mathematician , is credited with inventing the binary number system in the 17th century , hundreds of years before computers existed. Leibniz biscuits are named after him. 3.4 - Web Technologies A-Level Topics 4.2 - Data Structures

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 Newb ie s Popular topics: Python Programming Application Development OCR Cambridge Advanced National in Computing (AAQ) A-Level Computer Science You are viewing the mobile version of CSNewbs. The site will appear better on a desktop or laptop . OCR A-Level (H446) GCSE Computer Science OCR GCSE (J277) Latest YouTube Video Latest Blog Post Links & Information Over half a million visits a year! About CSNewbs YouTube Channel Last updated: Saturday 8th November 2025

Learn about HTML, CSS, JavaScript, search engine indexing, the PageRank algorithm and client-side and server-side processing. Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level 3.4 - Web Technologies Specification: Computer Science H446 Watch on YouTube : HTML CSS JavaScript Search Engines & PageRank Server-Side & Client-Side Processing This topic looks at the languages that web pages are comprised of (HTML , CSS and JavaScript ) as well as search engines and network processing (client-side and server-side ). HTML HTML ( HyperText Markup Language ) is the standard language used to create and structure web pages . It uses tags enclosed in angle brackets to define elements on a page . A web page begins with , which contains a section for metadata , links and the

Learn about operating systems, memory management (segmentation and paging), scheduling, interrupts, the BIOS, device drivers and virtual machines Based on the OCR H446 Computer Science A-Level specification. Exam Board: OCR A-Level 2.1 - Systems Software Specification: Computer Science H446 Watch on YouTube : Operating systems functions Paging & segmentation Interrupts Scheduling algorithms Types of operating system BIOS Device drivers Virtual machines, thin clients & servers This topic looks at how the operating system manages the resources of a computer system . It also includes programs related to the operating system , such as the BIOS , device drivers and virtual machines . Operating Systems The operating system performs essential functions to keep a computer running efficiently . It provides a user interface , such as a command line or graphical user interface ( GUI ), and ensures system security by managing access rights and protecting files . The OS manages hardware , coordinating devices like the CPU , printers and hard drives and provides built-in utilities for tasks such as file management and disk defragmentation . It acts as a platform for software , allowing applications to be installed and run . The OS also schedules jobs , handles interrupts from devices, and manages memory , ensuring each process has the resources it needs without conflicts. Paging & Segmentation Paging is a memory management method that splits memory into equal-sized blocks called pages . This makes memory use more efficient as programs don’t need to be stored in one continuous block but unused space may be wasted inside a page . Segmentation divides memory into segments of different sizes based on program structure . This makes it easier to organise parts of a program , but because segments are different sizes , it can leave small unused gaps in memory that can’t be easily filled by other data. Interrupts An interrupt is a signal that tells the CPU to pause its current task and respond to something more urgent . Interrupts can come from hardware , such as a keyboard press , or from software , such as an error . When an interrupt occurs , the CPU saves its current state by placing current register values into a stack . The CPU runs an interrupt service routine ( ISR ) to handle the interrupt event . After the ISR finishes , the CPU restores its state by popping values from the stack and continues the original program . Scheduling Scheduling algorithms are used by the CPU to decide the order in which processes are executed . They aim to manage CPU time efficiently and ensure all programs get a fair share of resources . Common scheduling algorithms include: First-Come First-Served : Processes are executed in the order they arrive to the CPU . Round Robin : Each process gets a fixed time slice in turn , cycling through all processes. Shortest Job First / Shortest Time Remaining : These methods identify the process with the shortest estimated runtime to be executed first . Multi-Level Feedback Queue : Uses multiple queues with different priority levels . Processes can be moved between queues to avoid starvation . YouTube video uploading soon Types of OS Different types of operating systems exist depending on the computer system and purpose : Multitasking OS : Allows a single computer to run multiple programs at the same time by quickly switching between them. Multi-user OS : Lets multiple users access the computer and its resources simultaneously , often via a network . Distributed OS : Manages a group of networked computers as a single system , sharing resources and tasks . Embedded OS : Designed for devices with specific functions , like microwaves or smart TVs , often with limited resources . Real-time OS : Provides immediate processing and responses for time-critical tasks , used in systems like medical devices or industrial robots . YouTube video uploading soon The BIOS The BIOS (Basic Input/Output System ) is firmware stored in ROM that helps the computer start up and manage initial communication between hardware and the operating system . During the start-up sequence , the BIOS first checks that essential hardware (e.g. the CPU and RAM ) is present and working correctl y by running a Power-On Self Test (POST ). Signals are transmitted to all connected components . The BIOS then runs the bootstrap program to locate and load the operating system from a connected storage device into RAM . Once the OS is loaded , control is handed over to it, allowing the computer to become fully operational . YouTube video uploading soon Device Drivers A device driver is software that allows the operating system to communicate with hardware devices such as printers , graphics cards or keyboards . Hardware and the OS speak different ' languages ', so the driver translates OS instructions into commands the device can understand and vice versa. They are needed because, without drivers , the OS wouldn’t know how to control the hardware or use its features properly. Drivers also allow devices to work with different versions of an operating system and enable updates that improve performance or fix bugs . YouTube video uploading soon Virtual Machines A virtual machine is a software-based computer that runs an operating system and applications like a real computer , using part of the host computer’s hardware . It is isolated from the main system , so it can operate safely without affecting the host . Virtual machines are commonly used for testing software , running multiple operating systems and safely handling untrusted files . They provide flexibility , efficient hardware use and a secure environment for experimentation . YouTube video uploading soon This page is under active development. Check here for the latest progress update. Q uesto's K ey T erms Operating Systems: user interface, file management, user management Memory Management: paging, segmentation, virtual memory Interrupts: interrupt, interrupt service routine, stack Scheduling Algorithms: first come first serve, round robin, shortest job first, shortest time remaining, multilevel feedback queue Types of Operating System: multitasking, multi-user, distributed, embedded, real-time BIOS: ROM - power-on self-test (POST) Device Drivers: device driver Virtual Machines: virtual machine, thin clients, servers D id Y ou K now? New versions of the Android operating system used to be named alphabetically after sweet treats , from Cupcake , Donut and Eclair to Nougat , Oreo and Pie - the final named update in 2019 . 1.3 - Input, Output & Storage A-Level Topics 2.2 - Applications Generation

Learn about the denary, binary and hexadecimal number systems and how to convert between them. Based on the 2016 OCR Cambridge Technicals Level 3 IT specification. 1.8 & 1.9 - Number Systems & Conversion Exam Board: OCR Specification: 2016 - Unit 1 What is binary? What is denary? Denary (also known as decimal ) is the number system that you've been using since primary school. Denary is a base 10 number system. This means that it has 10 possible values - 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 . How to convert from binary to denary: How to convert from denary to binary: What is hexadecimal? Hexadecimal is a base 16 number system. This means that it has 16 possible values - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F . Hexadecimal is used as a shorthand for binary because it uses fewer characters to write the same value . This makes hexadecimal less prone to errors when reading or writing it , compared to binary. For example, 100111101011 is 9EB. Hexadecimal only uses single-character values. Double-digit numbers are converted into letters - use the table on the right to help you understand. How to convert from binary to hexadecimal: How to convert from hexadecimal to binary: Converting from denary to hexadecimal / hexadecimal to denary To convert from denary to hexadecimal or the other way round you must convert to binary first . Denary > Binary > Hexadecimal Hexadecimal > Binary > Denary Use the videos on this page if you need help converting to or from binary. The most common number systems question in exams are from denary to hexadecimal or from hexadecimal to denary so make sure that you practice these conversions. Q uesto's Q uestions 1.8 & 1.9 - Number Systems: 1. Explain why hexadecimal numbers are used as an alternative to binary . [ 2 ] 2. Convert the following values from binary to denary : a. 00101010 b. 11011011 c. 01011101 d. 11101110 e. 01011111 [1 each ] 3. Convert the following values from denary to binary : a. 35 b. 79 c. 101 d. 203 e. 250 [1 each ] 4. Convert the following values from binary to hexadecimal : a. 11110101 b. 01100111 c. 10111010 d. 10010000 e. 11101001 [1 each ] 5. Convert the following values from hexadecimal to binary : a. C2 b. 8A c. DE d. 54 e. F7 [1 each ] 6. Convert the following values from denary to hexadecimal : a. 134 b. 201 c. 57 d. 224 e. 101 [1 each ] 7. Convert the following values from hexadecimal to denary : a. 32 b. A5 c. 88 d. C0 e. BE [1 each ] Watch on YouTube Watch on YouTube Watch on YouTube Watch on YouTube By now you should know that computer systems process data and communicate entirely in binary . Section 1.7 explained different binary storage units such as bits (a single 0 or 1), nibbles (4 bits) and bytes (8 bits). Binary is a base 2 number system. This means that it only has 2 possible values - 0 or 1 . Click the banners above to try self-marking quizzes (Google Form) on these topics. Denary to Binary: Binary to Denary: Binary to Hexadecimal: Hexadecimal to Binary: 1.7 - Units of Measurement Topic List 2.1 Software Types

Learn how to add a counter to Greenfoot to keep track of the score. Learn how to add and subtract points to the counter. Part 6 of the Greenfoot Tutorial for the Eduqas / WJEC GCSE 2016 specification. 6. The Counter Greenfoot Tutorial 1. Import the Counter The counter class can be imported into your Greenfoot world. Select Edit in the main Greenfoot window then ' Import Class... ' and choose Counter . Watch on YouTube: The Counter class will appear in the Actor classes list . Right-click on the Counter, choose the ' new Counter() ' option and drag it into the world. Now right-click on the background and select 'Save the World' once you have dragged the counter into the world. 2. Increase the Counter by 1 Two lines of code are required to increase the counter . Add this code when your main character is removing the collectible object . This code allows your main character to access the 'add' method from the Counter class . The method 'add ' just increases the value of the counter by the number in the brackets . To decrease the counter , type a negative value in the brackets, such as -1 . < Part 5 - Play Sounds 3. Compile and Run Click the Compile button at the top of the code editor . Then you can go back to the main Greenfoot window and click Run to test if your counter increases . Click on me if you've got an error that you're stuck with. Part 7 - Extension Ideas >

Learn how to use tags to format text in HTML, including how to underline, italicise and embolden text. Also, learn about heading size and paragraphs. 3. Tags for Text HTML Guide Watch on YouTube: Remember to write the tags for everything you want the user to see between the and tags. Headings Time to add text to your web page such as headings and paragraphs. To write a large heading , use and To write headings in a smaller size, use numbers between 1 and 6. Add a large heading and a sub-heading to your webpage. paragraph Paragraphs Typing text between the and tags will create a paragraph . Add at least three different paragraphs to your webpage. bold underline italics Bold, Underline & Italics You can format your text by changing it to be bold , underlined or italicised (slanted). Now you have text on your web page, you can add hyperlinks to take viewers to different websites. In the paragraphs you have already written, add at least 1 bold tag, 1 underline tag and 1 italics tag. 2. Essential Tags HTML Guide 4. Hyperlinks