Module Specification

The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
1. Module Title Introduction To Programming
2. Module Code COMP101
3. Year Session 2023-24
4. Originating Department Computer Science
5. Faculty Fac of Science & Engineering
6. Semester First Semester
7. CATS Level Level 4 FHEQ
8. CATS Value 15
9. Member of staff with responsibility for the module
Mr K Dures Computer Science K.Dures@liverpool.ac.uk
10. Module Moderator
11. Other Contributing Departments  
12. Other Staff Teaching on this Module
Mrs J Birtall School of Electrical Engineering, Electronics and Computer Science Judith.Birtall@liverpool.ac.uk
Professor PW Wong Computer Science P.Wong@liverpool.ac.uk
Professor M Gairing Computer Science M.Gairing@liverpool.ac.uk
13. Board of Studies
14. Mode of Delivery
15. Location Main Liverpool City Campus
    Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
16. Study Hours 10

    10

    20
17.

Private Study

130
18.

TOTAL HOURS

150
 
    Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other
19. Timetable (if known)            
 
20. Pre-requisites before taking this module (other modules and/or general educational/academic requirements):

 
21. Modules for which this module is a pre-requisite:

 
22. Co-requisite modules:

 
23. Linked Modules:

 
24. Programme(s) (including Year of Study) to which this module is available on a mandatory basis:

25. Programme(s) (including Year of Study) to which this module is available on a required basis:

26. Programme(s) (including Year of Study) to which this module is available on an optional basis:

27. Aims
 

To introduce concepts and principles of problem solving by computer, and the construction of appropriate algorithms for the solution of problems. To demonstrate the principles underlying the design of high level programming languages. To give students experience and confidence in the use of a high level programming language to implement algorithms.

 
28. Learning Outcomes
 

(LO1) Be able to implement, compile, test and run programmes, to address a particular software problem.

 

(LO2) Understand how to include arithmetic operators and constants in a program.

 

(LO3) Be able to make use of libraries.

 

(LO4) Demonstrate the ability to employ various types of selection constructs in a program.

 

(LO5) Demonstrate the ability to employ repetition constructs in a program.

 

(LO6) Be able to employ a hierarchy of libraries/modules to provide a solution to a given set of requirements.

 

(LO7) Demonstrate the ability to use simple data structures like arrays in a program.

 

(LO8) Specific learning outcomes are listed above. General learning outcomes: An understanding of the principles and practice of program analysis and design in the construction of robust, maintainable programs which satisfy their requirements; A competence to design, write, compile, test and execute straightforward programs using a high level language; An appreciation of the principles of procedural programming; An awareness of the need for a professional approach to design and the importance of good documentation to the finished programs.

 

(S1) Communication (oral, written and visual) - Report writing

 

(S2) Time and project management - Personal organisation

 

(S3) Critical thinking and problem solving - Critical analysis

 

(S4) Numeracy/computational skills - Reason with numbers/mathematical concepts

 
29. Teaching and Learning Strategies
 

Teaching Method 1 - Lecture
Description: Delivery of theory followed by practical application
Attendance Recorded: Yes
Notes: (1 per week for 1 semester)

Teaching Method 2 - Laboratory Work
Description:
Attendance Recorded: Not yet decided
Notes: (1 per week for 1 semester)

Due to Covid-19, in 2021/22, one or more of the following delivery methods will be implemented based on the current local conditions.
(a) Hybrid delivery
Teaching Method 1 - Lecture
Description: Mix of on-campus/on-line synchronous/asynchronous sessions
Teaching Method 2 - Laboratory Work
Description: Mix of on-campus/on-line synchronous/asynchronous sessions

(b) Fully online delivery and assessment
Teaching Method 1 - Lecture
Description: On-line synchronous/asynchronous lectures
Teaching Method 2 - Laboratory Work
Description: On-line synchronous/asynchronous sessions

(c) Standard on-campus delivery
Teaching Method 1 - Lecture
Description: Mix of on-campus/on-line synchronous/asynchronous sessions
Teaching Method 2 - Laboratory Work
Description: On-campus synchronous sessions

 
30. Syllabus
   

Note: Throughout this syllabus, the conceptual aspects of problem solving, algorithm design and the nature of data are incorporated with the more specific and implementation-directed aspects of programming. The importance of developing reliable, robust and maintainable solutions is emphasised throughout Topics: Week 1: Introduction to computer systems. First programs. Week 2: Basic program ingredients. Week 3: Libraries Selection, Testing and Debugging Week 4: Selection (nested, Boolean). Week 5: Iteration (for, while). Week 6: Iteration, Modularisation, parameters. Week 7: Lists, global vars. Week 8: List parameters, 1-d array. Week 9: 1-d array, 2-d array. Week 10: 2-d Array processing. Week 11: Recap of module.

 
31. Recommended Texts
  Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
 

Assessment

32. EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
   
33. CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
  (101.5) Programming Assignment 1 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 12
  (101.6) Programming Assignment 2 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 12
  (101.4) Programming Assignment 3 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 13
  (101.3) Programming Assignment 4 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 13
  (101.1) Programming Assignment 5 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 16
  (101.2) Programming Assignment 6 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 16
  (101) Programming Assignment 7 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1 0 18