Data structures, analysis and algorithms of computer information processing
Course: Software Engineering
Structural unit: Faculty of information Technology
            Title
        
        
            Data structures, analysis and algorithms of computer information processing
        
    
            Code
        
        
            ОК 27
        
    
            Module type 
        
        
            Обов’язкова дисципліна для ОП
        
    
            Educational cycle
        
        
            First
        
    
            Year of study when the component is delivered
        
        
            2021/2022
        
    
            Semester/trimester when the component is delivered
        
        
            2 Semester
        
    
            Number of ECTS credits allocated
        
        
            6
        
    
            Learning outcomes
        
        
            PR-5. Know and apply relevant mathematical concepts, methods of domain, system and object-oriented analysis and mathematical modeling for software development.
PR-13. Know and apply methods of developing algorithms, designing software and data and knowledge structures.
        
    
            Form of study
        
        
            Full-time form
        
    
            Prerequisites and co-requisites
        
        
            The discipline is based on the knowledge, skills and practical skills acquired by students while studying the disciplines "Fundamentals of Programming", "Discrete Mathematics".
        
    
            Course content
        
        
            Algorithms and data structures is dedicated to the student's acquisition of competencies in order to participate in the design of information processing programs, the creation of complex programs of various types using complex data structures and their processing algorithms.
        
    
            Recommended or required reading and other learning resources/tools
        
        
            1. Donald E. Knuth The Art of Computer Programming3. Boxed Set. (Reading, Massachusetts: Addison-Wesley, 2023), 3904pp. ISBN 978-0-13-793510-9, 0-13-793510-2
        
    
            Planned learning activities and teaching methods
        
        
            Lectures, practical activities, individual work
        
    
            Assessment methods and criteria
        
        
            The level of achievement of all planned learning outcomes is determined by the results of the defense of practical work and individual tasks of independent work. Semester assessment of students is carried out during the semester for all types of work. The total score is formed as a weighted sum of points earned by the student for various types of work.
The maximum number of points that a student can receive for work in a semester does not exceed 100 points. The form of the final evaluation is the test. The assessment is carried out by issuing a final grade, which is defined as the sum of points for all successfully assessed learning outcomes. To receive credit, it is mandatory to complete all practical work (minimum grade - 18 points, maximum - 38 points), testing work (minimum grade - 18 points, maximum - 22 points), test - 40. 
        
    
            Language of instruction
        
        
            Ukrainian
        
    Lecturers
This discipline is taught by the following teachers
Faculty of information Technology
Departments
The following departments are involved in teaching the above discipline
                        Faculty of information Technology