Year 7/8/9 Test 1- Excel Spreadsheet

Y11 Practical Exam with answer for Word/Excel and PowerPoint 2010

IGCSE Cambridge Computer Science Approved Pseudocode and logical gate

Python programming practical activities for Year 7/8/9 By N.T

Attached Microsoft Word Exam with Solution .

Year 8 Practical Revision Microsoft word / PowerPoint and Excel Exam

Paper 2: Algorithms, programming and logic Chapter 8: Programming 8.1 Programming concepts 8.2 Arrays 8.3 File handling

Core syllabus content SL core The topics that must be studied, including some practical work are: • Topic 1: System fundamentals (20 hours) • Topic 2: Computer organization (6 hours) • Topic 3: Networks (9 hours) • Topic 4: Computational thinking, problem-solving and programming (45 hours)

**Designing Strong Bridges with Popsicle Sticks ** with marking scheme Introduce the problem statement. In this project, your challenge is to design and build a bridge using only popsicle sticks and glue. Your goal is to create a bridge that showcases strong structural concepts and makes the most of how much weight it can carry compared to its own weight. The focus is on making a bridge that works really well and can support a lot of weight while using only a few materials. Let’s explore the world of building strong bridges and see how well you can balance making it strong and creative in your design.

IB DP Computer Science -Y12/13- Internal Assessment (IA) The Internal Assessment for Computer Science is an opportunity for you to showcase your algorithmic and technical prowess at developing software intended to solve a legitimate, real world problem for someone.

Chapter 9- Databases Candidates should be able to: 1 Define a single-table database from given data storage requirements 2 Suggest suitable basic data types 3 Understand the purpose of a primary key and identify a suitable primary key for a given database table 4 Read, understand and complete structured query language (SQL) scripts to query data stored in a single database table Notes and guidance • Including: – fields – records – validation • Including: – text/alphanumeric – character – Boolean – integer – real – date/time • Limited to: – SELECT – FROM – WHERE – ORDER BY – SUM – COUNT • Identifying the output given by an SQL statement that will query the given contents of a database table

IB DP Year 12/13- Test 5- Topic 3- Networks with Question and Answers

Typing Formal Letter using Microsoft Word Please feel free to leave any comments and rate the review . Thank you Mr. N.T

MS EXCEL Practical Test for Year 7/8 and 9

10.1 Data Types and Records: Select and use appropriate data types for a problem solution including integer, real, char, string, Boolean, date (pseudocode will use the following data types: INTEGER, REAL, CHAR, STRING, BOOLEAN, DATE, ARRAY, FILE) Show understanding of the purpose of a record structure to hold a set of data of different data types under one identifier Write pseudocode to define a record structure. Write pseudocode to read data from a record structure and save data to a record structure 10.2 Arrays: Use the technical terms associated with arrays (Including index, upper and lower bound) Select a suitable data structure (1D or 2D array) to use for a given task Write pseudocode for 1D and 2D arrays Write pseudocode to process array data Sort using a bubble sort Search using a linear search 10.3 Files: Show understanding of why files are needed Write pseudocode to handle text files that consist of one or more lines 10.4 Introduction to Abstract Data Types (ADT): Show understanding that an ADT is a collection of data and a set of operations on those data. Show understanding that a stack, queue and linked list are examples of ADTs Describe the key features of a stack, queue and linked list and justify their use for a given situation Use a stack, queue and linked list to store data (You will not be required to write pseudocode for these structures, but they should be able to add, edit and delete data from these structures) Describe how a queue, stack and linked list can be implemented using arrays

** IGCSE Computer Science -Year 10/11 ** 2023/2024 updated version Chapter 7-Algorithm design and problem-solving: ** Learning Objectives: ** 1 Understand the program development life cycle, limited to: analysis, design, coding and testing. 2 (a) Understand that every computer system is made up of sub-systems, which are made up of further sub-systems (b) Understand how a problem can be decomposed into its component parts © Use different methods to design and construct a solution to a problem 3 Explain the purpose of a given algorithm 4 Understand standard methods of solution 5 (a) Understand the need for validation checks to be made on input data and the different types of validation check (b) Understand the need for verification checks to be made on input data and the different types of verification check. 6 Suggest and apply suitable test data 7 Complete a trace table to document a dry-run of an algorithm. 8 Identify errors in given algorithms and suggest ways of correcting these errors. 9 Write and amend algorithms for given problems or scenarios, using: pseudocode, program code and flowcharts

IGCSE Computer Science for Year 10 and 11- Term 1-Test 2 from chapter 2 /3 and 4 Questions and Answers

IB DP Computer Science - Year 12/13 - Test 2- V2 - Topic 2

ICT Test for Year 8 and 9 MS Word and MS PowerPoint

IB DP Year 12/13-Test 4-Topic 2 and 3 with Question and Answers