Can You Compute?
  • HOME
    • Class of 2017
    • COVER LESSON FB
    • Yr 10: Program of Study 2016
    • Yr 11:Coming soon
    • Student Showcase
  • KS3
    • Term 6: Databases
    • Term 5 Scratch
    • Term 4 Websites
    • Term 3 Spreadsheets
    • Term 2: Binary & Algorithms
    • Term 1: Basics and Hardware
  • Yr 9
    • Year End Examination
    • L13-15: School Brochure
    • L12: Building a Computer
    • L11: Buying a House
    • L10: Logic Gates
    • L9: Presentations
    • L8: Binary
    • L7: CS Alan Turing
    • L6: Spreadsheets
    • L5: JS in an Hour!
    • L4: Intro to Coding
    • L3: IT Review and Mail Merge
    • L2: IT Letter Writing
    • L1: CS Compression
  • J276/01
    • Unit 1 Overview
    • EPIC FAILS
    • 1.1 System Architecture >
      • L1: The CPU
      • L2: The CPU in action
      • L3: CPU Recap
      • L4: Intro to LMC
      • L5: Problem solving with LMC
      • L6: LMC Subtraction
      • L7: LMC Looping
      • L8: LMC Multiplication
      • L9: Embedded Systems
      • L10: End of Term Exam
    • 1.2 Memory >
      • L1: RAM, ROM & MEMORY
      • L2: What do you know?
    • 1.3 Storage >
      • L1: Storage part 1
      • L2: Storage part 2
      • L3: Storage recap
    • 1.4 Wired / Wireless Networks >
      • L1: Introduction
      • L2: P2P & CS
      • L3: Hardware
      • L4: The Internet
      • L5: Web Server TO DO
      • L5: End of Unit Test
    • 1.5 Network topologies, protocols and layers >
      • L1: Topologies
      • L2: Protocols
      • L3: Packets and Layers
      • L4: Packets Games
      • L5: Routing Game
      • L6: End of Unit Test
    • 1.6 System Security
    • 1.7 System Software >
      • L1: The Operating System
      • L2: Utility Software
      • L3: GUI and Games
      • L4: Unit Test
  • J276/02
    • Unit 2 Overview
    • 2.1 Algorithms >
      • L1: Intro to Algorithms
      • L2: The Knight's Tour
      • L3: Bresenham
      • L4: Searching Algorithms
      • L5: Bubble Sort
      • L6: Insertion Sort
      • L7: Merge
      • L8: Sorting Recap
      • L9: Creating Algorithms
      • L10: Pseudocode
      • L11: Interpreting Algorithms
      • L12: End of Unit Test
    • 2.2 Programming Techniques >
      • Coding Intro
      • L1: Programming Concepts
      • L2: Sequence, Selection & Iteration
      • L3: SSI Practice
      • L4: String Manipulation
      • L5: Secret Codes
      • L6: File Handling
      • L7: Use of records to store data
      • L8: SQL
      • L9: SQL Python
      • L10 ,11, 12: Arrays
      • L13: Functions
      • L14: Data Types
      • L15: Casting
      • L16 -17: Test and Code
    • 2.3 Robust Programs >
      • L1 : Defensive Design
      • L2 : Testing Programs
    • 2.4 Computational Logic >
      • L1: Comp. Logic 1
      • L2: Comp. Logic 2
      • L3: Operators (Python)
    • 2.5 Translators & Language >
      • L1: Types of Languages
      • L2: Translators
    • 2.6 Data Representation >
      • L1: Units
      • L2: Numbers Binary
      • L3: Binary Addition
      • L4: Hexadecimal
      • L5: Recap
      • L6: Characters
      • L7: Images
      • L8: SenseHAT images
      • L9: Sound & Sampling
      • L10: Code Sound
      • L11: Compression Part 1
      • L12: Compression Part 2 >
        • Compression
      • What do you know?
  • J276/03 NEA
    • Overview
    • Part One
    • Part Two
    • Analysis
    • Success Criteria
    • Design - Algorithms
    • Pseudocode
    • Testing
  • Py
    • Coding Concepts
    • Writing your first Program
    • Python Pages
    • Python Playground
    • Strings
    • Python Operators
    • Functions
    • Conditions
    • Try and Except
    • Break and Continue
    • Odd codes
  • Py +
    • Looping
    • Why does my code not work?
    • Errors
    • Validation
    • Lists
    • Lists again
    • Looking for data in String
    • Writing to Files
    • Read, Write & Sorting Data
  • CODING
    • Magic Python
    • Alan Turing
    • Brian the Turtle
    • Grade Calculator
    • Nested IF Hotels
    • Vending Machine
    • A Looping Menu
    • For
    • Christmas Coding
    • JS in an Hour!
    • CSS + HTML
    • Medical Claims
    • Hour of Code 2015
  • Contact
    • Dictionaries - coming soon
    • L2:

lesson 3: ict
letter writing part 2
review and mail merge

Lesson 3: Letter Writing


Last Lesson

Last lesson you learnt about how to create a 'professional' letter.  Do you remember what the features are?  Tell the students on your table.
Main:
  1. You will have completed your letter for HW, load it up.
  2. Your teacher will direct you to another computer to 'proof read' another student's letter.
  3. Use the MS Word Review Tools
  4. Your teacher will demonstrate this or you can refer to the video
  5. Review another student's work and identify and comment on the areas of the letter that are 'unprofessional' giving your reasons why.
  6. Return to your computer and read the comments, make the changes that are suggested.
Review Tools
Completing a Mail Merge:

