CST8116
Introduction to Computer Programming

Possessing the fundamentals of logic, problem-solving and programming language structure provides a solid foundation for further study in the field. Students develop introductory knowledge of computer programming with emphasis on problem analysis and design, using algorithms, pseudocode, flowcharts, UML Class Diagrams and testing, with the Java programming language used as a means to implement problem solution designs. Through an introduction to the Java programming language students use sequential structures, selection structures, repetition structures, variables, constants, methods, constructors, one-dimensional arrays, object-oriented programming, classes, objects, abstraction, encapsulation, inputs, outputs, coding conventions and documentation. Theory is reinforced with application by means of practical laboratory assessments.

This course provides the opportunity for you to achieve the following outcomes:

0006X01FWO - Computer Eng. Technology - Comp. Science

0006X03FWO - Computer Eng. Technology - Comp. Science

0336X01FWO - Computer Programming

0336X03FWO - Computer Programming

0336X07PAO - Computer Programming

0336X09FAO - Computer Programming

1561X01FWO - Computer Programming and Analysis

1561X03FWO - Computer Programming and Analysis

This course contributes to your program by helping you achieve the following Essential Employability Skills:

When you have earned credit for this course, you will have demonstrated the ability to:

1. Analyze a problem and define a solution in the form of an algorithm.

• Define an algorithm as a sequence of steps used to solve a problem.
• Use sequence structures, decision structures, and repetition structures in forming an algorithm.
• Use variables, constants, operators (arithmetic, comparison, and logic), one dimensional arrays, inputs, outputs and modules (methods) in forming an algorithm.
• Define and use objects, properties and behaviours, in forming an algorithm
• Refine existing algorithms to improve them.
• Determine the viability of the solution to the given problem.
• Differentiate between data, processing, and information.
• Recognize that there are multiple programming paradigms, examples include but are not limited to imperative (procedural, object-oriented), and declarative (logical, functional).

2. Document an algorithm using flowcharts, pseudocode and UML class diagrams.

• Define pseudocode and flowcharts, and explain the differences between them.
• Use flowcharts and pseudocode to document sequence structures, decision structures, and repetition structures of an algorithm.
• Use flowcharts and pseudocode to document algorithms.
• Use flowcharts and pseudocode to document variables, constants, arrays, program inputs, outputs of an algorithm.
• Use flowcharts and pseudocode to document arithmetic, comparison, and logic operators of an algorithm.
• Use flowcharts and pseudocode to document modules (methods), the calling of methods, and the returning from methods.
• Use UML Class Diagrams to document object designs.

3. Test algorithms and / or associated flowcharts, using a test plan.

• Test using a paper-oriented desk-check, using the specified format.
• Define the expected outputs to evaluate the validity of the expectations.
• Identify boundary conditions.
• Develop test conditions for both sides of boundaries.
• Develop comprehensive test data, including valid and invalid data.
• Test sequence structures, decision structures, repetition structures, and arithmetic and logic expressions, module (method) parameter and return values, using test data.

4. Describe and manipulate data as represented in a computer using the mathematics operations.

• Use data types numeric (integer, floating), string (text), as seen in a high-level programming language (e.g. Java).
• Use unary and binary arithmetic operators, comparison operators, logic operators and order of operations as seen in a high-level programming language (e.g. Java).

5. Implement the solution of a given problem by writing the appropriate code in a high-level language (Java).

• Use algorithms, flowcharts, programmer-centric test plans, UML Class Diagrams and reference to the Java Application Programmer Interface (API) documents to guide development of a Java program.
• Use the Java compiler to detect syntax errors, and to produce Java byte-code, and use the Java Virtual Machine to execute Java byte-code.
• Use Java sequence structures, selection structures (if, switch, ternary operator), and iterative repetition structures (while, do-while, for) to implement algorithms in Java including comparisons based on primitive types, as well as the String reference type.
• Perform input and output operations in Java at run time via the standard input stream with class Scanner, the standard output stream with formatted output (print, printIn, printf) and String concatenation, as well as use input from command line arguments at program start up.
• Explain and use Java modifiers, keywords, and reserved words including public, private, static, and final (final as used only with variables), this, and null.
• Use variables in a Java program including primitive and reference type variables, constant variables, instance and non-instance variables, variable scope and scope resolution, in the context of method-call-stack, heap-memory-area, classes, constructors, methods and objects.
• Use the object-oriented Programming OOP) concepts of abstraction and encapsulation to design and create Java classes and objects including constructors, accessors, mutators, and methods.
• Use references to one-dimensional array objects containing elements of primitive type values and references to one-dimensional array objects containing elements of reference type values (references to reference type instances) to store and manipulate data and /or process data into information.
• Practice industry recognized Java coding conventions in authoring Java program source code, and documenting Java code with single-line and multiline comments.

