100+ Free Bac H Burkina Faso Practice Questions

Prepare for the Baccalauréat Série H (Techniques Informatiques) — Burkina Faso exam with instant access — no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately

100+ Questions

100% Free

Loading practice questions...

Same family resources

Explore More Burkina Faso Baccalauréat

Continue into nearby exams from the same family. Each card keeps practice questions, study guides, flashcards, videos, and articles in one place.

2026 Statistics

Key Facts: Bac H Burkina Faso Exam

Série H

Burkina Faso techniques informatiques Baccalauréat, listed with C, D, E, F and H in the 21 July 2026 Présidence/ATF communiqué

Présidence du Faso / Académie Technologique du Faso admission notice, 21 July 2026

10/20

National Baccalauréat pass mark is a weighted average of at least 10/20, with oral rachat

MESFPT / DGEC 2026 session rules used for sibling series

Free 100-question English MCQ study bank for Bac H Burkina Faso (techniques informatiques). Official exam: French written and practical papers plus oral rachat; pass on a 10/20 weighted average. Not an official-format simulation.

Sample Bac H Burkina Faso Practice Questions

Try these sample questions to test your Bac H Burkina Faso exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1In lycée algorithmics, a sequence of instructions executed one after another, with no test and no repetition, is called which kind of structure?

A.An iterative structure

B.An alternative structure

C.A sequential structure

D.A recursive structure

Explanation: A sequential structure (structure séquentielle) is a list of actions performed in the written order. Alternative structures choose a branch after a Boolean test, and iterative structures repeat a block. Recursion is a sub-program calling itself, not the basic one-after-another pattern.

2Before a TANTQUE loop that counts with a variable i starting at 1, what must the algorithm do to i?

A.Initialise i to the starting value (here 1)

B.Leave i undefined so the loop can choose a value

C.Set i to a value already greater than the stopping bound

D.Replace i by the final sum before the loop begins

Explanation: Every loop-control variable must be given a defined starting value (initialisation) before the condition is first evaluated. For a counter that should run from 1, that value is 1. Without initialisation the condition is meaningless and the increment would operate on garbage.

3The alternative structure SI … ALORS … SINON is used when which situation holds?

A.The same block must run a number of times known in advance

B.The next action depends on a Boolean condition

C.Values must be stored in a one-dimensional array

D.A sub-program must return a typed result

Explanation: An alternative (structure alternative) evaluates a condition and then executes one of two paths. That is exactly the case whenever the following instruction depends on a Boolean test. Known repetition is iteration; arrays and functions are data and modularity tools, not the alternative itself.

4A POUR (FOR) loop is the most appropriate iterative form when which fact is known before the loop starts?

A.The algorithm must never terminate

B.Input must be re-read until it becomes valid

C.The stopping condition cannot be expressed with a counter

D.The number of repetitions is known in advance

Explanation: POUR i ← a TO b runs a counter through a closed interval whose length is known before entry. When the number of turns is not known (reading until a sentinel, validating input), TANTQUE or RÉPÉTER is the natural choice.

5In the Pascal-style arrays of Série H algorithmics, table T is declared with indices from 1 to N. What is the last valid index?

A.0

B.N − 1

C.N

D.2N

Explanation: Francophone lycée declarations of the form T: tableau[1..N] make N the last legal subscript. Accessing 0 or N+1 is out of range. The N−1 convention belongs to languages whose arrays are 0-based; do not import it into 1-based Pascal-style algorithmics.

6In lycée algorithmics, what distinguishes a function (fonction) from a procedure (procédure)?

A.A function returns a result; a procedure performs actions without returning a value

B.A procedure returns a result; a function never does

C.Only functions may have parameters

D.Only procedures may contain loops

Explanation: A function computes and returns a typed value that can appear in an expression. A procedure (procédure) executes actions — writing, filling an array, updating parameters — and does not return a value. Both may take parameters and both may contain loops.

7A named value that the algorithm is not allowed to change during execution is a:

A.Variable

B.One-dimensional array

C.Parameter passed by reference

D.Constant

Explanation: A constant (constante) is bound to a value at declaration and must not be assigned later. Variables, array cells and reference parameters are all updatable storage. Using a constant for a fixed size such as N or TVA makes the algorithm easier to maintain.

8Which type is appropriate for a flag that can only be true or false?

A.Integer

B.Boolean

C.Real

D.Character string

Explanation: The Boolean type (booléen) has exactly two values, VRAI and FAUX, and is the type of every condition in SI and TANTQUE. Integers, reals and strings can encode flags only by convention, which hides the meaning and invites invalid values.

9After this algorithm finishes, what is the value of s? s ← 0 i ← 1 TANTQUE i ≤ 4 FAIRE s ← s + i i ← i + 1 FINTANTQUE

A.4

B.6

C.10

D.15

