Exercise 62

Given a list of integers L, write an algorithm in Python which multiplies the elements of L of even index by 2 and those of odd index by 3. Example if L = [3, 2, 7, 11, 5, 3], the algorithm returns the list [6, 6, 14, 33, 10, 9]

Solution

In this first lesson, we'll start by defining what is Bootstrap. We then show the advantages as well as the limits of this framework so that you immediately have an idea of ​​the cases where it will be interesting to use it and those where it will be necessary to favor other solutions. We will finally see the new features brought by version 5 of Bootstrap which is the version with which we will be working and will take the opportunity to set up our working environment.

What is Bootstrap?

Bootstrap is a CSS framework. A framework corresponds to a set of libraries grouped together for a specific purpose and having internal rules that users must follow. In other words, and to put it very simply, Bootstrap is a collection of CSS and JavaScript files that work together and that we can use to create complex designs in a relatively simple way. The Bootstrap framework is therefore a set of CSS and JavaScript files which contain predefined rules and which define components. These rule sets are enclosed in classes so we will only have to use the classes we are interested in in order to apply a set of styles to a particular HTML element. In addition, Bootstrap also uses JavaScript files and in particular external JavaScript libraries like jQuery or Popper to define entire components like navigation bars, modal windows, etc. which we will also be able to directly implement.

Exercise 61

Resume the previous exercise (Exercise60) without using the reverse() method in python.

Solution

Exercise 60

Write a Python algorithm that reverse the order of the elements of a list using the reverse() method. Example if L = ['Java', 'Python', 'PHP', 'C ++'], the algorithm returns the list: ['C ++', 'PHP', 'Python', 'Java']

Solution

Exercise 55

Write an algorithm in Python to sort a list according to the insertion sort algorithm.

Solution

Exercise 54

Write a Python algorithm as a function which takes as parameter a list of integers L = [n₁, n₂, n₃, ...., n_p] and which returns the list: [n₁, n₁ + n₂, n₁ + n₂ + n₃, ...., n₁ + n₂ + ... + n_p]

Solution

Exercise 53

Write an algorithm in Python allowing to determine the penultimate index of an element in a list without using any predefined function in Python. Example if L = [2, 7, 11, 7, 21, 39, 7] and a = 7 the algorithm returns 3.

Solution