|Status||Compulsory/Courses of Limited Choice|
|Level and type||Undergraduate Studies, Academic|
|Field of study||Mathematics and Statistics|
|Academic staff||Inta Volodko, Aleksandrs Matvejevs, Sergejs Smirnovs, Irīna Eglīte, Ilona Dzenīte, Jeļena Mihailova, Marija Dobkeviča|
|Credit points||2.0 (3.0 ECTS)|
Sets, mappings, relations. Combinatorics. Boolean algebra; discrete circuits, automata. .
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 analyse solutions of problems when performing more complicated tasks within the framework of study courses of professional specialization.|
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.
|Course prerequisites||The study course is based on the knowledge of mathematics acquired at the secondary school.|