Discrete Mathematics
Course: «Applied (computer) Linguistics and English language»
Structural unit: Educational and Scientific Institute of Philology
            Title
        
        
            Discrete Mathematics
        
    
            Code
        
        
            ННД 11.02
        
    
            Module type 
        
        
            Обов’язкова дисципліна для ОП
        
    
            Educational cycle
        
        
            Second
        
    
            Year of study when the component is delivered
        
        
            2024/2025
        
    
            Semester/trimester when the component is delivered
        
        
            1 Semester
        
    
            Number of ECTS credits allocated
        
        
            2
        
    
            Learning outcomes
        
        
            PLO 3. To organize the process of learning and self-education.
PLO 18. To have skills for managing projects and solving complicated issues in professional activity in the field of computational linguistics and be responsible for making decisions under unpredictable circumstances.
PLO 22. To know the basic Mathematics conceptions and terminology and Mathematic methods and use them to solve specialized tasks of computational linguistics.
PLO 27. To know and use relevant mathematical conceptions, methods of domain, system and object-oriented analyses, and mathematical simulation, modern programming languages for creating software.
        
    
            Form of study
        
        
            Full-time form
        
    
            Prerequisites and co-requisites
        
        
            1. Successful mastering of algebra and geometry at the level of specialized secondary education;
2. Be able to transform algebraic expressions, identify mathematical regularities, and prove elementary statements;
3. To understand basic mathematical concepts.
        
    
            Course content
        
        
            As a result of studying the academic discipline, the student must:
know basic concepts, means, and methods of set theory, graph theory, theory of automata, Boolean functions, combinatorics, and their application in programming and linguistics; have modern ideas about the main classic methods of finding evidence;
be able to demonstrate practical skills in performing mathematical transformations and constructing mathematical proofs; write down the meaning of expressions using mathematical symbols; carry out combinatorial calculations; write elementary linguistic algorithms using automata; establish the truth of logical statements.
        
    
            Recommended or required reading and other learning resources/tools
        
        
            Planned learning activities and teaching methods
        
        
            Lectures, seminar classes, and independent work.
        
    
            Assessment methods and criteria
        
        
            - semester assessment:
1. Tests: 40/24 points.
2. Independent work: 60/36 points.
- final assessment in the form of credit. It is awarded based on the results of students' work during the semester and does not provide additional assessment measures for successful students.
        
    
            Language of instruction
        
        
            Ukrainіаn
        
    Lecturers
This discipline is taught by the following teachers
                    Mykola
                    S.
                    Nikitchenko
                
                
                    Theory and Technology of Programming 
Faculty of Computer Science and Cybernetics
            Faculty of Computer Science and Cybernetics
Departments
The following departments are involved in teaching the above discipline
                        Theory and Technology of Programming
                    
                    
                        Faculty of Computer Science and Cybernetics