DS820: Discrete Methods for Data Science

Study Board of Science

Teaching language: Danish
EKA: N340093112, N340093102
Assessment: Second examiner: None, Second examiner: External
Grading: Pass/Fail, 7-point grading scale
Offered in: Odense
Offered in: Autumn
Level: Master

STADS ID (UVA): N340093101
ECTS value: 10

Date of Approval: 14-03-2022


Duration: 1 semester

Version: Archive

Comment

The course is co-read with DM547, DM549 og MM537.

Entry requirements

None

Academic preconditions

Knowledge and skills corresponding to A-level in mathematics from the Danish ‘gymnasium’.

Course introduction

The course will train the students to deal with mathematical concepts important to Data Science. This is necessary for the students to be able to describe, analyze, and solve problems met in Data Science.

The course gives an academic basis for studying the topics of all Computer Science courses on later semesters.

In relation to the competence profile of the degree it is the explicit focus of the course to:

  • Give knowledge of several proof methods
  • Give the competence of analyzing and generalizing problems and algorithms met in Data Science
  • Give the skill of expressing one's knowledge in a clear and precise manner
  • Give skills to describe, analyze and solve Data Science problems applying methods and modeling formalisms from the core area of Data Science and its mathematical support disciplines

Expected learning outcome

The learning objectives of the course are that the student demonstrates the ability to:
  • formalize logic expressions correctly
  • use various proof methods such as direct proofs, proofs by contraposition, proofs by contradiction, and induction
  • use concepts, results, and techniques acquired in the course for solving concrete (known or new) problems
  • argue sufficiently for the chosen solutions
  • express problems, solutions, and arguments succinctly

Content

The following main topics are contained in the course:

  • Logic
  • Sets and cardinality
  • Functions
  • Proof techniques: Direct proof, proof by contraposition, proof by contradiction, and proof by induction
  • Number theory, including divisibility, primes, and congruences
  • Matrices: addition, multiplication, and transposition
  • Relations, including various representations of relations, closures, partial orders and equivalence relations
  • Introduction to graphs, including trees
  • Sequences and series, including convergence analysis

Literature

See itslearning for syllabus lists and additional literature references.

Examination regulations

Exam element a)

Timing

Autumn

Tests

Mandatory assignments

EKA

N340093112

Assessment

Second examiner: None

Grading

Pass/Fail

Identification

Full name and SDU username

Language

Normally, the same as teaching language

Examination aids

To be announced during the course

ECTS value

1

Exam element b)

Timing

January

Tests

Written exsame

EKA

N340093102

Assessment

Second examiner: External

Grading

7-point grading scale

Identification

Student Identification Card

Language

Normally, the same as teaching language

Duration

4 hours

Examination aids

All common aids are allowed e.g. books, notes, computer programmes which do not use internet etc.  

Internet is not allowed during the exam. However, you may visit system DE-Digital Exam when answering the multiple-choice questions. If you wish to use course materials from itslearning, you must download the materials to your computer the day before the exam. During the exam itslearning is not allowed. 

ECTS value

9

Indicative number of lessons

84 hours per semester

Teaching Method

At the faculty of science, teaching is organized after the three-phase model ie. intro, training and study phase.
  • Intro phase: 42 hours
  • Training phase: 42 hours, all of which are tutorials
In the intro phase a modified version of the classical lecture is employed, where the terms and concepts of the topic are presented, from theory as well as from examples based on actual data. In these hours there is room for questions and discussions. In the training phase the students work with data-based problems and discussion topics, related to the content of the previous lectures in the intro phase. In these hours there is a possibility of working specifically with selected difficult concepts. 

Teacher responsible

Name E-mail Department
Lene Monrad Favrholdt lenem@imada.sdu.dk Algoritmer

Timetable

Administrative Unit

Institut for Matematik og Datalogi (datalogi)

Team at Educational Law & Registration

NAT

Offered in

Odense

Recommended course of study

Profile Education Semester Offer period

Transition rules

Transitional arrangements describe how a course replaces another course when changes are made to the course of study. 
If a transitional arrangement has been made for a course, it will be stated in the list. 
See transitional arrangements for all courses at the Faculty of Science.