top of page

Search CSNewbs

304 results found with an empty search

  • Greenfoot Guide #4 | Remove Objects | CSNewbs

    Learn how to easily remove objects in Greenfoot in only two lines of code. Part 4 of the Greenfoot Tutorial for the Eduqas / WJEC GCSE 2016 specification. 4. Remove Objects Greenfoot Tutorial 1. Removing Objects Watch on YouTube: Open the editor for your main character . Underneath the if statements for using the arrow keys is where we type the removal code . If you have chosen a different collectible object, type the exact name of that class instead of Orange (e.g. Apples or Ants). 2. Add Danger to your Game Use the same code as you did earlier but change the class (instead of Orange. class I have chosen Sheep. class ). Time to code your main character to be removed if they are touched by the enemy objects ! Open the editor for your enemy class . The removal code is placed beneath the code you have already written. Check out the extension page if you want the game to stop when the main character is removed. < Part 3 - Random Movement Part 5 - Play Sounds >

  • Greenfoot Guide #1 | World Setup | CSNewbs

    Learn how to start a new Greenfoot program and set up the world and actors ready for the next steps in creating a game. Part 1 of the Greenfoot Tutorial for the Eduqas/WJEC GCSE 2016 specification. 1. Setup & Populating the World Greenfoot Tutorial 1. Open Greenfoot This tutorial uses Version 2.4.2 which is the version students are given to use in the WJEC/Eduqas Component 2 exam . Click here for more information and how to download 2.4.2 . If you are using a more recent version the code should still work but the look of the program in the screenshots may be different. In the Component 2 exam of the 2016 WJEC/Eduqas specification you would skip ahead to the New Object Placements stage further down this page as the classes should be set up for you. Watch on YouTube: 2. New Scenario For a new project, click ' Scenario ' and then ' New '. If you are using a more recent version of Greenfoot select ' New Java Scenario '. Save this new project in a suitable location such as a folder named 'Greenfoot' . You may wish to save this project as ' SimpleGame ' or ' ExampleGame '. 3. Setup the MyWorld class The first thing to do is to create a subclass of World called MyWorld which becomes our background object. Right-click on the World class and select 'New subclass... ' Set the New class name to MyWorld . Choose any image from the 'backgrounds ' image category. I have chosen the 'cell.jpg ' image. Click the Compile button in the bottom right of the Greenfoot window to save the program . 4. Create the Main Character class Now to create a new class for the main character. Right-click on the Actor class and select 'New subclass... ' Give the new object an appropriate name and choose a relevant image . I have named my class 'Sheep ' and selected the sheep.png image. 5. Right-click on Actor and create two more classes: Collectable objects to pick up (e.g. my orange) An enemy character to avoid (e.g. my elephant) Don't forget to compile the program. Watch on YouTube: After creating your classes you must move them over to the game world. This is known as populating the world . 1. New Object Placements Right-click on your main character object and select the top option e.g. 'new Sheep()'. Drag your mouse to the world and click to drop it. Complete the following actions: Place 1 main character object. Place 5 collectible objects. Place 2 enemy objects. 2. Save the World Once you have populated your world with objects then right-click anywhere on the background and select 'Save the World '. This saves the positions of each object so that it won't reset every time you start a new game. You can close the MyWorld code that automatically opens when you save the world, we never add any code to this window. Part 2 - Movement (Arrow Keys) >

  • Python | Section 4 Practice Tasks | CSNewbs

    Test your understanding of selection (if statements) and operators (mathematical and logical). Try practice tasks and learn through text and images. Perfect for students learning GCSE Computer Science in UK schools. top Python - Section 4 Practice Tasks Task One: Spanish Numbers Create a very simple Spanish translation program. Let the user enter a number between one and four then print the Spanish word for that number using if , three elif s and else . One in Spanish is uno , two is dos , three is tres and four is cuatro . If they enter anything else print “I only know 1 to 4 in Spanish!” . Example solutions: Enter a number between 1 and 4: 3 tres Enter a number between 1 and 4: 5 I only know 1 to 4 in Spanish! Task Two: School Trip A school is organising a trip to Alton Towers . The coaches they are hiring can fit 45 people . Enter the total number of people going on the trip and work out how many coaches will be full (using integer division ) and how many people will be left over on a partly full coach (using modulo division ). Example solutions: How many people are going on the trip? 100 There will be 2 full coaches and 10 people on another coach. How many people are going on the trip? 212 There will be 4 full coaches and 32 people on another coach. Task Three: Driving Tractors There are different rules in the United Kingdom for what farmers at certain ages can drive . Ask the user to input their age and then output the relevant information below: Children under 13 cannot drive any tractors. A trained and supervised 13 to 15 year old can drive a low-powered tractor on private flat grass. 16 year olds with a provisional category F licence can drive tractors less than 2.45 metres wide. Young adults from 17 to 20 with the correct licence and training c an drive tracked vehicles that weigh less than 3,500kg. Adults over 21 years old , with the correct licence and training, can drive all types of tractor. Note: Always be safe around machinery in farms regardless of your age. Driving without adequate training and a licence is illegal. Example solutions: How old are you? 8 You cannot drive any type of tractor. How old are you? 13 If you are trained and supervised you can drive a low-powered tractor on private flat grass. How old are you? 19 With the correct licence and training you can drive tracked vehicles that weigh less than 3,500kg. Task Four: Avoid the Three Choose a category like planets , people in your class or months of the year. Secretly choose three of them . Ask the user to enter a word in your category. If they enter one of the three that you chose, they lose . Example solutions: I have secretly selected three months you must avoid! Enter a month of the year: April AHA! You chose one of the secret months, you lose! I have secretly selected three months you must avoid! Enter a month of the year: December Well done, you didn't choose one of my three! ⬅ 4c - Logical Opera tors 5a - Random ➡

  • 4.3 - Binary Calculations - Eduqas GCSE (2020 Spec) | CSNewbs

    Learn about how to perform binary addition and binary subtraction. Based on the 2020 Eduqas (WJEC) GCSE specification. 4.3: Binary Calculations Exam Board: Eduqas / WJEC Specification: 2020 + What are binary calculations? Binary addition and binary subtraction are methods of adding or subtracting binary values without having to convert them into denary. How to add binary numbers: How to subtract binary numbers: Overflow & Underflow Errors Overflow and underflow errors occur when there is not enough space to accurately represent a binary number in the bits available . What is an overflow error? An overflow error occurs when a binary value is too large to be stored in the bits available . In technical terms, an overflow error occurs if a carry (remainder) is present on the most significant bit (MSB ). The CPU then sets the overflow flag to true . The most significant bit (MSB ) is the largest bit (always the one furthest to the left ) of a binary value (e.g. 128 for an 8 bit value). A flag is an alert signal . It is either on or off. The overflow flag is turned on by the CPU when an overflow occurs. What is an underflow error? An underflow error occurs when a number is too small to be stored in the bits available . The value is too close to 0 to be accurately represented in binary. Q uesto's Q uestions 4.3 - Binary Calculations: 1a. Describe the terms ' most significant bit ' and ' flag '. [ 2 ] 1b. Using the terms from 1a , explain what an overflow error is. [ 2 ] 1c. Describe what is meant by an underflow error . [ 2 ] 2. Add together the following binary values. If an overflow error occurs you must state one has occurred. a. 010110012 and 010001012 [2 ] b. 110110112 and 010111012 [2 ] c. 001101102 and 011010112 [2 ] d. 110110112 and 010101112 [2 ] e. 011011012 and 110101102 [2 ] 3. Subtract the following binary values; put the first value on top of the second value: a. 100110102 and 000110002 [2 ] b. 110110112 and 010111012 [2 ] c. 011101102 and 011010112 [2 ] d. 110110112 and 010101112 [2 ] e. 111011012 and 110101102 [2 ] Watch on YouTube Watch on YouTube 4.2 Signed Binary Theory Topics 4.4 - Arithmetic Shift

  • 2.2 - Boolean Algebra - Eduqas GCSE (2020 spec) | CSNewbs

    Learn about the eight rules of Boolean algebra expressions. Based on the 2020 Eduqas (WJEC) GCSE specification. 2.2: Boolean Algebra Exam Board: Eduqas / WJEC Specification: 2020 + Boolean algebra is used to simplify Boolean expressions so that they are easier to understand. Because calculations can use dozens of logical operators, they are simplified in Boolean Algebra using symbols rather than words. Take your time and don't panic. In an exam, you might get a list of identities (rules) to use. One tip to solving boolean algebra is to imagine that A and B are real expressions . In the examples on this page, imagine: A represents the true statement 'the sky is blue' B represents the true statement 'grass is green' 0 always means FALSE 1 always means TRUE Boolean Symbols A = NOT A A . B = A AND B A + B = A OR B Boolean Identities are the rules that are used to simplify Boolean expressions. Each identity (law) has an AND form and an OR form , depending on whether AND or OR is being used . Commutative Law AND form: OR form: This law just switches the order of the expressions . For example, 'sky is blue' AND 'grass is green' makes logical sense in either order. Idempotent Law = AND form: OR form: This law removes repetition . Complement Law NOT AND form: The sky cannot be blue and not blue at the same time, so it must be 0 (FALSE). OR form: The sky is blue or not blue must be 1 (TRUE) as it has to be one of these options. Identity Law AND form: 1 represents TRUE . Both statements are true so it can be simplified as just A . OR form: 0 represents FALSE . Because A is true, you can ignore the false statement and it can be simplified as just A . Annulment Law AND form: 0 represents FALSE . Even though A is true, a statement cannot be true and false at the same time, so it must be 0 (FALSE). OR form: 1 represents TRUE . Both statements are true so this can be simplified as just 1 (TRUE). Absorption Law AND form: OR form: Absorption law reduces a bracket into one value. If the first A is true then both values in the brackets are true but if the first A is false then both values are false. Therefore this equation relies entirely on A and can be simplified as just A . Association Law ( ) AND form: OR form: This law separates a bracketed expression that uses the same operator inside and outside the brackets by removing the brackets . Distribution Law ( ) = ( ) ( ) AND form: OR form: The value outside of the bracket (e.g. A) is multiplied by both values inside the brackets , forming two new brackets which are linked by the logical operator formerly within the bracket . Notice that the logical operator role is switched , e.g. AND switches from within the brackets, to between the new brackets. A note about distribution law - The three values may not necessarily be three separate letters (e.g. A, B and C) as B or C could be NOT A for example. A NOT value is considered a new value , e.g. A and Ā are separate values. Another note about distribution law - Exam questions may ask you to perform the distribution law (or any law) in reverse . For example, converting (A+B) . (A+C) into A + (B.C) Boolean Algebra Exam Question Some previous exam questions have listed helpful laws for you but others haven't, so you should know each individual law . In a previous exam, the candidates were given three general laws to help them . P, Q and R just represent three different values. P . 1 = P (Identity Law) P . Q + P . R = P. (Q + R) (Distribution Law) P + P = 1 (Complement Law) Using the rules above , candidates were asked to simplify the following expression : X = A . B + A . B The general laws have been give n to you for a reason. You need to look at the laws provided and see which one currently matches the expression in front of you . If you look closely in this example, the second law is very similar to the expression you are asked to simplify so you can use it to make the first simplification, just swap P for A, Q for B and R for NOT B: Using this law P . Q + P . R = P. (Q + R) X = A . B + A . B simplifies as: X = A . (B + B) Now you need to see which of the three provided laws can be used with the current expression . The third law is very similar to the expression you now need to simplify further , just swap P for B and NOT P for NOT B: Using this law P + P = 1 X = A . (B + B) simplifies as: X = A . (1) And finally, there is one law left to use. The first law is very similar to the expression you now need to simplify further , just swap P for A. Using this law P . 1 = P X = A . (1) simplifies as: X = A You have now used all three laws and the expression is fully simplified . Remember - Look at the laws that you have been given and see which law matches your expression . Q uesto's Q uestions 2.2 - Boolean Algebra: 1. Draw the example equations and write a brief description of each of the eight Boolean laws : Commutative Law Idempotent Law Complement Law Identity Law Annulment Law Absorption Law Associate Law Distributive Law 2. Below are three Boolean identities: P . P = 0 (P + Q) . R = (P . R) + (Q . R) P + 0 = P Using the three rules above , simplify the following expression: X = (A + B) . Ā This law is called ' Inverse Law ' in the Eduqas 2016 teacher guidance but ' Complement Law ' in the 2020 specification. This law is called ' Zero and One Law ' in the Eduqas 2016 teacher guidance but ' Annulment Law ' in the 2020 specification. This law is called ' Associate Law ' in the Eduqas 2016 teacher guidance but ' Association Law ' in the 2020 specification. This law is called ' Distributive Law ' in the Eduqas 2016 teacher guidance but ' Distribution Law ' in the 2020 specification. 2.1 - Logical Operators Theory Topics 3.1 - Network Characteristics

  • 3.1a - Network Types & Performance - OCR GCSE (J277 Spec) | CSNewbs

    Learn about the factors that affect the performance of networks, as well as different types of network types such as LAN and WAN. Based on the J277 OCR GCSE Computer Science specification (first taught from 2020 onwards). 3.1a: Network Types & Performance Exam Board: OCR Specification: J277 Watch on YouTube : LAN & WAN Network Performance Client-Server Network Peer-to-Peer Network Star Topology Mesh Topology What is a network? A network is more than one computer system connected together allowing for communication and sharing of resources . Network Types Networks can be split into different types , usually categorised by their geographical distance apart and the area that they serve. Local Area Network Wide Area Network Client-Server Network Clients make requests to a server , the server manages that request and responds. For example, if the user (client) makes a request to access www.bbc.co.uk to a web server. Large services like Amazon and Google will need very powerful servers to handle millions of requests a second. The client is completely dependent on the server to provide and manage the information. The server controls network security , backups and can be upgraded to manage higher demand. Advantages: The network can be controlled centrally from the server to easily backup data and update software . Hardware, software and resources can be shared across the network, such as printers, applications and data files . The network allows for improved scalability , meaning more clients can be easily added to the central server . Disadvantages: Large amounts of traffic congestion will cause the network to slow down . If a fault occurs with the server then the whole network will fail . IT technicians may be required to manage and maintain the network . Malware , such as viruses, can spread quickly across the network. Peer-to-Peer Network For peer-to-peer networks , data is shared directly between systems without requiring a central server . Each computer is equally responsible for providing data. Peer to peer is optimal for sharing files that can then be downloaded. Disadvantages: Without a dedicated server there is no central device to manage security or backups . Backups must be performed on each individual system. Computer performance will decrease with more devices connected to the network, especially if other machines are slow. Advantages: This is a simpler network than client-server to set up as no server is required . Clients are not dependent on a server . Perfect for quickly sharing files between systems , such as downloading media files. A local area network (LAN ) has computer systems situated geographically close together , usually within the same building or small site , like a school or office . The network infrastructure of a LAN (such as servers and routers) is usually owned and managed by the network owner . A wide area network (WAN ) has computer systems situated geographically distant to each other, possibly across a country or even across the world . WANs often use third party communication channels , such as connections by internet services providers like BT or Virgin Media. Data Packets When sending data across a network, files are broken down into smaller parts called data packets . Whole files are too large to transfer as one unit so data packets allow data to be transferred across a network quickly . Each packet of data is redirected by routers across networks until it arrives at its destination. Data packets may split up and use alternative routes to reach the destination address. When all the packets have arrived at the destination address the data is reassembled back into the original file. What is a network topology? Network topology refers to layout of computer systems on a local network . Devices in a network topology diagram are often called 'nodes' . Two types of typology are star and mesh . 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 . Performance There are several different factors that can affect the performance ( speed ) of a network, such as: The bandwidth available * Interference (e.g. thick walls) Number of users at the same time Distance to travel / signal strength Number of data collisions Amount of data to transfer * Bandwidth is the maximum amount of data that can be sent across a network at once . Q uesto's Q uestions 3.1a - Network Types & Performance: 1a. Describe the difference between a LAN and WAN . [2 ] 1b. Give an example of how a LAN and a WAN could each be used . [ 2 ] 2 a. Describe how peer-to-peer networks and client-server networks function. 2b. Give one use for both types of network. 3. Draw and label diagrams of client-server , peer-to-peer , star and mesh networks. [8 ] 4. 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 ] 5. State five factors that could affect the performance of a network . [5 ] 2.5 - Compression 3.1b - Network Hardware & Internet Theory Topics

  • 5.1.2 - Types of Device | F160 | Cambridge Advanced National in Computing AAQ

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

  • 5.1 - Data Types & Sources | Unit 2 | OCR Cambridge Technicals | CSNewbs

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

  • 1.2 - Designing Algorithms - OCR GCSE (J277 Spec) | CSNewbs

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

  • HTML Guide 9 - Colours & Fonts | CSNewbs

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

  • HTML Guide 5 - Images | CSNewbs

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

  • 1.1 - The CPU | OCR A-Level | CSNewbs

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

© CSNewbs 2026

The written, video and visual content of CSNewbs is protected by copyright. © 2026
bottom of page