SS-1201 Programming Fundamentals 1.pdf, Study notes of Computer Science

Programming Fundamentals 1. Degree/Diploma. Bachelor of Science (Computer Science). Type of Module. Major Core. Modular Credits. 4. Total student Workload.

Typology: Study notes

2021/2022

Uploaded on 08/05/2022

nguyen_99
nguyen_99 🇻🇳

4.2

(80)

1K documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Effective S1 2016 Reformat Senate App 29 Jun 2016
Module code SS-1201
Module Title Programming Fundamentals 1
Degree/Diploma Bachelor of Science (Computer Science)
Type of Module Major Core
Modular Credits
4
Total student Workload
10 hours/week
Contact hours
4 hours/week
Prerequisite
None
Anti-requisite
None
Aims
This module provides a foundation in the design and implementation of well-structured computer
programs.
Learning Outcomes
On successful completion of this module, a student will be expected to be able to:
Lower order :
20%
Middle order:
60%
- implement pure functions and those with side effects
Higher order:
20%
Module Contents
-
Program development: programming cycle, programming tools
- Program design: abstraction, top down refinement, nested structures
- Control structures: sequence, selection, loop, recursion
- Data types: numeric, string, Boolean, composites
- Basic coding patterns: linear recursion, input-process-output, foreach, map, fold, select
-
Abstraction: functions, modules
- Debugging and testing
Assessment
Formative
assessment
Interactive Quizzes and Feedback
Summative
assessment
Examination: 50%
Coursework: 50%
-
2 class tests (20%)
-
1 written assignment (15%)
- 1 laboratory exercise (15%)

Partial preview of the text

Download SS-1201 Programming Fundamentals 1.pdf and more Study notes Computer Science in PDF only on Docsity!

Effective S1 2016 Reformat Senate App 29 Jun 2016

Module code SS-

Module Title Programming Fundamentals 1

Degree/Diploma Bachelor of Science (Computer Science)

Type of Module Major Core

Modular Credits

4 Total student Workload 10 hours/week

Contact hours 4 hours/week

Prerequisite None Anti-requisite None Aims This module provides a foundation in the design and implementation of well-structured computer programs.

Learning Outcomes On successful completion of this module, a student will be expected to be able to : Lower order : 20% - construct expressions using numeric, string, Boolean and composite values Middle order: 60% - construct nested code blocks using selection and iteration

  • implement pure functions and those with side effects
  • construct recursive functions Higher order: 20% - implement modular programs that can be tested and debugged easily
  • design test cases Module Contents
  • Program development: programming cycle, programming tools
  • Program design: abstraction, top down refinement, nested structures
  • Control structures: sequence, selection, loop, recursion
  • Data types: numeric, string, Boolean, composites
  • Basic coding patterns: linear recursion, input-process-output, foreach, map, fold, select
  • Abstraction: functions, modules
  • Debugging and testing Assessment Formative assessment

Interactive Quizzes and Feedback

Summative assessment

Examination: 50% Coursework: 50%

- 2 class tests (20%)

- 1 written assignment (15%)

- 1 laboratory exercise (15%)