Module Descriptors

Computing

CS102: Computer Science (15 ECTS)

This module lays a broad foundation in Computer Science for students in the College of Science. It compliments the physical, life and mathematical sciences by providing the core principles of computing need for a degree in science, with an emphasis on programming. It is also the gateway to a degree in Computer Science.

Taught in Semester(s) 1 and 2. Examined in Semester(s) 1 and 2.

Workload: 300 hours (72 Lecture hours, 48 Lab hours, 180 Self study hours).

Module Learning Outcomes. On successful completion of this module the learner should be able to:

  1. identify the primary components of computers and networks.
  2. describe the architecture of a computer, and the computer representation of numbers
  3. explain the basics of logic circuits and microprocessor operation
  4. solve problems algorithmically, and describe these algorithms in pseudo-code.
  5. implement algorithms of various complexity in Python, and use Python's arithmetic and logical operators
  6. use decision structures (if-elif-else) and loop structures (while, for) in Python
  7. demonstrate understanding of the concepts of scope of a variable and of a function, write and use their own functions in Python, with parameters and return values
  8. write Python programs that use lists and nested lists, and demonstrate an understanding of slices and other operations on lists
  9. demonstrate and understand the principles of object oriented programming (OOP), and write Python programs that use OOP to solve problems

Indicative Content

The aim of this module is to equip the learner with knowledge, skills and competence in the fundamentals of computer science. It is designed to develop an understanding of how computers and computer systems work. It also introduces learners to the basics underlying modern high level functional programming languages, such as data types, loop structures, decision structures and functions. Furthermore, it develops the skill of dissecting a problem until an algorithm for its solution can be deduced and implemented.

Module Resources

Back