PracticeVideosBlogFlashcardsEspañol
All Practice Exams

Free Practice Questions for Moldova Bacalaureat Informatics

Exam-style questions and explanations by OpenExamPrep.

✓ No registration✓ No credit card
54+ Questions
100% Free

Loading practice questions...

Same family resources

Explore More Moldova National Baccalaureate Examinations (Examenul Național de Bacalaureat — ANCE)

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

Moldova Bacalaureat — Gagauz Language & Literature

Practice Questions

Moldova Bacalaureat — Geography (Geografie)

Practice Questions

Moldova Bacalaureat — History of Romanians & Universal History

Practice Questions

Moldova Bacalaureat — Romanian as a Second Language (Alolingvi)

Practice Questions

Moldova Bacalaureat — Romanian Language & Literature

Practice Questions

Moldova Bacalaureat — Russian Language & Literature

Practice Questions

Sample Moldova Bacalaureat Informatics Practice Questions

Try these sample questions to review concepts for the Moldova Bacalaureat Informatics exam. Each question includes a detailed explanation. Start the interactive quiz above for the full 54+ question experience with AI tutoring.

1What fundamental runtime characteristic differentiates a recursive function from an iterative loop performing an equivalent repetitive computation?
A.Recursion allocates an activation record (stack frame) on the call stack for each invocation, whereas iteration reuses existing variables.
B.Recursion always executes asymptotically faster than iteration due to compiler branch prediction.
C.Recursion does not require a termination condition, whereas iterative loops always require explicit counter limits.
D.Iteration utilizes heap dynamic memory allocation, whereas recursion exclusively uses CPU register memory.
Explanation: Each recursive call pushes an activation frame containing return addresses, parameters, and local variables onto the execution call stack. Iterative loops modify state variables in place within the current frame, avoiding stack overhead and stack overflow risk.
2What is the primary operational role of the base case (condiție de oprire) in a recursive subprogram?
A.To allocate dynamic heap memory for subsequent recursive branches.
B.To reset loop index registers to zero before executing subroutines.
C.To increment the depth counter for stack performance benchmarking.
D.To terminate the sequence of recursive calls and provide a direct, non-recursive return value.
Explanation: The base case defines one or more input conditions for which the function computes a result directly without further self-invocations. Without a base case, recursion continues indefinitely until exhausting stack memory, throwing a stack overflow exception.
3Consider the following recursive C++ function: int f(int n) { if (n <= 1) return 1; return n + f(n - 2); } What is the integer value returned by the call f(7)?
A.16
B.15
C.12
D.28
Explanation: Tracing recursive evaluation: f(7) = 7 + f(5) f(5) = 5 + f(3) f(3) = 3 + f(1) f(1) = 1 (base case n <= 1) Substituting backwards: f(3) = 3 + 1 = 4; f(5) = 5 + 4 = 9; f(7) = 7 + 9 = 16.
4When applying the Euclidean algorithm using modulo division to find the greatest common divisor (GCD) of 84 and 30, how many modulo/division operations are executed, and what is the final GCD?
A.2 division operations; GCD = 12
B.3 division operations; GCD = 6
C.4 division operations; GCD = 3
D.1 division operation; GCD = 6
Explanation: Applying Euclidean division: Step 1: 84 % 30 = 24 (a = 30, b = 24) Step 2: 30 % 24 = 6 (a = 24, b = 6) Step 3: 24 % 6 = 0 (b = 0, termination) Exactly 3 modulo divisions are performed. The non-zero divisor is 6, so GCD(84, 30) = 6.
5Consider the following algorithm expressed in pseudocode: s = 0 while n > 0 do d = n mod 10 if d mod 2 == 0 then s = s + d end if n = n div 10 end while return s What value is returned when the algorithm is executed with the input n = 4728?
A.21
B.12
C.14
D.10
Explanation: The algorithm extracts decimal digits from right to left using `n mod 10` and `n div 10`, summing only even digits: 1. d = 4728 % 10 = 8 (even): s = 0 + 8 = 8, n = 472 2. d = 472 % 10 = 2 (even): s = 8 + 2 = 10, n = 47 3. d = 47 % 10 = 7 (odd): skipped, n = 4 4. d = 4 % 10 = 4 (even): s = 10 + 4 = 14, n = 0 Final s = 14.
6In standard modern 32-bit and 64-bit C++ environments, what is the typical memory footprint and signed integer numerical range of the standard int data type?
A.2 bytes; from -32,768 to 32,767
B.4 bytes; from -2,147,483,648 to 2,147,483,647
C.8 bytes; from -9,223,372,036,854,775,808 to 9,223,372,036,854,775,807
D.1 byte; from -128 to 127
Explanation: In standard modern C++ compilers (GCC, Clang, MSVC) on 32-bit and 64-bit architectures, `int` is 4 bytes (32 bits) in two's complement format, spanning from -2^31 (-2,147,483,648) to 2^31 - 1 (2,147,483,647).
7What are the evaluated numerical results of the integer division 19 / 4 and modulo 19 % 4 in standard C++?
A.19 / 4 = 4.75; 19 % 4 = 0.75
B.19 / 4 = 5; 19 % 4 = 1
C.19 / 4 = 4; 19 % 4 = 3
D.19 / 4 = 4; 19 % 4 = 0
Explanation: When both operands of `/` are integers in C++ (or `div` in Pascal), integer division is performed with truncation toward zero: 19 / 4 = 4. The modulo operator `%` (or `mod` in Pascal) returns the integer remainder: 19 - (4 * 4) = 3.
8Which Boolean logical operator evaluates to true if and only if BOTH operands evaluate to true?
A.Logical OR (|| in C++, or in Pascal)
B.Bitwise XOR (^ in C++, xor in Pascal)
C.Logical NOT (! in C++, not in Pascal)
D.Logical AND (&& in C++, and in Pascal)
Explanation: The logical conjunction AND (`&&` in C++, `and` in Pascal) returns true strictly when both left and right Boolean expressions are true. If either or both operands are false, the conjunction evaluates to false.
9In C++, what occurs when a case block within a switch statement does NOT conclude with a break statement?
A.Execution falls through sequentially into subsequent case blocks regardless of matching labels until a break or the end of the switch block is encountered.
B.The program generates a mandatory compile-time syntax error.
C.The switch statement immediately restarts from the first case label.
D.The operating system halts the program with an uncaught runtime exception.
Explanation: In C++, `switch` statements feature fall-through semantics by default. If a `break` statement is omitted, control flows directly into the statements of the next `case` label, executing them unconditionally until a `break`, `return`, or the closing brace is reached.
10What operational guarantee fundamentally distinguishes a post-test loop (do-while in C++, repeat-until in Pascal) from a pre-test loop (while)?
A.A post-test loop cannot contain break or continue statements.
B.A post-test loop is guaranteed to execute its statement body at least once.
C.A post-test loop executes exclusively on separate CPU worker threads.
D.A post-test loop terminates when the test condition evaluates to null.
Explanation: In a post-test loop (`do-while` / `repeat-until`), the continuation/termination condition is evaluated at the bottom of the loop, after the body has executed. Therefore, the body is guaranteed to execute at least once, even if the condition is initially false.

