DIM707 Discrete Mathematics

Code DIM707
Name Discrete Mathematics
Status Compulsory/Courses of Limited Choice
Level and type Undergraduate Studies, Academic
Field of study Mathematics and Statistics
Faculty
Academic staff Inta Volodko, Aleksandrs Matvejevs, Sergejs Smirnovs, Irina Eglīte, Ilona Dzenīte, Jeļena Mihailova, Marija Dobkeviča, Vaira Buža
Credit points 3.0 (4.5 ECTS)
Parts 1
Annotation Topics covered by the course include: sets, mappings, relations; combinatorics; boolean algebra; discrete circuits, automata. .
Contents
Content Full- and part-time intramural studies Part time extramural studies
Contact hours Independent work Contact hours Independent work
Set theory: Operations on sets. Mappings, types of mappings. Relations, types of relations. 18 20 0 0
Combinatorics: Permutations and combinations. Mathematical induction. Newton's binomial formula. 6 8 0 0
Mathematical logic: Expressions, operations on them. Normal form of Boolean functions. Polynomial of Boolean functions. 20 26 0 0
Discrete circuits, automata. 1 0 0 0
Predicates and quantifiers. The concept of syntax and semantics. 3 6 0 0
Consultations 10 0 0 0
Exam 2 0 0 0
Total: 60 60 0 0
Goals and objectives
of the course in terms
of competences and skills
To develop students' understanding of basic discrete mathematical concepts that are necessary to comprehend processes and algorithms in professional study courses. To develop students’ logical thinking and skills necessary to analyze solutions of problems when performing more complicated tasks within the framework of study courses of professional specialization.
Learning outcomes
and assessment
After successful completion of the study course a student is able to perform operations on sets, to determine the form of mappings and relations, to perform operatins on relations of sets. - Evaluation of students’ knowledge and skills is based on the results of homework assignments, tests and final examination.
Able to calculate the number of permutations and combinations; to prove a mathematical statement by mathematical induction method; to expand a binomial by Newton's binomial formula. - Students’ knowledge is tested based on the homework assignment and the assignment at the final examination.
Able to construct the truth table for a Boolean function; to find normal forms and polynomial of Boolean functions. - Students’ knowledge and abilities are assessed based on homework assignments, tests and final examination.
Able to plot the Boolean function geometrically and to minimize it; to determine whether the system of a Boolean function is full. - Test, homework assignment and several assignments at the final exam are used to assess students’ knowledge on these topics.
Evaluation criteria of study results
Homework - 10%
Tests - 30%
Theory tests - 10%
Exam - 50%
 
Course prerequisites The study course is based on the knowledge of mathematics acquired at the secondary school.
Course planning
Part CP ECTS Hours Tests
Lectures Practical Lab. Test Exam Work
1 3.0 4.5 1.0 2.0 0.0 *

[Extended course information PDF]