Stann Creek Ecumenical College

Information Technology for CSEC

Course Outline 2017-2018

Number of Credits: 5

Duration of Sessions:
Single sessions: 40 minutes
Double Session 80 minutes

Teachers: Mr. Mark A. Pascual and Mrs. Sheryl Leslie

Course Description

This course is designed to prepared students to function effectively in this technological era, promote the development of computer-
related skills, provide a foundation for post-secondary education and to facilitate the development and application of problem-solving
skills in students. Additionally, this course is designed in conjunction with the Information technology CSEC syllabus in order to get
students prepared to sit the C.X.C. Information Technology CSEC exam.

Course Aims

 To make students have basic understanding of Microsoft Access, Word, Excel and PowerPoint.
 Be able to design a simple web site using HTML and CSS
 Be able to create I.P.O. tables, flow charts, write algorithms, use trace tables, with simple and advance programs in Pascal
using decision statements, loops and arrays.
 Have a good understanding of the following
o Fundamentals of Hardware and Software
o Applications and Implications of Information and Communication Technology
o Information Processing

Grading

Item Percentage
Theory Test 20%
Practical Test/Projects/SBAs 20%
Quiz 10%
Home Work and Classwork 10%
Participation/Books/Folders etc 6.6667%
Semester Final Exam 33.3333%
Total 100%
Resources

1. Information Technology for CSEC by Howard Campbell

2. Information Technology for CSEC 2nd edition by Kelvin Skeete and Kyle Skeete
3. Information Technology for CSEC 2nd edition by Leo Cato, Jan Holigan, Denzle Murray and Kati Paizee
4. I.T. for CSEC by Jan Holigan and Stephen Doyle
5. Log on to I.T. by Roland Birbal and Michele Taylor
6. Computer Exercises for CXC and RSA by Amilcar Umana and Eleanor Hasse
7. Information Technology and Communication Modules 1, 2, 3, and 4 by Amilcar Umana and Nelson Longsworth
8. Log on to I.T. for CSEC by Roland Birbal and Mihele Taylor
9. Various Websites on the internet
10.
 Semester Semester One Semester One Semester One
One
Objectives
Week Topic and Sub-Topics Assessment

Week #1 Students will be able to Information Processing Quiz #1

28th August, 2017
– 1st September, 1. Distinguish between
2017 data and information;
2. Explain the
characteristics and
functions of
Information
Processing;
3. Identify the sources of
data in specified
application areas;
 Data
 Information
 Information Processing
 Types/Forms of information systems
(Process control and Control Systems)
 Advantages and Disadvantage of
information processing
 Sources of Data
 Source Documents
 Human Readable Document
 Machine Readable Document
 Turnaround Document

Week #2 4. Describe methods of Information Processing Group Presentations

4th – 8th validation and  Errors (Validation)
September, 2017 verification of data;  Typographical Test #1
5. Identify appropriate  Transposition
verification and  Transmission
validation checks in a  Validation
particular scenario;  Parity Checks
6. Describe various  Check Digit
methods of life  Reasonableness Checks
organisaiton and  Length Checks
 access;
7. Select appropriate file
organisation for
particular application.
Week #3 Students will be able to: Problem Solving
11th – 15th 1. outline the steps in
September, 2017 problem-solving;
2. decompose a simple
problem into its
significant parts;
3. distinguish between
variables and
constants;
 Consistency Checks
 Data Type Checks
 Presence Checks
 Range Checks
 Verification
 Double Entry
 Proofreading
 File organization
 What is a file?
 Data file
 Record
 Field
 Storage Devices
 Sequential Access
 Direct Access
 File organization methods
 Serial Access Files
 Sequential Access Files
 Index – Sequential Access Files
 Direct Access Files
Quiz #2
 Definitions of Problem, Solution and
Problem solving
 Steps in problem-solving
 Creating I.P.O. chart
 Definitions of Literals, Identifier,
Constant and Variable
 Data Types and Definitions
 Integer
 Real
 Character
 String
 4. use appropriate data  Boolean
types;
Week #4 5. identify ways of Problems Solving Test #2 – Definitions, I.P.O.
18th – 22nd representing  Definition of Algorithm Chart,
September, 2017 algorithms;  Two types of Algorithm Flow chart and Pseudocode
 Pseudocode