Most businesses will want to send out a letter to many customers or people, consider Tescos writing to all its customers to sent them money off vouchers.  Writing each address would take a very very long time, so we can use a tool called a Mail Merge.

  1. Practice a Mail Merge as you teacher walks you through the stages.
  2. Download the letter and the addresses below​
complaint-letter-template.doc
File Size: 28 kb
File Type: doc
Download File

customer_addresses_one.xlsx
File Size: 12 kb
File Type: xlsx
Download File

  1. Now Mail Merge the addresses below with your own letter, use the picture guide on the right to help you.
customer_addresses_two.xlsx
File Size: 12 kb
File Type: xlsx
Download File

Mail Merge Guide
What have you learnt today?
  • Try this Quiz
  • HOME
    • Class of 2017
    • COVER LESSON FB
    • Yr 10: Program of Study 2016
    • Yr 11:Coming soon
    • Student Showcase
  • KS3
    • Term 6: Databases
    • Term 5 Scratch
    • Term 4 Websites
    • Term 3 Spreadsheets
    • Term 2: Binary & Algorithms
    • Term 1: Basics and Hardware
  • Yr 9
    • Year End Examination
    • L13-15: School Brochure
    • L12: Building a Computer
    • L11: Buying a House
    • L10: Logic Gates
    • L9: Presentations
    • L8: Binary
    • L7: CS Alan Turing
    • L6: Spreadsheets
    • L5: JS in an Hour!
    • L4: Intro to Coding
    • L3: IT Review and Mail Merge
    • L2: IT Letter Writing
    • L1: CS Compression
  • J276/01
    • Unit 1 Overview
    • EPIC FAILS
    • 1.1 System Architecture >
      • L1: The CPU
      • L2: The CPU in action
      • L3: CPU Recap
      • L4: Intro to LMC
      • L5: Problem solving with LMC
      • L6: LMC Subtraction
      • L7: LMC Looping
      • L8: LMC Multiplication
      • L9: Embedded Systems
      • L10: End of Term Exam
    • 1.2 Memory >
      • L1: RAM, ROM & MEMORY
      • L2: What do you know?
    • 1.3 Storage >
      • L1: Storage part 1
      • L2: Storage part 2
      • L3: Storage recap
    • 1.4 Wired / Wireless Networks >
      • L1: Introduction
      • L2: P2P & CS
      • L3: Hardware
      • L4: The Internet
      • L5: Web Server TO DO
      • L5: End of Unit Test
    • 1.5 Network topologies, protocols and layers >
      • L1: Topologies
      • L2: Protocols
      • L3: Packets and Layers
      • L4: Packets Games
      • L5: Routing Game
      • L6: End of Unit Test
    • 1.6 System Security
    • 1.7 System Software >
      • L1: The Operating System
      • L2: Utility Software
      • L3: GUI and Games
      • L4: Unit Test
  • J276/02
    • Unit 2 Overview
    • 2.1 Algorithms >
      • L1: Intro to Algorithms
      • L2: The Knight's Tour
      • L3: Bresenham
      • L4: Searching Algorithms
      • L5: Bubble Sort
      • L6: Insertion Sort
      • L7: Merge
      • L8: Sorting Recap
      • L9: Creating Algorithms
      • L10: Pseudocode
      • L11: Interpreting Algorithms
      • L12: End of Unit Test
    • 2.2 Programming Techniques >
      • Coding Intro
      • L1: Programming Concepts
      • L2: Sequence, Selection & Iteration
      • L3: SSI Practice
      • L4: String Manipulation
      • L5: Secret Codes
      • L6: File Handling
      • L7: Use of records to store data
      • L8: SQL
      • L9: SQL Python
      • L10 ,11, 12: Arrays
      • L13: Functions
      • L14: Data Types
      • L15: Casting
      • L16 -17: Test and Code
    • 2.3 Robust Programs >
      • L1 : Defensive Design
      • L2 : Testing Programs
    • 2.4 Computational Logic >
      • L1: Comp. Logic 1
      • L2: Comp. Logic 2
      • L3: Operators (Python)
    • 2.5 Translators & Language >
      • L1: Types of Languages
      • L2: Translators
    • 2.6 Data Representation >
      • L1: Units
      • L2: Numbers Binary
      • L3: Binary Addition
      • L4: Hexadecimal
      • L5: Recap
      • L6: Characters
      • L7: Images
      • L8: SenseHAT images
      • L9: Sound & Sampling
      • L10: Code Sound
      • L11: Compression Part 1
      • L12: Compression Part 2 >
        • Compression
      • What do you know?
  • J276/03 NEA
    • Overview
    • Part One
    • Part Two
    • Analysis
    • Success Criteria
    • Design - Algorithms
    • Pseudocode
    • Testing
  • Py
    • Coding Concepts
    • Writing your first Program
    • Python Pages
    • Python Playground
    • Strings
    • Python Operators
    • Functions
    • Conditions
    • Try and Except
    • Break and Continue
    • Odd codes
  • Py +
    • Looping
    • Why does my code not work?
    • Errors
    • Validation
    • Lists
    • Lists again
    • Looking for data in String
    • Writing to Files
    • Read, Write & Sorting Data
  • CODING
    • Magic Python
    • Alan Turing
    • Brian the Turtle
    • Grade Calculator
    • Nested IF Hotels
    • Vending Machine
    • A Looping Menu
    • For
    • Christmas Coding
    • JS in an Hour!
    • CSS + HTML
    • Medical Claims
    • Hour of Code 2015
  • Contact
    • Dictionaries - coming soon
    • L2: