Problems and Solutions

Cod y Modiwl
CS10720
Teitl y Modiwl
Problems and Solutions
Blwyddyn Academaidd
2026/2027
Semester
Semester 2
Cyd-gysylltydd y Modiwl
Dr Thomas Jansen
Rhestr Ddarllen
Gweld ar Aspire
Cyd-Ofynion
CC12320 neu CS12320
Staff Eraill sy'n Cyfrannu

Dulliau Asesu

Math o Asesiad

Manylion Asesiad

Cyfran
Asesiad Semester Term Assessment: 10 Awr 10 worksheets or online quizzes (to be signed of in practicals). 40%
Arholiad Semester Exam Period Assessment: 2 Awr 60%
Asesiad Ailsefyll Resit Assessment: Essay 2000 Words 40%
Arholiad Ailsefyll Written Exam: 2 Awr 60%

Canlyniadau Dysgu

Wedi cwblhau'r modiwl dylai'r myfyrwyr fedru:

  1. Describe the concept of computability and give an example of a non-computable problem.
  2. Convert integers and rational numbers into binary representations, discuss properties of the different formats, perform simple arithmetic operations in binary representation
  3. Manipulate algebraic formulae and simplify basic algebraic expressions, including logarithms and exponents
  4. Perform matrix operations using 2 dimensional arrays.
  5. Analyse simple algorithms and compare their efficiency.
  6. Implement simple searches and sorts and compare their efficiency.
  7. Be able to implement simple recursive algorithms.

Disgrifiad cryno

This module provides an introduction to some aspects of theoretical computer science. It reviews fundamental mathematical concepts and illustrates how those concepts are implemented in computing contexts. Topics covered include computability; representation of numbers; fundamental arithmetic, dealing with basic algebraic expressions, logarithms and exponents; matrix operations; analysis of algorithms; searching and sorting; recursion.

Nod

The module makes students familiar with some fundamental aspects of general computer science and theoretical computer science. It helps to gain a deeper understanding of the working principles and limitations of computers and algorithms. It lays the foundations for most advanced modules in the second and final year.

Cynnwys

Each new topic is introduced in one or several lectures. Practicals are used to make topics more accessible and get students to explore them actively. Tutorials provide an opportunity to check on students' own learning by solving problems and discussing their solutions.
1. Computability
2. Fundamentals of Computing (representing numbers (integers; floating point); arithmetic)
3. Matrices and arrays (2D arrays; matrix addition and multiplication)
4. Algebraic expressions and their manipulation, including logarithms and exponents
5. Analysing algorithm complexity (asymptotic notation; worst, best, and average case)
6. Searching in a sorted array (linear, binary)
7. Sorting
8. Recursion (binary search, sorting)

Sgiliau Modiwl

Math o Sgiliau

Manylion Sgiliau
Datrys Problemau By means of algorithm design and analysis; making use of appropriate representations for data (using numbers as simple example).
Gwella dysgu a pherfformiad ei hun Weekly assessment helps students to continually assess and improve their learning and performance
Rhifedd Different binary representations of numbers.
Sgiliau pwnc penodol As laid out in the learning outcomes.
Sgiliau ymchwil Pointer to literature as part of the reading list
Technoleg Gwybodaeth Inherent to the subject matter.

Nodau

Mae'r modiwl hwn yn cydymffurfio a FfCChC Lefel 4