# data[].attributes.body
Your Higher Assignment will be out of 40 marks and will normally take place at the end of January into the start of February.

It consists of two tasks, an SDD and a DDD task.

Each task has multiple parts (A, B and C), with each part being tackled and submitted independently of the others.

This means that in the classroom environment, Part A will be completed and handed in before Part B is issued.

You should tackle these parts individually as you would in the classroom.

# data[].attributes.body
Coding booklet containing examples of the code used at N6 level.

# data[].attributes.body
Reference language examples to help with writing Pseudocode and design.

# data[].attributes.body
Notes booklet containing all the information relating to Higher Software Design and Development.

# data[].attributes.body
Notes booklet containing all the information relating to Higher Database Design and Development.

# data[].attributes.body
Notes booklet containing all the information relating to Computer Systems.

# data[].attributes.body
Faculty YouTube channel containing narrated lessons for Business, Computing and ICT.

# data[].attributes.attachment_link.authors[].name
Gryffe High Business and Computing Science

# data[].attributes.attachment_link.title
Gryffe High Business and Computing Science

# data[].attributes.attachment_link.description
Welcome to the Faculty of Business and Computing Science at Gryffe High School.

# data[].attributes.body
Structure of the Higher Computing Science Course.

# data[].attributes.body
Learn how the computer stores Negative Integers.

# data[].attributes.body
SQA Past Papers and Marking Schemes.

# data[].attributes.attachment_link.title
SQA - NQ - Past papers and marking instructions

# data[].attributes.headline
Data Rep - Floating Point Representation

# data[].attributes.subject
Data Rep - Floating Point Representation

# data[].attributes.body
Learn how the computer stores Real Numbers.

# data[].attributes.body
Learn how the computer stores Text.

# data[].attributes.body
Learn how the computer stores Graphics.

# data[].attributes.attachment_link.title
1.4 Data Rep - Graphics - Bitmap v Vector

# data[].attributes.body
SQA Higher Computing Science qualification page.

# data[].attributes.body
Mandatory content examined at Higher Level.

# data[].attributes.body
Investigate the difference between the Iterative Development Cycle and Agile Development Methodologies.

# data[].attributes.body
Learn about the internal components of the computer, their purpose, and how they work together to improve system performance.

# data[].attributes.body
Learn about the Analysis stage and how analysis is carried out.

# data[].attributes.body
Learn how computers can make a positive impact on the environment through the use of intelligent systems.

# data[].attributes.body
Learn what security risks exist for organisations.

# data[].attributes.body
We will look at the different Design Notations used to plan, create Algorithms and design User Interfaces.

# data[].attributes.body
Learn what security risks exist for organisations.

# data[].attributes.body
Learn how to use different Data Structures like Parallel Arrays, Record Structures and Arrays of Records to store data.

# data[].attributes.body
We will learn about Scope and what that means for variables and Data Structures.

# data[].attributes.body
We will learn what Parameters are and how to pass data between sub-programs.

# data[].attributes.body
We will learn how to code in a modular format and look at Procedures and Functions.

# data[].attributes.body
We will learn about the different uses of Pre-Defined Functions and how to implement them in our code.

# data[].attributes.body
We will learn how to input data from a file and how to output data to a file.

# data[].attributes.body
We will learn about the Standard Algorithm - Linear Search and how to implement it in a program.

# data[].attributes.attachment_link.title
N6SDD 1.6.1 Standard Algorithm - Linear Search (N)

# data[].attributes.body
We will learn about the Standard Algorithm - Finding Minimum and how to implement it in a program.

# data[].attributes.attachment_link.title
N6SDD 1.6.2 Standard Algorithm - Finding Min (N)

# data[].attributes.body
We will learn about the Standard Algorithm - Finding Maximum and how to implement it in a program.

# data[].attributes.attachment_link.title
N6SDD 1.6.3 Standard Algorithm - Finding Max (N)

# data[].attributes.headline
Standard Algorithms - Counting Occurrences

# data[].attributes.subject
Standard Algorithms - Counting Occurrences

# data[].attributes.body
We will learn about the Standard Algorithm - Counting Occurrences and how to implement it in a program.

# data[].attributes.attachment_link.title
N6SDD 1.6.4 Standard Algorithm - Counting Occurrances (N)

# data[].attributes.body
We will learn about the testing phase of the Software Development Cycle.

# data[].attributes.body
Learn who we can protect ourselves and our computer from online risks.

# data[].attributes.body
We will learn how to evaluate our completed software solution and the areas to comment on in an evaluation report.

# data[].attributes.attachment_link.title
Higher Computing Science - Scotland - BBC Bitesize

# data[].attributes.attachment_link.description
Learning and revision resources to support the SQA Higher Computing Science specification (from 2018).

# data[].attributes.body
Recap on some Database definitions from N5.

# data[].attributes.attachment_link.title
N6DDD 2.0 Design (Entity Occurrence Diagrams) (N)

# data[].attributes.attachment_link.title
N6DDD 2.1 Design (Entity Relationship Diagrams) (N)

# data[].attributes.attachment_link.title
N6DDD 2.1 Design (Data Dictionaries) (N)

# data[].attributes.attachment_link.title
N6DDD 3.0 Implementation (Wildcards) (N)

# data[].attributes.headline
Implementation - Computed Fields & Aliases

# data[].attributes.subject
Implementation - Computed Fields & Aliases

# data[].attributes.attachment_link.title
N6DDD 3.2 Implementation (Computed Fields & Aliases) (N)

# data[].attributes.attachment_link.title
N6DDD 3.3 Implementation (Aggregate Functions) (N)

# data[].attributes.attachment_link.title
N6DDD 3.4 Implementation (Subqueries) (N)