Hero image

Free Educational Resources from Mr. Noureddine Tadjerout

Average Rating4.64
(based on 35 reviews)

I am a versatile professional with a diverse skill set and a strong background in education and technology. As an accomplished Author, Teacher Trainer, Examiner, and certified Apple Teacher and VEX Robotics. I have honed my expertise in Computer Science and Mathematics education. Additionally, I hold the role of Curriculum Development Specialist, focusing on Computer Science, Engineering, and Microsoft Office. I am passionate about creating educational resources and assisting fellow educators.

243Uploads

96k+Views

239k+Downloads

I am a versatile professional with a diverse skill set and a strong background in education and technology. As an accomplished Author, Teacher Trainer, Examiner, and certified Apple Teacher and VEX Robotics. I have honed my expertise in Computer Science and Mathematics education. Additionally, I hold the role of Curriculum Development Specialist, focusing on Computer Science, Engineering, and Microsoft Office. I am passionate about creating educational resources and assisting fellow educators.
IB DP Year 12/13- CS -SL/HL - Paper 1- From Topic 1 to Topic 4
TadjeroutTadjerout

IB DP Year 12/13- CS -SL/HL - Paper 1- From Topic 1 to Topic 4

(0)
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)
IGCSE Computer Science -Year 10/11- Chapter 9-Databases- 2023/2024
TadjeroutTadjerout

IGCSE Computer Science -Year 10/11- Chapter 9-Databases- 2023/2024

(0)
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
Online E-Safety for year 7 and 8
TadjeroutTadjerout

Online E-Safety for year 7 and 8

(0)
You need to create a PowerPoint about online E-Safety and describe the online danger that can damage your devices and your health There are others who use the internet for illegal and unsavoury purposes. There are several dangers that we might come across when online: Make you sure to open the E-Safety-1 PowerPoint presentation first before you attempt E-Safety-2 PowerPoint Presentation Attached an example for you to follow on e safety 1 and 2 and how to prevent from malware/phishing and cyber bullying
IB DP Computer Science -Y12/13- Internal Assessment (IA)
TadjeroutTadjerout

IB DP Computer Science -Y12/13- Internal Assessment (IA)

(0)
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.
IGCSE Computer Science -Year 10/11- Chapter 7-Algorithm design and problem-solving- 2023/2024
TadjeroutTadjerout

IGCSE Computer Science -Year 10/11- Chapter 7-Algorithm design and problem-solving- 2023/2024

(0)
** 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
AS/A level - Computer Science  -Chapter 10 - Data Types and structures
TadjeroutTadjerout

AS/A level - Computer Science -Chapter 10 - Data Types and structures

(0)
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