Computer Science (Mr seisay paper)

The process of removing unnecessary details from a problem to focus on the more important features to solve a problem.

• Decreases time • Reduces CPU usage • Reduces code complexity

A location in memory that stores data

Code written in order

Making a decision. If or Else statements

Repeating the code for a set number of times. For and While loops

A copy is made of the variable and passed into the subprogram. Changes only happen to the copy

• Ensures the orginal data isnt modified within the function • Helps avoid erros

• Decreases Memory

-More effiecent - Saves time and memory

• Data isnt protected • Risk of errors

• Sections of code where variables can be used and manipulated

• Variables created inside a function that can only be used within that specific block

• Variables that are declared outside all functions and are accessible from anywhere in the program

• Global Variables may change • Updating it may have consequences in other parts of a program that rely on the orginal value.

• Breaking a problem into a number of sub-problems, so that each sub-problem accompolishes an identifiable task

• Aims to improve the clarity and quality of a program

• A logical process being broken down into smaller componets until it cannot be broken down any further

• Programs are more easily and quickly written • Each subroutine can be indivdually tested. • Several programmers can simultaneously work on different modueles shortening development time.

• A queue is a data structure that stores items in the order they were added,

• A stack is a data structure that stores items in a way that the Last In, First Out

• A queue follows the First In, First Out (FIFO) principle, while a stack follows the Last In, First Out (LIFO) principle.

The process of automatically finding patterns, trends, and relationships in large sets of data, often using machine-learning techniques.