Discrete Mathematics for Computer Science - XFX1066

Assessment 1: Other

Formative assessment will be provided through weekly activities, tutorial exercises and online tests (interactive quizzes).

Other

Assessment 3: In-Class Test

In Class Test under Exam Conditions (Final exam)

In-Class Test

Assessment 2: In-Class Test

In Class Test under Exam Conditions (Midterm)

Assessment 1: Written Assignment

Written Assignment 

This module&#39;s objectives are intended for students of information technology, and computer science. The emphasis is on utilising discrete math techniques from the two primary discrete math component fields, namely combinatorics or enumerative techniques, algorithmic sorting and graph theory. To put theory into practice a programming language such as Java/Python will be used throughout the practical sessions.

Huddersfield Business School

<a href="http://library3.hud.ac.uk/myreading/lists/CFM2175">http://library3.hud.ac.uk/myreading/lists/CFM2175</a>
 
Further free online resource 
<a href="https://www2.cs.uh.edu/~arjun/courses/ds/DiscMaths4CompSc.pdf">Discrete Mathematics for Computer Science (uh.edu)</a>

XFX1066 - Discrete Mathematics for Computer Science

Discrete Mathematics for Computer Science

Analyse graphs and apply sets and sequences to a problem context. 

Manipulate simple propositions and conduct proofs framed within the propositional calculus.

Demonstrate an understanding of fundamental algorithms, data structures,    set theory and propositional logic.

Apply the theory of formal languages and use associated mathematical models.

Appreciate the role of grammars and state machines as models for understanding languages and the relationship between different models of computation.