About the Moldova Bacalaureat Informatics Exam

Examenul Național de Bacalaureat — Informatica is a current Moldova national Bacalaureat assessment administered by ANCE. Published study domains include Programming and data, Subprograms and recursion, Information and computer arithmetic, Numerical modelling and databases. This local bank is an independent English-language MCQ study adaptation. It is not an official translation, not an official-format simulation, and does not replace practice with the official written tasks.

Exam sponsor: National Agency for Curriculum and Evaluation (ANCE), Ministry of Education and Research of the Republic of Moldova. The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Assessment

Official assessment: written paper with program tracing, coding and algorithm tasks in Pascal or C/C++, structured-data processing, information representation, logic, numerical methods, and database tasks. This local bank is an independent English-language MCQ study adaptation. It is not an official translation, not an official-format simulation, and does not replace practice with the official written tasks.

Time Limit

180 minutes

Passing Score

A final Bacalaureat subject mark of at least 5.00 on the 10-point scale is required; the raw-point conversion is published with the official marking scheme.

Exam / Certification Fees

ANCE does not publish a separate per-paper fee for school-registered candidates.

Exam sponsor website

Fees, eligibility, and exam policies can change. Confirm them with the exam sponsor before applying or paying.

Official sources

Our practice resources: topics covered

We aim to reflect publicly available exam outlines and topic information in our study resources. Coverage, format, and difficulty may differ from the actual exam, and we cannot guarantee that every detail is accurate or current. Confirm exam requirements, fees, and policies with the official exam sponsor.

Official percentage not published

Programming and data

Simple and structured data, expressions, control statements, arrays, strings, records, sets, and files.

Official percentage not published

Subprograms and recursion

Functions, procedures, parameters, scope, recursive execution, and program analysis.

Official percentage not published

Information and computer arithmetic

Information quantity, coding, positional number systems, Boolean algebra, and logic circuits.

Official percentage not published

Numerical modelling and databases

Approximation methods, numerical integration, and table/query/form/report concepts in databases.

Preparing for the Moldova Bacalaureat Informatics Exam

What You Need to Know

  • Passing score: A final Bacalaureat subject mark of at least 5.00 on the 10-point scale is required; the raw-point conversion is published with the official marking scheme.
  • Assessment: Official assessment: written paper with program tracing, coding and algorithm tasks in Pascal or C/C++, structured-data processing, information representation, logic, numerical methods, and database tasks. This local bank is an independent English-language MCQ study adaptation. It is not an official translation, not an official-format simulation, and does not replace practice with the official written tasks.
  • Time limit: 180 minutes
  • Exam / certification fees: ANCE does not publish a separate per-paper fee for school-registered candidates. Official sources

Using Our Practice Resources

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

Moldova Bacalaureat Informatics: Suggested Study Strategy

1Use the official ANCE program as the checklist for topics and competencies.
2After MCQ review, practise the official written task types under the published time conditions.
3Check answers against official terminology, source texts, diagrams, or calculations rather than memorizing option positions.

Frequently Asked Questions

Is this the official exam format?

No. This local bank is an independent English-language MCQ study adaptation. It is not an official translation, not an official-format simulation, and does not replace practice with the official written tasks.

What language is the official assessment offered in?

Confirmed 2026 paper language code(s): ro, ru, en.

How many questions are on the official paper?

The official program does not promise a fixed future item count; consult the current ANCE paper and marking scheme.