6. develop algorithms to  Flowchart
solve simple  Flow Chart Symbols and meaning
problems;  Creating flow charts
 Writing Pseudocode
Week #5 Students will be able to: Program Implementation Quiz #3
25th – 29th 1. distinguish between  Generations of programming
September, 2017 low-level and high languages
level programming  First Generation
languages;  Second Generation
 Third Generation
2. distinguish among the  Fourth Generation
different generations  Fifth Generation
of programming  Levels of Programming Languages
languages;  Five Steps to Program Implementation
 Introduction to Pascal Compiler, File
3. list the sequence of Directories, name and saving a Pascal
steps associated with File.
implementing a
program;
Week #6 Students will be able to: Program Implementation Test #3(Practical) – Typing a
2nd – 6th October,  Writing programs in Pascal Pascal Program that input and
2017 1. declare elementary  Program Structure/Parts outputs.
data types;  Punctuation marks and their
usage
2. declare variables and  Reserved Words
constants;  Writing and Reading
 From Algorithm to Source
 3. Convert an algorithm Code
to Pascal source code;

4. Identify the
structure/parts of a
typical progrom

5. Properly use
punctuation mark and
reserved words when
writing source code.
Week #7 Students will be able to: Problem Solving
9th – 13th October, 1. develop algorithms  Developing Algorithms
2017 with arithmetic o Sequence of an algorithm
operators and o Developing algorithms with
assignment statements computations
to solve simple o Arithmetic Operators (+, -, *, /
problems; mod)
o Assignment statements

Week #8 Students will be able to: Program Implementation Test #4(Practical) – Pascal
16th – 20th 1. Use mathematical o Converting algorithms with program with calculation
October, 2017 operations when Calculations to Pascal Source Code
writing Pascal source o Documentation (comments and
code; heading)
o Declaring Variables and Constant
2. Use libraries and use o Library Inclusions
functions found within o Variable Initialization
these libraries;

3. declare variables and

constants;
 4. Initialize variables.
Week #9 Students will be able to: Problem Solving Quiz#4 – Writing
23rd – 27th 1. Declare multiple o Exchanging values in variables Algorithm(Flow Chart and
October, 2017 variables and use o Selection Construct Pseudocode) using the Null If
them in conjunction Null If Construct and If-Then-Else constructs
with assignment If – Then – Else Construct
statements to
exchange their values

2. Use the Null If and

the If-Then-Else
construct to solve
problems
Week #10 Students will be able to: Program Implementation Test #5(Practical) – Pascal
30th October, 1. Write and properly  Converting Algorithm with Null If and program with Selection
2017 – 3rd execute programs with If-Then-Else Constructs to Pascal Constucts
November, 2017 the Null If and If- Source Code
Then-Else construct.
Week #11 Students will be able to: Problem Solving
6th – 10th  Nested If Construct
November, 2017 1. Solve problems using  Relational Operators (Logical
the Nested If Operators)
construct;  Condition
 Operands
2. Have an  Identifying conditions in problem
understanding of statements
Relational Operators  Boolean operators
and use them in  Boolean Expression
conjunction with  Truth Tables
Boolean operators and
use them to solve
problems
 3. Use truth tables to
determine the outcome
of conditional
statements
Week #12 Students will be able to: Database Review
13th – 17th 1. Define database,
November, 2017 record and field;
2. Use data types when
creating tables;
3. Set primary keys;
4. Create, modify and
populate tables with
records;
5. Create relationships
between tables;
6. Create queries using
one or multiple tables,
using a single or
multiple criteria
 Definition of Database, Record, Field
 Data Types
 Creating and Populating a Tables
 Modifying Tables
 Creating relationship between tables
 Types of keys
 Setting a primary key
 Entering data in a child table
 Creating a single table query
 Creating multiple table query
 Creating query with one and with
multiple criteria
 Creating Queries with calculated fields
 Generating a report from tables and
queries
 Formatting reports
 Creating Reports with grouping and
summary data

7. Create queries with

calculated fields

8. Create and format

reports using the data
from tables or queries.
Week #13 Students will be able to: Spreadsheet Review
20th – 24th  Definition/Description of Spreadsheet,
November, 2017 1. Define terms worksheet, workbook, column, row,
associated with active cell, cell range, constant,
spreadsheets; formula, formula bar, function, label,
value, oblique heading and cell address
2. Properly name  Inserting and renaming worksheet
worksheets;  Entering labels and values
 Inserting and Deleting cells, columns,
