{"id":2110,"date":"2026-02-03T07:14:00","date_gmt":"2026-02-03T06:14:00","guid":{"rendered":"https:\/\/labodemaths.fr\/WordPress3\/?p=2110"},"modified":"2026-02-12T16:48:14","modified_gmt":"2026-02-12T15:48:14","slug":"nsi2022-2023les-listes-en-python","status":"publish","type":"post","link":"https:\/\/labodemaths.fr\/WordPress3\/nsi2022-2023les-listes-en-python\/","title":{"rendered":"NSI: Les listes en Python"},"content":{"rendered":"\n
Les_listes<\/a>T\u00e9l\u00e9charger<\/a><\/div>\n\n\n\n

Exercice 1<\/h3>\n\n\n\n
  1. On consid\u00e8re les listes ci-dessous d\u00e9finies en extension :<\/li><\/ol>\n\n\n\n
    >>> a=[0,2,4,6,8,10]\n>>> b=[0,1,4,9,16,25,36]\n>>> c=[10,9,8,7,6,5,4,3,2]<\/code><\/pre>\n\n\n\n
    D\u00e9terminer comment les d\u00e9finir par compr\u00e9hension.<\/p>\n\n\n\n
    Que retournent les commandes ci-dessous  ?<\/p>\n\n\n\n
    Exercice 2<\/h3>\n\n\n\n
    >>>[i+j for i in [3,1,2] for j in [2,1]]\n>>>[i+j for j in [1,3] for i in [1,0,2] ]\n>>>[[i+j for i in range(3)] for j in range(2)]<\/code><\/pre>\n\n\n\n
    Exercice 3<\/h3>\n\n\n\n
    Ecrire une fonction permettant de remplir al\u00e9atoirement un liste de longueur n par des nombres entiers compris entre 0 et 100.
    La fonction utilisera une liste en compr\u00e9hension et la m\u00e9thode randint() du module random.<\/p>\n\n\n\n
    >>> # par exemple\n>>> liste_aleatoire(5)\n>>> [6,19,54,27,4]<\/code><\/pre>\n\n\n\n
    Exercice 4<\/h3>\n\n\n\n
    Ecrire une fonction inverse retournant la liste invers\u00e9e d’un liste pass\u00e9e en param\u00e8tre.<\/p>\n\n\n\n
    >>> # par exemple\n>>> a=[1,7]\n>>> inverse_liste(a)\n>>> [7,1]<\/code><\/pre>\n\n\n\n
    Exercice 5<\/h3>\n\n\n\n
    Ecrire une fonction triee() permettant de d\u00e9terminer si une liste est tri\u00e9e par ordre croissant<\/p>\n\n\n\n
    >>> a=[7,3,6]\n>>> triee(a)\nFalse\n>>> b=[5,8,15]\n>>> triee(b)\nTrue<\/code><\/pre>\n\n\n\n
    <\/code><\/pre>\n\n\n\n
    Proposition correction exercices 3 \u00e0 5<\/p>\n\n\n\n
    from random import *\r\n\r\ndef liste_aleatoire(n):\r\n    return [randint(0,100) for i in range(n)]\r\n\r\ndef liste_aleatoire1(n):\r\n    retour=[]\r\n    for i in range(n):\r\n        retour.append(randint(0,100))\r\n    return retour\r\n\r\ndef inverse_liste(liste):\r\n    '''\r\n    >>>inverse_liste([5,8,12])\r\n    [12,8,5]\r\n    '''\r\n    retour=[]\r\n    for i in range(len(liste)-1,-1,-1):\r\n        retour.append(liste[i])\r\n    return retour\r\n\r\n\r\ndef triee(liste):\r\n    '''\r\n    indique si une liste est tri\u00e9e par ordre\r\n    croissant\r\n    >>>triee([4,8,12])\r\n    True\r\n    >>>triee([4,2,12])\r\n    False\r\n    '''\r\n    for i in range(len(liste)-1):\r\n        if liste[i]>liste[i+1]:\r\n            return False\r\n    return True\r\n    \r\ndef triee1(liste):\r\n    '''\r\n    indique si une liste est tri\u00e9e par ordre\r\n    croissant\r\n    >>>triee1([4,8,12])\r\n    True\r\n    >>>triee1([4,2,12])\r\n    False\r\n    '''   \r\n    return liste==sorted(liste)\r\n\r\ndef fusion(list1,list2):\r\n    '''\r\n    >>>fusion([1,2,5],[3,12,3])\r\n    [1,2,5,3,12,3]\r\n    '''\r\n    return list1+list2\r\n\r\ndef fusion1(list1,list2):\r\n    retour=[]\r\n    for val in list1:\r\n        retour.append(val)\r\n    for val in list2:\r\n        retour.append(val)\r\n    return retour\r\n\r\ndef negatif(liste):\r\n    '''\r\n    >>>negatif([1,0,1,1,1,0,1])\r\n    [0,1,0,0,0,1,0]\r\n    '''\r\n    retour=[]\r\n    for val in liste:\r\n        if val==0:\r\n            retour.append(1)\r\n        else:\r\n            retour.append(0)\r\n    return retour\r\n\r\ndef maximum_sans_max(liste):\r\n    '''\r\n    >>>maximum_sans_max([8,5,3])\r\n    8\r\n    '''\r\n    maxi=liste[0]\r\n    for val in liste:\r\n        if val>maxi:\r\n            maxi=val\r\n    return maxi\r\n\r\n\r\n\r\n\r\n\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
    Exercice 1 On consid\u00e8re les listes ci-dessous d\u00e9finies en extension : D\u00e9terminer comment les d\u00e9finir…<\/p>\n
    Read the postNSI: Les listes en Python<\/span><\/a><\/div>\n","protected":false},"author":2,"featured_media":2112,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[57],"tags":[],"_links":{"self":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/2110"}],"collection":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/comments?post=2110"}],"version-history":[{"count":10,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/2110\/revisions"}],"predecessor-version":[{"id":3070,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/2110\/revisions\/3070"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/media\/2112"}],"wp:attachment":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/media?parent=2110"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/categories?post=2110"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/tags?post=2110"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}