Objectives of general skills

• Understand the fundamentals of computer science
• Show an understanding and deep knowledge of the concepts of computer science and mathematical formalisms used in the field of computer science
• Solve exercises and computer problems by applying basic knowledge in the various disciplines of computer science
• Use the vocabulary and the correct mathematical reasoning to formulate and solve problems in the field of computer science
• Understand computer technologies
• Understand the IT involved in the different stages of the life of a computer application
• Implement technology intelligence
• Demonstrate basic knowledge and know-how in related fields
• Have a good knowledge of English in order to read and understand scientific texts, especially in the field of computer science.
• Manage IT projects
• Manage a project in compliance with specifications, constraints and deadlines
• Creatively implement knowledge and expertise gained in the field of computer science.
• Apply appropriate technological and scientific ICT approaches
• Understand the fundamentals related to scientific methods
• Develop skills of abstraction and modelling through a conceptual and scientific approach
• Conduct rigorous reasoning based on scientific arguments
• Understand the fundamentals of communication
• Communicate information (both orally and in writing) relating to the field of computer science in an intelligible, clear and structured way
• Communicate a consistent and rigorous scientific argument, either orally or in writing
• Have a good command of language and communication techniques.

UE's Learning outcomes

To understand how to efficiently solve problems of sorting and dictionnary management, thanks to adapted data structures. To be able to use them to solve a given problem.

UE Content

Advanced algorithms and data structures for the search, insertion and deletion of a data inside a set of data, as well as the sort of a set of data. Study of binary search trees, AVL trees, B-trees, hash tables, quicksort, optimal sorts. Study of the correctness of the algorithms, and of their complexity in the worst case and the average case.

Project by group of two or three students on a problem to solve thanks to efficient algortihms and adequate data structures. Implementation of the proposed algorithms

Prior experience

Basic algorithmics and data structures

Term 1 for Integrated Assessment - type

• Oral examination

Term 1 for Integrated Assessment - comments

oral examination (2/3)
A failure in one of the AAs involves the failure for the whole learning unit

Term 2 for Integrated Assessment - type

• Presentation and works

Term 2 for Integrated Assessment - comments

Presentation and works (1/3)
A failure in one of the AAs involves the failure for the whole learning unit

Term 3 for Integrated Assessment - type

• Presentation and works
• Oral examination

Term 3 for Integrated Assessment - comments

Oral examination (2/3)
Presentation and works (1/3)
A failure in one of the AAs involves the failure for the whole learning unit

Resit Assessment for IT - Term 1 (B1BA1) - Comments

Not applicable