Free Practice Questions for UB FMI Computer Science Admission

Exam-style questions and explanations by OpenExamPrep.

✓ No registration✓ No credit card

48+ Questions

100% Free

Loading practice questions...

Same family resources

Explore More Romanian University Admission Examinations (Admitere Facultate)

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

Sample UB FMI Computer Science Admission Practice Questions

Try these sample questions to review concepts for the UB FMI Computer Science Admission exam. Each question includes a detailed explanation. Start the interactive quiz above for the full 48+ question experience with AI tutoring.

1Two ascending arrays A = [2, 5, 9] and B = [1, 5, 8] are merged by repeatedly comparing their first unconsumed elements. Equal values are taken from A first, and remaining elements are copied after one array is exhausted. How many element-to-element comparisons are made?

A.5

B.4

C.6

D.9

Explanation: The comparisons select B's 1, A's 2, A's 5, B's 5 and B's 8, in that order. B is then exhausted, so A's 9 is copied without an element-to-element comparison.

2Which graph traversal algorithm correctly finds the shortest path (minimum number of edges) from a start vertex to all other vertices in an unweighted graph?

A.Breadth-First Search (BFS)

B.Depth-First Search (DFS)

C.Pre-order traversal

D.In-order traversal

Explanation: Breadth-First Search explores vertices level by level in order of increasing distance from the source vertex. When a vertex is first reached via BFS in an unweighted graph, the path taken is guaranteed to have the minimum number of edges. DFS explores deep along paths and does not guarantee shortest paths.

3For n = 20304, an algorithm starts s = 0 and repeatedly executes s = 10*s + n mod 10, then n = n div 10, until n = 0. Here div is integer division. What is the final value of s?

A.40302

B.20304

C.432

D.9

Explanation: Successive last digits are 4, 0, 3, 0 and 2. Appending each to s gives 4, 40, 403, 4030 and finally 40302, reversing the decimal digits while preserving the internal zeros.

4Euclid's algorithm starts with a = 252 and b = 198. While b is nonzero, it executes r = a mod b, a = b, b = r. How many executions of the loop body occur, and what is the final a?

A.4 executions; a = 18

B.3 executions; a = 18

C.4 executions; a = 0

D.2 executions; a = 54

Explanation: After each execution, (a, b) becomes (198, 54), (54, 36), (36, 18) and (18, 0). The fourth execution makes b zero, leaving the greatest common divisor, 18, in a.

5In the classic N-Queens backtracking problem, two queens at positions (r1, c1) and (r2, c2) attack each other diagonally if and only if:

A.|r1 - r2| == |c1 - c2|

B.r1 + c1 == r2 + c2 only

C.r1 == r2

D.c1 == c2

Explanation: On a chess grid, two squares lie on the same major diagonal if r1 - c1 == r2 - c2 => r1 - r2 == c1 - c2. They lie on the same minor diagonal if r1 + c1 == r2 + c2 => r1 - r2 == -(c1 - c2). Combining both conditions yields the single check |r1 - r2| == |c1 - c2|.

6A rooted tree with vertices 1 through 7 is represented by the parent vector [0, 1, 1, 2, 2, 4, 6], where 0 marks the root. What is the path from vertex 7 to the root, including both endpoints?

A.7, 6, 4, 2, 1

B.7, 6, 5, 2, 1

C.7, 4, 2, 1

D.7, 6, 4, 3, 1

Explanation: Look up each current vertex's parent: p[7] = 6, p[6] = 4, p[4] = 2 and p[2] = 1. Since p[1] = 0, vertex 1 is the root and completes the path.

7In graph theory, how many edges does any tree with V vertices contain?

A.V - 1

B.V

C.V + 1

D.V * (V - 1) / 2

Explanation: By definition, a tree is a connected undirected graph with no cycles. A fundamental theorem of graph theory proves that any tree with V vertices has exactly V - 1 edges. Adding any edge creates a cycle; removing any edge disconnects the graph.

8According to Euler's theorem, an undirected connected graph contains an Eulerian Circuit (a closed walk visiting every edge exactly once) if and only if:

A.Every vertex has an even degree

B.Exactly two vertices have an odd degree

C.The graph is bipartite

D.The graph is a tree

Explanation: An Eulerian circuit pairs every arrival at a vertex with a departure, so each degree must be even. For a connected undirected graph this condition is also sufficient; exactly two odd-degree vertices instead permit an open Eulerian trail.

9Under what condition does Counting Sort achieve linear time complexity O(n)?

A.When the range of input keys k is O(n)

B.When the array is already sorted

C.When elements are floating-point numbers

D.When the array has no duplicate elements

Explanation: Counting Sort runs in O(n + k) time, where n is the number of elements and k is the range of key values (max - min + 1). When k is O(n) (the key values are integers within a range proportional to n), O(n + k) simplifies to O(n), achieving linear sorting.

10A rooted tree on vertices 1 through 8 has parent vector [0, 1, 1, 2, 2, 3, 6, 6]. Which set consists exactly of its leaves?

A.{4, 5, 7, 8}

B.{2, 3, 6}

C.{1, 4, 5, 7, 8}

D.{4, 5, 6, 7, 8}

Explanation: A leaf has no children, so its label never occurs as a nonzero entry in the parent vector. The labels used as parents are 1, 2, 3 and 6, leaving 4, 5, 7 and 8 as leaves.

About the UB FMI Computer Science Admission Exam

Independent practice for the Universitatea din București FMI Informatică admission examination. The three-hour official assessment requires one written Mathematics choice and 15 Informatics MCQs. Romanian and English programme versions are confirmed; the English route requires B2 evidence and accepts Romanian or English solutions. This focused English-language MCQ study adaptation supports review but does not replace written Mathematics practice.

Exam sponsor: Universitatea din București — Facultatea de Matematică și Informatică (FMI). The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Assessment

Question count not published by the exam provider

Time Limit

180 minutes (3 hours)

Passing Score

Minimum overall admission mean 5.00/10 (competitive ranking)

Exam / Certification Fees

450 RON

Exam sponsor website

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

Official sources

UB FMI Licență Admission Methodology 2026 · Source checked 2026-10-09Official methodology detailing the 3-hour combined test, 450 RON fee, composite score formula (20% BAC + 80% N), and 15 Informatics MCQs.
UB FMI Admission Subjects and Bibliography Outline · Source checked 2026-10-09Referenced M_mate-info mathematics curriculum and national informatics syllabus for undergraduate entrance.

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.

50%

Informatics (Algorithms, Data Structures, Complexity)

Basic complexity, sorting and searching, arrays and strings, subprograms, recursion, graphs, trees and backtracking.

50%

Mathematics (Algebra, Analysis, Combinatorics)

Linear algebra, matrix equations, limits, derivatives, integration, modular arithmetic, and combinatorial counting.

Preparing for the UB FMI Computer Science Admission Exam

What You Need to Know

Passing score: Minimum overall admission mean 5.00/10 (competitive ranking)
Assessment: Question count not published by the exam provider
Time limit: 180 minutes (3 hours)
Exam / certification fees: 450 RON Official sources

Using Our Practice Resources

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

Frequently Asked Questions

What is the examination structure for UB FMI Computer Science admission?

The examination lasts 3 hours and evaluates both Mathematics (classical written problems) and Informatics (15 multiple-choice questions).

What is the registration fee for UB FMI admission?

The registration fee is 450 RON, with legal fee exemptions applicable to eligible candidate categories.