Explanation: Trace the loop: start s = 0, i = 1. Four turns add 1, then 2, then 3, then 4, so s = 10, and i becomes 5, which stops the TANTQUE. The pattern is the sum of the first 4 positive integers.

10Given the nested alternative SI note ≥ 10 ALORS SI note ≥ 16 ALORS écrire "Très bien" SINON écrire "Passable ou Bien" FINSI SINON écrire "Ajourné" FINSI what is written when note = 16?

A.Ajourné

B.Très bien

C.Passable ou Bien

D.Nothing is written

Explanation: 16 ≥ 10 is true, so the inner test is reached. 16 ≥ 16 is true, so the inner ALORS branch writes "Très bien". The inner SINON and the outer SINON are skipped. Equality satisfies ≥.

About the Bac H Burkina Faso Exam

Série H is Burkina Faso's techniques informatiques Baccalauréat — the national computing series examined with the scientific and technical series (C, D, E, F, H). The lycée H programme covers informatique générale, programmation and analyse informatique across Seconde, Première and Terminale, with written papers in French plus practical work in the specialty. A dedicated Série H mathematics paper is set (annales list Serie H 1er tour), and the 2026 session shared an Anglais G1-G2-H paper. This free English MCQ bank trains H computing knowledge — it is not an official translation, not a programming-paper simulation, and not a substitute for written or practical work.

Assessment

2026 written first tour (23 June–1 July) includes a dedicated Série H mathematics paper, specialty information-technology / programming / analysis papers, practical work in the computing specialty, and the shared Anglais G1-G2-H paper, then oral rachat on 6–7 July. This bank is an English MCQ study adaptation only.

Time Limit

Multi-paper written first tour (2026: 23 June–1 July) plus oral second tour (6–7 July 2026).

Passing Score

Graded out of 20; awarded on a weighted average of at least 10/20, with oral rachat for close candidates.

Exam Fee

Not published as a per-candidate tariff; the 2026 session was state-organized. (MESFPT (Ministère de l'Enseignement Secondaire, de la Formation Professionnelle et Technique) — Direction générale des examens et concours (DGEC))

Bac H Burkina Faso Exam Content Outline

Study emphasis ~28%

Programming and algorithmics

Algorithms, control structures and coded solutions.

Study emphasis ~20%

General computing

Architecture, number systems, OS and files.

Study emphasis ~20%

Systems analysis and databases

MERISE MCD/MLD and relational design.

Study emphasis ~12%

Networks and IT technology

Local networks, addressing and troubleshooting.

Study emphasis ~14%

Mathematics

Dedicated Série H mathematics paper.

Study emphasis ~6%

Practical computing

Safety, maintenance and troubleshooting behind the H specialty practical work.

How to Pass the Bac H Burkina Faso Exam

What You Need to Know

Passing score: Graded out of 20; awarded on a weighted average of at least 10/20, with oral rachat for close candidates.
Assessment: 2026 written first tour (23 June–1 July) includes a dedicated Série H mathematics paper, specialty information-technology / programming / analysis papers, practical work in the computing specialty, and the shared Anglais G1-G2-H paper, then oral rachat on 6–7 July. This bank is an English MCQ study adaptation only.
Time limit: Multi-paper written first tour (2026: 23 June–1 July) plus oral second tour (6–7 July 2026).
Exam fee: Not published as a per-candidate tariff; the 2026 session was state-organized.

Keys to Passing

Work through all 100 available questions
Review every answer and explanation
Track weak areas and revisit them
Use our AI tutor for tough concepts

Bac H Burkina Faso Study Tips from Top Performers

1Trace algorithms by hand: initialise, test the condition, update the accumulator, then state the output.

2Practise converting between binary, hexadecimal and decimal, and simplify Boolean expressions before coding.

3Draw a MERISE MCD then derive the MLD: entities, associations, cardinalities and foreign keys.

4Work dedicated Série H mathematics annales (logic, functions, combinatorics) after MCQ review.

Frequently Asked Questions

Is Burkina Faso Série H the same as the old French Série H?

Burkina Faso still examines Série H as techniques informatiques / informatique. The Présidence/ATF communiqué of 21 July 2026 addresses BAC 2026 laureates of series C, D, E, F and H, and ATF lists Série H — Informatique among eligible series.

Is the official Bac H multiple choice or in English?

No. Official papers are written in French, with practical work in the computing specialty and oral rachat. This bank is an English-language MCQ study adaptation, not an official translation or format simulation.

100+ Free Bac H Burkina Faso Practice Questions

Explore More Burkina Faso Baccalauréat

Burkina Faso Baccalauréat Série A4 (Lettres)

Burkina Faso Baccalauréat Série C (Mathématiques et Physique)

Burkina Faso Baccalauréat Série D (Sciences de la Nature)

Burkina Faso Baccalauréat Série E (Mathématiques et Technique)

Burkina Faso Baccalauréat Série F1 (Construction Mécanique)

Burkina Faso Baccalauréat Série F3 (Électrotechnique)