3. Enter labels and and rows
values on a worksheet;  Formatting a worksheet
o Merge and center
4. Insert and delete rows o Adjusting font size
and columns from a o Border
worksheet; 
 Using Functions and Formulas
5. Format a worksheet; o Sum
o Average
6. Use functions and o Date
formulas to perform o Max
calculations on a o Min
spreadsheet; o Count
o Countif
7. Use absolute and o Lookup
relative cell o Vlookup
addressing when o If
replication formulas; o Rank
 Replicating formulas
8. Identify and explain  Error messages
error messages;  Using absolute and relative cell
addressing
9. Sort data;  Sorting Data
  Data extractions
10. Use simple and o Using advance and simple
advance filters to filters
extract data from  Creating graphs
worksheets  Linking cells in a worksheet and a
workbook
11. Create different types
of graphs

12. Reference data from

other worksheets
Week #14 Students will be able to use Database and Spreadsheet S.B.A. Test #6 ad Test #7 (Database
27th November, the various skills and and Spreadsheet S.B.A.s)
2017 – 1st knowledge acquired from
December, 2017 Database and Spreadsheet to
complete the assigned tasks
given for their SBA.
Week #15 Review Week Review Week Review Week
4th – 8th
December, 2017
Week #16 First Semester Exam First Semester Exam First Semester Exam
11th -15th
December, 2017
Christmas Christmas Break Christmas Break
Break 18 December, 2017 – 5th
th
18th December, 2017 –
January, 2018 5th January, 2018

Semester Semester Two Semester Two

Two
Week Content Assessment
Week #17 Students will able to use Word Processing Review Quiz #1
8th – 12th January, Microsoft Office Word to:  Creating a document
2018 1. Create a Word  Character, Paragraph and Page
document; Formatting
o Bold
2. Use various o Center
formatting features to o Underline
format a Word o Change font and font size
document; o Italicize
o Paragraph alignment (right,
3. Use columns and left, center and justify)
tables to neatly o Setting margins
organize text on a o Page orientation
Word document; o Superscript and subscript
o Line spacing
4. Insert graphics into a o Bulleted list
Word document;
 Columns and Tables
 Working with graphics
5. Perform block o Inserting clipart
operations such as o Repositioning and resizing clip
selecting text, cut,
art
copy and paste;
 Block Operation
o Selecting Text
6. Use footnotes, o Cut, copy and paste
endnotes, headers and
 Using undo and repeat
footers in a Word
 Headers and footers
document;
 Footnotes and endnotes
 Mail Merge use date from a Database
7. Use data from a or a Spreadsheet
Spreadsheet or a
 Database to create
merge documents.
Week #18 Students will be able to use Word processing S.B.A. Test #1 (Word Processing
15th – 19th the various skills and S.B.A.)
January, 2018 knowledge acquired from
Word Processing to complete
the assigned tasks given for
their SBA.
Week #19 Students will be able to: Program Implementation Quiz #2
22nd – 26th  Converting Algorithm with Nested If,
January, 2018 1. Use the Nested If Logical Operators and Boolean
construct to develop Expression to Pascal Source Code
Pascal source code to
solve various
problems;

2. Use logical operators

along with Boolean
expression to develop
Pascal source code to
solve various
problems.
Week #20 Students will be able to: Problem Solving Test #2
29th January, 2018  Iteration (Looping)
– 2nd February, 1. Use the For Do loop to o Count-Controlled (For… Do)
2018 solve problems loops
o Variable Initialization
2. Develop algorithms o Cumulative Totals
using the For Do loop o Writing algorithm with For…
Do loops
3. Have an o Solving problems with For …
understanding of Do loops
cumulative totals o Testing Algorithm for

4. Use trace tables to test
an algorithm
Week #21 Students will be able to:
5th – 9th February, 1. Use algorithms with
2018 For Do loops to write
Pascal source code.
Week #22 Students will be able to:
12th – 16th 1. Use the While Do and
February, 2018 Repeat Until loops to
write algorithms;
2. Understand and
explain sentinel,
infinite and finite
loop.
Week #23 Students will be able to:
19th – 23rd 1. Use algorithms with
February, 2018 While Do and Repeat
until loops to write
Pascal source code.
Week #24 Students will be able to:
26th February, 1. Use algorithms with
2018 – 2nd March, While Do and Repeat
2018 until loops to write
correctness
 Dry run
 Trace
 Trace Table
 Test Data
