Programmation
782 documents à télécharger gratuitement
Cours, examens, TD, TP et exercices de programmation. Thèmes couverts : algorithmique, langage C, Java, Python, POO, structures de données.
This document pertains to an exam on Operating Systems and Concurrent Programming. It covers topics such as multithreading, process vs thread differences, thread control blocks, and process states. There's also an exercise section focusing on practical C programming questions and multithreading challenges.
This document analyzes issues of cohesion and coupling in provided Java code snippets. It suggests solutions for improving code maintainability and reusability through the use of modular methods. The analysis focuses on refactoring code to eliminate global variables and enhance method independence.
This document discusses topological sorting of acyclic directed graphs. It provides algorithms for calculating topological orders and explores their complexities. Practical examples and modifications to existing algorithms are suggested.
This document discusses advanced algorithmic concepts focusing on binary trees and their enumeration. It includes exercises related to the properties and complexities of binary trees and decision trees resulting from comparison sorting algorithms. The text aims to deepen understanding of these fundamental data structures and their associated algorithms.
This document discusses advanced algorithmic techniques through exercises on greedy algorithms and the knapsack problem. It outlines problems such as determining optimal fuel stops for a car journey and maximizing the value of stolen goods under weight constraints. The document also includes the formulation of both a fractional and a 0/1 knapsack problem along with their respective solutions and complexities.
This document outlines a lab assignment focused on finding the longest common subsequence between two sequences. It includes a problem statement, definitions, and a series of tasks to be completed, emphasizing dynamic programming techniques. The assignment also addresses algorithm complexity and methods for constructing the longest common subsequence.
Ce document traite de la recherche de la plus longue sous-séquence commune entre deux séquences. Il présente la problématique, ainsi que des résolutions par programmation dynamique et des algorithmes adaptés. Des exemples et des explications sur la complexité des algorithmes sont également fournis.
Ce document aborde la recherche d'un élément majoritaire dans un tableau. Il présente des algorithmes naïfs ainsi que des techniques de 'diviser pour régner'. La complexité de chaque algorithme est également discutée.
This document discusses advanced algorithmic concepts focused on determining the majority element in an array. It presents both a naive algorithm and a more efficient divide-and-conquer approach. The document also analyzes the complexities of these algorithms.
This document presents an advanced algorithmic exercise focused on polynomial multiplication using the 'divide and conquer' technique. It includes tasks that involve demonstrating methods to multiply linear polynomials and algorithms for multiplying polynomials of degree up to n. Additionally, the document outlines recursive approaches for calculating trigonometric functions.
This document discusses advanced algorithmic techniques for multiplying polynomials using the 'divide and conquer' method. It includes the derivation of a polynomial multiplication algorithm requiring only three multiplications and explains how to achieve efficient polynomial products with a complexity of Θ(n log2 3). The content is thoroughly detailed with algorithm descriptions and recurrence relationships.
This document presents a series of exercises focused on advanced algorithmic techniques, specifically recursion. It covers the Fibonacci sequence, set operations including union, intersection, and difference, with an emphasis on both sorted and unsorted scenarios. Each exercise requires the implementation of recursive algorithms and analysis of their complexities.
This document discusses advanced algorithmic techniques, particularly focusing on recursion through the Fibonacci sequence. It analyzes the complexity of recursive algorithms and introduces operations on sets represented by arrays. The document includes algorithms for calculating Fibonacci numbers and searching for elements in both sorted and unsorted sets.
This document discusses an advanced algorithmic exercise focusing on the heuristic packing problem. It presents the problem of packing n objects of varying sizes into the minimum number of unit-sized boxes. The document details the Fischer-Price heuristic method for solving the problem and poses several theoretical questions regarding its performance.
This document addresses an advanced algorithmic exercise related to the bin packing problem, detailing the use of the Fischer-Price heuristic for optimal boxing of objects. It discusses the properties and limitations of this heuristic, including proofs of upper bounds on the number of boxes used. The document includes detailed mathematical reasoning and conclusions regarding the efficiency of the proposed heuristic.
This document provides solutions and algorithms for finding the maximum and second maximum elements from a set. It focuses on analyzing the complexity of these algorithms and presents the tournament method for finding the maximum efficiently.
This document outlines a practical session focused on advanced algorithmic techniques, specifically searching for the maximum and second-largest elements in a dataset. It includes various exercises to design algorithms, analyze their complexities, and improve their efficiency. Additionally, the document encourages the application and visualization of algorithms through sports tournament analogies.
The document includes several exercises related to algorithm complexity in C programming. It presents iterative and recursive algorithms for finding minima in arrays and calculating powers and sums, along with their complexities. It discusses the efficiency of each algorithm and provides corrections with complexity evaluations.
This document presents the exam for the advanced algorithm course held on January 29, 2002. It includes problems on recurrence resolution and optimal music selection from a CD for cassette recording. The exam format allows students to choose questions to answer based on their preferences and strengths.
Ce document est le corrigé de l'examen final du cours INF4705 à l'École Polytechnique de Montréal. Il comprend 6 questions sur des concepts d'algorithmique, y compris des questions sur la complexité, les algorithmes voraces, et la programmation dynamique. L'examen a eu lieu le 14 décembre 2004 et dure 2h30.
L'examen porte sur des questions de compréhension de la complexité des problèmes de décision et d'optimisation. Les étudiants doivent justifier leurs réponses concernant la classification des problèmes et l'application de heuristiques. Il inclut aussi des exercices sur les langages formels et leurs propriétés.
This lab focuses on red-black trees, their properties, and exercises to demonstrate understanding. It includes the identification of red-black trees from given examples and exercises to prove logarithmic height in relation to the number of nodes. The document concludes with corrections and explanations for the exercises.
This document explains the concepts of Red-Black trees and 2-3-4 trees, focusing on insertion and rotation processes. It highlights the significance of these trees in external memory management and discusses B-trees, their structure, and performance. The document further explores insertion and deletion operations within B-trees.
This document discusses the theory of complexity in algorithms, focusing on optimal algorithms and their lower bounds. It provides examples such as matrix multiplication and searching in lists, illustrating how to demonstrate algorithm optimality through decision trees and comparison-based sorting. The document concludes with insights into the complexity of sorting algorithms and their optimality.