6. Describe the representation of data in Java manipulating the data using mathematics operations.

• Detail the characteristics of the primitive data types used in Java, including size, format, range and precision.
• Perform casts between Java primitive data types with reference to possible truncation and loss of precision.
• Use the primitive wrapper classes to convert numbers represented as String data, into appropriate numerical primitive type
• Evaluate expressions written in Java containing one or more of unary and binary arithmetic operators, comparison operators, logic operators, and order of operations.
• Explain in detail the concepts of integer overflow and underflow.
• Explain the concept of Not a Number (NaN), in the context of the floating numerical types.
• Use utility methods of the Java API Math class.
• Explain why float and double are not suited for financial calculations listing appropriate alternatives.

7. Install and use a Java Development Kit (JDK), documentation libraries, Integrated Development Environment (IDE) and version control software.

• Install and use a JDK, either Oracle JDK or an Open-JDK.
• Install and use the Eclipse IDE.
• Install and use Git software.
• Compile and execute Java programs consisting of multiple classes from the command prompt environment, as well as in the Eclipse IDE.
• Use Git commands within the command prompt environment, as well as within the Eclipse IDE.
• Explain the importance of reviewing software license agreements with respect to using software development tools and API libraries.

8. Create programmer-oriented test plans and memory maps using an integrated debugger to evaluate and document Java program execution.

• Use programmer-oriented test plan to predict variable value(s) at any point during program execution.
• Create memory maps to document the state of a Java program at points of execution, based on information reported by the debugging tools including stack, heap, primitive and reference types (including one-dimensional arrays of primitives and references).
• Use the IDE debug tools: breakpoints, step-in, step-over, locals, watch, and call stack.
• Use console output for debugging.
• Use the debugger to find run-time logic errors, correct those errors, verifying the corrective action.
• Use debugger to verify the correct logical operation and correct any logic errors detected (to be used in conjunction with the IDE debugger)

9. Create a local Git repository using Git commands to perform basic version control tasks on a Java program.

• Create, modify, and monitor a local Git repository using git init, git add, git commit, git status, git log.

The following list provides evidence of this course's learning achievements and the outcomes they validate:

Lab Activity(ies) (10%)

Validates Outcomes:  CLO 1, CLO 2, CLO 3, CLO 4, CLO 5, CLO 6, CLO 7, CLO 8, EES 1, EES 3, EES 4

Assignment(s) (20%)

Validates Outcomes:  CLO 1, CLO 2, CLO 3, CLO 4, CLO 5, CLO 6, CLO 7, CLO 8, CLO 9, EES 1, EES 3, EES 4, EES 10, EES 11

Hybrid Assignment(s) (10%)

Validates Outcomes:  CLO 1, CLO 2, CLO 3, CLO 4, CLO 5, CLO 6, CLO 7, CLO 8, CLO 9, EES 1, EES 3, EES 4

Quiz(zes)/Test(s) (20%)

Validates Outcomes:  CLO 1, CLO 2, CLO 3, CLO 4, CLO 5, CLO 6, CLO 7, CLO 8, CLO 9, EES 1, EES 3, EES 4

Practical Assessment (s) (20%)

Validates Outcomes:  CLO 1, CLO 2, CLO 3, CLO 4, CLO 5, CLO 6, CLO 7, CLO 8, EES 1, EES 3, EES 4, EES 10, EES 11

Final Exam (20%)

Validates Outcomes:  CLO 1, CLO 2, CLO 3, CLO 4, CLO 5, CLO 6, CLO 7, CLO 8, CLO 9, EES 1, EES 3, EES 4, EES 10, EES 11

Students who wish to apply for Prior Learning Assessment and Recognition (PLAR) need to demonstrate competency at a post-secondary level in all outlined course learning outcomes. Evidence of learning achievement for PLAR candidates includes:

• Portfolio
• Challenge Exam
• Project/Assignment

Grade Scheme