Quiz — Discussion 6_ Intro to Asymptotics and Bits.pptx

Question 1 sur 10 20:00

[{"id":6779,"question":"Quelle notation asymptotique décrit le pire cas de complexité d'un algorithme ?","option_a":"O (grand O)","option_b":"Ω (grand Omega)","option_c":"Θ (grand Thêta)","option_d":"Aucune des réponses","option_e":"","option_f":"","bonne_reponse":"a","explication":"La notation O (grand O) représente la limite supérieure de la complexité, c'est-à-dire le pire cas.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"O (grand O)\", \"b\": \"Ω (grand Omega)\", \"c\": \"Θ (grand Thêta)\", ","_debug_options_count":4},{"id":6780,"question":"Un algorithme a une complexité de 3n² + 2n + 1. Quelle est sa complexité asymptotique ?","option_a":"O(n)","option_b":"O(n²)","option_c":"O(1)","option_d":"O(log n)","option_e":"","option_f":"","bonne_reponse":"b","explication":"Le terme dominant est 3n², donc la complexité asymptotique est O(n²).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"O(n)\", \"b\": \"O(n²)\", \"c\": \"O(1)\", \"d\": \"O(log n)\"}}","_debug_options_count":4},{"id":6781,"question":"Vrai ou Faux ? La notation Θ (grand Thêta) décrit à la fois les limites supérieure et inférieure.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"La notation Θ indique que la fonction est bornée à la fois par le haut et par le bas, décrivant un comportement précis.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":6782,"question":"Quel est l'impact d'un bit supplémentaire sur la capacité de stockage ?","option_a":"Diminue de moitié","option_b":"Double la capacité","option_c":"Ne change rien","option_d":"Augmente de 10%","option_e":"","option_f":"","bonne_reponse":"b","explication":"Un bit supplémentaire double la capacité de stockage, car il permet de représenter deux fois plus de valeurs (2^n).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"Diminue de moitié\", \"b\": \"Double la capacité\", \"c\": \"Ne change ","_debug_options_count":4},{"id":6783,"question":"Vrai ou Faux ? Un algorithme avec une complexité O(n log n) est toujours plus rapide qu'un algorithme O(n²).","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"b","explication":"Pour de petites valeurs de n, un algorithme O(n²) peut être plus rapide qu'un algorithme O(n log n), mais asymptotiquement, O(n log n) est plus efficace.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":6784,"question":"Quelle est la complexité asymptotique d'une recherche linéaire dans un tableau non trié ?","option_a":"O(1)","option_b":"O(log n)","option_c":"O(n)","option_d":"O(n²)","option_e":"","option_f":"","bonne_reponse":"c","explication":"Une recherche linéaire parcourt chaque élément du tableau une fois, donc sa complexité est O(n).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"c\", \"options\": {\"a\": \"O(1)\", \"b\": \"O(log n)\", \"c\": \"O(n)\", \"d\": \"O(n²)\"}}","_debug_options_count":4},{"id":6785,"question":"Vrai ou Faux ? La notation Ω (grand Omega) décrit le meilleur cas de complexité.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"a","explication":"La notation Ω décrit la limite inférieure de la complexité, c'est-à-dire le meilleur cas.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"a\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4},{"id":6786,"question":"Quel est le rôle principal des bits dans un processeur ?","option_a":"Stocker des données","option_b":"Effectuer des calculs","option_c":"Communiquer avec la mémoire","option_d":"Toutes les réponses","option_e":"","option_f":"","bonne_reponse":"d","explication":"Les bits sont utilisés pour stocker des données, effectuer des calculs et communiquer avec la mémoire.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"d\", \"options\": {\"a\": \"Stocker des données\", \"b\": \"Effectuer des calculs\", \"c\": \"Commun","_debug_options_count":4},{"id":6787,"question":"Un algorithme a une complexité de 2^n. Quelle est sa complexité asymptotique ?","option_a":"O(n)","option_b":"O(2^n)","option_c":"O(log n)","option_d":"O(n²)","option_e":"","option_f":"","bonne_reponse":"b","explication":"La complexité 2^n est déjà sous forme asymptotique, donc O(2^n).","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"O(n)\", \"b\": \"O(2^n)\", \"c\": \"O(log n)\", \"d\": \"O(n²)\"}}","_debug_options_count":4},{"id":6788,"question":"Vrai ou Faux ? La complexité spatiale d'un algorithme dépend uniquement du nombre d'opérations effectuées.","option_a":"Vrai","option_b":"Faux","option_c":"","option_d":"","option_e":"","option_f":"","bonne_reponse":"b","explication":"La complexité spatiale dépend de la quantité de mémoire utilisée, pas seulement du nombre d'opérations.","points":1,"type":"qcm","actif":1,"section_id":null,"ordre":0,"_debug_answer_data_type":"string","_debug_answer_data_preview":"{\"correct\": \"b\", \"options\": {\"a\": \"Vrai\", \"b\": \"Faux\", \"c\": \"\", \"d\": \"\"}}","_debug_options_count":4}]