Program Implementation Quiz #3
 Converting Algorithm with For…Do
loops to Pascal Source Code
Problem Solving Test #3
 Iteration(Looping)
o Condition-controlled loops
(While…Do and Repeat…
Until Loop)
o Sentinel
o Infinite Loop
o Finite Loop
 Writing Algorithms with Condition-
Controlled Loops
 The Top-Down design approach to
problem-solving
Program Implementation Quiz #4
 Converting Algorithm with Condition-
Controlled Loops to Pascal Source
Code
Program Implementation Test #4
 Converting Algorithm with Condition-
Controlled Loops to Pascal Source
Code
 Pascal source code.
Week #25 Students will be able to: Program Implementation
5th – 9th March,
2018 1. Understand and
explain arrays;
2. Use arrays along with
a loop to store and
read values to and
from an array;
3. Traverse and search an
array;
 Testing and Debugging Techniques
 Types of Errors (Syntax, Run-Time
and Logical errors)
Test #5
 Arrays
 Declaring an array in Pascal (name,
size and data type)
 Storing Data in an array
 Array Initialization
 Writing Data from an array
 Traversing an array
 Searching an array
 Writing Algorithms with Arrays

4. Write algorithms for

problems that require
the use of arrays to
solve.
Week #26 Students will be able to use Program Implementation
12th – 16th March, algorithms using arrays to  Converting Algorithm with Arrays to
2018 write Pascal source code that Pascal Source Code
would solve problems that
requires the use of arrays.
Week #27 Students will be able to use Problem Solving S.B.A. Test #6
19th – 23rd March, the various skills and S.B.A. Compilation and completion
2018 concepts acquired in Problem
solving, Program Design and
implementation to complete
the Problem solving and
Programming section of the
S.B.A.
 Easter Easter Break Easter Break
Break 26 March, 2018 – 6th April,
th
26 March, 2018 – 6th
th

2018 April, 2018

Week #28 Students should be able to: Review: Fundamental of Hardware and
9th – 13th April, Software
2018 1. describe a general-
purpose computer
system;

2. explain the functions

of the major hardware
components of a
computer system;

3. outline the functions

and uses of primary
storage devices;

4. manipulate units of
storage;

5. compare the types of

secondary storage
media with respect to
portability, speed and
capacity;

6. use terms associated

with storage devices;

7. explain the uses of

various input devices
 and media;

8. state the types and

functions of output
devices;

9. describe how data are

stored and
manipulated within
the computer;

10. interpret the hardware

specifications of a
computer system;

11. distinguish between

systems programs
and application
programs;

12. explain the functions

of an operating
system;

13. distinguish among

multitasking,
multiprocessing and
multiprogramming;

14. explain the different

types of processing
modes;
 15. Distinguish between
types of user interface.
Week #29 Students will be able to: Review: Applications and Implications of Test
16th – 20th April, I.C.T.
2018 1. use terms associated
with data
communications and
networks;

2. distinguish among
Internet, intranet and
extranet;

3. explain concepts
associated with the
Internet;

4. describe measures to
secure data and
maintain data
integrity;

5. outline ways by which

information can be
misused;

6. describe appropriate
hardware and software
to meet the particular
needs of a given
application;
 7. describe current and
emerging
technological trends;

8. assess the impact of

Information
Technology on job
skills and careers;

9. describe the roles of

various personnel in
computer-related
professions.
Week #30 Review Week Review Week
23rd – 27th April,
2018
Week #31 Diploma Exams Diploma Exams
30th April, 2018 –
4th May, 2018
Week #32 Diploma Exams Diploma Exams
7th – 11th May,
2018
Week #33 CXC Review: Multiple Choice Items (Paper
14th – 18th May, 01)
2018
Week #34 CXC Review: Multiple Choice Items (Paper
21st May, 2018 – 01)
25th May, 2018
Week #35 CXC Review: Structured and Short answers
28th May, 2018 – (Paper 02)
1st June, 2018
Week #36 CXC Review: Structured and Short answers
4th – 8th June, (Paper 02)
2018
Week #37 CXC Review: Structured and Short answers
11th – 15th June, (Paper 02)
2018