PracticeVideosBlogFlashcardsEspañol
All Practice Exams

Free Practice Questions for EGEL Plus Ciencias Computacionales

Exam-style questions and explanations by OpenExamPrep.

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

Loading practice questions...

Same family resources

Explore More Ceneval EGEL Plus Licenciatura Exit Examinations (Mexico)

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

CENEVAL EGEL Plus Ingeniería de Software (EGEL Plus ISOFT)

Practice Questions

CENEVAL EGEL Plus Administración (EGEL Plus ADMON)

Practice Questions

CENEVAL EGEL Plus Comercio/Negocios Internacionales (EGEL Plus CNI)

Practice Questions

CENEVAL EGEL Plus Informática (EGEL Plus INFO)

Practice Questions

CENEVAL EGEL Plus Arquitectura (EGEL Plus ARQUI)

Practice Questions

CENEVAL EGEL Plus Mercadotecnia (EGEL Plus MERCA)

Practice Questions
Exam Review

Key Facts: EGEL Plus Ciencias Computacionales Exam

200

Total items on the official EGEL Plus COMPU (140 disciplinary + 60 transversal)

Ceneval, Guía para el sustentante EGEL Plus COMPU

9 hours

Two sessions of 4.5 hours each on the same day

Ceneval, Guía para el sustentante EGEL Plus COMPU

1000

Minimum Índice Ceneval for a Satisfactorio level in an area or section

Ceneval, Guía para el sustentante EGEL Plus COMPU

1150

Minimum Índice Ceneval for a Sobresaliente level

Ceneval, Guía para el sustentante EGEL Plus COMPU

MXN 1,885

Individual national Examen desde casa fee in 2026

Ceneval EGEL portal

Ceneval's EGEL Plus COMPU is a 200-item, nine-hour Spanish exit exam: 140 disciplinary items in four computer science areas plus 60 transversal language and communication items.

Sample EGEL Plus Ciencias Computacionales Practice Questions

Try these sample questions to review concepts for the EGEL Plus Ciencias Computacionales exam. Each question includes a detailed explanation. Start the interactive quiz above for the full 106+ question experience with AI tutoring.

1Given the recurrence T(n) = 4T(n/2) + n², which tight bound does the Master Theorem give for T(n)?
A.Θ(n² log n)
B.Θ(n²)
C.Θ(n³)
D.Θ(n log n)
Explanation: In the form T(n) = aT(n/b) + f(n), a = 4, b = 2 and f(n) = n². The critical exponent is log₂ 4 = 2, so n^(log_b a) = n². Because f(n) = Θ(n²) matches it exactly, Case 2 applies and T(n) = Θ(n² log n).
2What is the worst-case time complexity of inserting a key into a binary search tree with n nodes that is not self-balancing?
A.O(log n)
B.O(n)
C.O(1)
D.O(n log n)
Explanation: If keys arrive in sorted order, an unbalanced BST degenerates into a chain of height n. Inserting at the bottom of that chain visits every node, so the worst case is O(n).
3An algorithm must find the shortest path between all pairs of vertices in a directed, edge-weighted graph with 50 vertices that contains some negative edge weights but no negative-weight cycles. Which algorithm should be chosen?
A.Dijkstra's algorithm with a Fibonacci heap
B.Kruskal's algorithm
C.Floyd-Warshall algorithm
D.Breadth-First Search (BFS)
Explanation: Floyd-Warshall computes all-pairs shortest paths by dynamic programming in O(V³) time, about 125,000 steps for 50 vertices, and it handles negative edge weights as long as there is no negative cycle. Dijkstra's algorithm can give wrong results with negative edges, Kruskal's algorithm builds a minimum spanning tree, and BFS only finds shortest paths in unweighted graphs.
4A max-heap stored in an array holds n elements after a new element is appended at the end. What is the maximum number of swaps sift-up (bubble-up) can perform to restore the heap?
A.n − 1
B.⌈n/2⌉
C.2^⌊log₂ n⌋
D.⌊log₂ n⌋
Explanation: A heap is a complete binary tree, so its height is ⌊log₂ n⌋. Sift-up moves the new element from a leaf toward the root with at most one swap per level, so it performs at most ⌊log₂ n⌋ swaps.
5Which proposition is logically equivalent to the implication P → Q?
A.¬P ∨ Q
B.¬Q → P
C.P ∧ ¬Q
D.¬P → ¬Q
Explanation: P → Q is false only when P is true and Q is false, so it is equivalent to ¬(P ∧ ¬Q), which by De Morgan's law is ¬P ∨ Q.
6How many edges does the complete bipartite graph K₄,₇ have?
A.11
B.28
C.55
D.22
Explanation: In a complete bipartite graph K_m,n, every vertex of the first part (m vertices) is joined to every vertex of the second part (n vertices), so there are m × n = 4 × 7 = 28 edges.
7In dynamic programming, what two fundamental properties must a problem exhibit for dynamic programming to be applicable and optimal?
A.Greedy choice property and optimal substructure
B.Divide-and-conquer and disjoint subproblems
C.Optimal substructure and overlapping subproblems
D.Monotonicity and linear convergence
Explanation: Dynamic programming requires optimal substructure (an optimal solution contains optimal solutions to subproblems) and overlapping subproblems (the recursive algorithm visits the same subproblems repeatedly rather than generating new ones).
8A hash table of size m = 11 uses open addressing with linear probing and h(k) = k mod 11. Keys 22, 33, 44 and 55 are inserted in that order into an empty table. At which index is key 55 stored?
A.0
B.1
C.2
D.3
Explanation: All four keys hash to 0 because each is a multiple of 11. Key 22 takes index 0; 33 collides and probes to 1; 44 collides at 0 and 1 and takes 2; 55 collides at 0, 1 and 2 and is stored at index 3.
9What is the chromatic number χ(G) of any bipartite graph that has at least one edge?
A.2
B.1
C.3
D.4
Explanation: A graph is bipartite exactly when its vertices split into two independent sets V₁ and V₂ with every edge running between them. Coloring V₁ with one color and V₂ with another is a proper 2-coloring, and one color is not enough once an edge exists, so χ(G) = 2.
10Which sorting algorithm is stable and has a worst-case time complexity of O(n log n)?
A.Quick Sort
B.Merge Sort
C.Heap Sort
D.Selection Sort
Explanation: Merge sort splits the array recursively and merges sorted halves, keeping equal keys in their original order (stable), with a guaranteed O(n log n) worst case. Quick sort is O(n²) in the worst case and usually unstable, heap sort is O(n log n) but unstable, and selection sort is O(n²).

About the EGEL Plus Ciencias Computacionales Exam

Independent EGEL Plus Ciencias Computacionales practice by OpenExamPrep. The official Ceneval examination is in Spanish and has 200 items, mostly three-option multiple choice: 140 disciplinary items in Algoritmia, Desarrollo de software de base, Desarrollo de software de aplicación and Soluciones de cómputo inteligente, and 60 transversal Lenguaje y Comunicación items. This bank is an English-language study adaptation with four-option multiple-choice questions, not an official translation or format simulation. It covers the four disciplinary areas only; it does not include Lenguaje y Comunicación items.

Exam sponsor: Centro Nacional de Evaluación para la Educación Superior (Ceneval). The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Assessment

200 items, mostly three-option multiple choice: 140 disciplinary items (Algoritmia 40, Desarrollo de software de base 30, Desarrollo de software de aplicación 40, Soluciones de cómputo inteligente 30) and 60 transversal items in Comprensión lectora and Redacción indirecta. About 15% of the items are unscored pilot items.

Time Limit

Two sessions of 4.5 hours each on the same day (9 hours in total)

Passing Score

Each area and each section is reported on the Índice Ceneval (700-1300): 700-999 Aún no satisfactorio, 1000-1149 Satisfactorio, 1150-1300 Sobresaliente. The global result is weighted toward the disciplinary section: Satisfactorio or better there earns at least a Testimonio de Desempeño Satisfactorio, and a Testimonio de Desempeño Sobresaliente requires Sobresaliente in the disciplinary section and at least Satisfactorio in Lenguaje y Comunicación

Exam / Certification Fees

MXN 1,885 for the 2026 national Examen desde casa; institutional administrations may charge a different amount

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.

40 of 140 disciplinary items

Algoritmia

Analysis and design of algorithms (10), data structures (10), discrete mathematics (10), and computational logic (10)

30 of 140 disciplinary items

Desarrollo de software de base

Computer architecture and operating systems (10), compilers (10), and computer networks (10)

40 of 140 disciplinary items

Desarrollo de software de aplicación

Software engineering (10), programming languages (10), databases (10), and information security (10)

30 of 140 disciplinary items

Soluciones de cómputo inteligente

Artificial intelligence (10), data mining (10), and distributed computing (10)

60 of 200 total items

Lenguaje y Comunicación

Reading comprehension of study, literary and social-participation texts (30 items) and indirect writing, which asks candidates to choose the version of a text that is correct, coherent and well punctuated (30 items)

Preparing for the EGEL Plus Ciencias Computacionales Exam

What You Need to Know

  • Passing score: Each area and each section is reported on the Índice Ceneval (700-1300): 700-999 Aún no satisfactorio, 1000-1149 Satisfactorio, 1150-1300 Sobresaliente. The global result is weighted toward the disciplinary section: Satisfactorio or better there earns at least a Testimonio de Desempeño Satisfactorio, and a Testimonio de Desempeño Sobresaliente requires Sobresaliente in the disciplinary section and at least Satisfactorio in Lenguaje y Comunicación
  • Assessment: 200 items, mostly three-option multiple choice: 140 disciplinary items (Algoritmia 40, Desarrollo de software de base 30, Desarrollo de software de aplicación 40, Soluciones de cómputo inteligente 30) and 60 transversal items in Comprensión lectora and Redacción indirecta. About 15% of the items are unscored pilot items.
  • Time limit: Two sessions of 4.5 hours each on the same day (9 hours in total)
  • Exam / certification fees: MXN 1,885 for the 2026 national Examen desde casa; institutional administrations may charge a different amount Official sources

Using Our Practice Resources

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

EGEL Plus Ciencias Computacionales: Suggested Study Strategy

1Algoritmia is tied for the largest area (40 items): practice recurrences and the Master Theorem, asymptotic notation, data structures, counting, graph theory, Boolean algebra and predicate logic.
2For system software, review the Von Neumann architecture, process scheduling, memory management and paging, automata and grammars, the phases of a compiler, and the OSI and TCP/IP models.
3For application development, review normalization and SQL, transactions and concurrency, UML and software engineering phases, programming paradigms, and symmetric and asymmetric encryption.
4For intelligent computing, review search algorithms and heuristics, knowledge representation, fuzzy membership functions, k-nearest neighbors, clustering and dendrograms, the KDD process, and distributed and cloud computing.
5Prepare for Lenguaje y Comunicación separately by reading academic, literary and public-interest texts in Spanish and by reviewing agreement, punctuation, accentuation and connectors.

Frequently Asked Questions

What is the EGEL Plus Ciencias Computacionales?

The EGEL Plus Ciencias Computacionales (EGEL Plus COMPU) is Ceneval's national exit examination for graduates of the Licenciatura en Ciencias Computacionales and related programs. It measures the knowledge and skills considered indispensable at the end of the degree, plus Spanish reading comprehension and indirect writing. Institutions may use the result as a graduation requirement, a titulación option or part of a course grade, under their own rules; a Testimonio does not by itself determine the award of the degree or the cédula profesional.

How many questions are on the official EGEL Plus COMPU and how long is it?

The official exam has 200 items: 140 disciplinary items (Algoritmia 40, Desarrollo de software de base 30, Desarrollo de software de aplicación 40, Soluciones de cómputo inteligente 30) and 60 Lenguaje y Comunicación items (30 reading comprehension and 30 indirect writing). It is given on one day in two sessions of 4.5 hours each (9 hours). About 15% of the items are pilot items that do not count toward the result.

How is the EGEL Plus COMPU scored?

Each area and section is reported on the Índice Ceneval from 700 to 1300: 700-999 Aún no satisfactorio, 1000-1149 Satisfactorio and 1150-1300 Sobresaliente. Areas are weighted by their number of items within each section. The global result follows a conjunctive rule weighted toward the disciplinary section: Satisfactorio or better in the disciplinary section earns at least a Testimonio de Desempeño Satisfactorio, while a Testimonio de Desempeño Sobresaliente requires Sobresaliente in the disciplinary section and at least Satisfactorio in Lenguaje y Comunicación.

Can I use a calculator or formula sheet on the EGEL Plus COMPU?

The official guide allows a non-programmable scientific calculator, which may not be shared between candidates. No formula sheet is listed among the permitted materials, so memorize the formulas you need.

Why is this practice bank in English if the official exam is in Spanish?

The official Ceneval exam is in Spanish. This bank is an independent English-language study adaptation with four-option questions, not an official translation or format simulation, so you can review the computer science content. It covers the four disciplinary areas only and does not include Lenguaje y Comunicación items or the computer-based innovation item formats.

How does EGEL Plus Ciencias Computacionales differ from EGEL Plus Ingeniería Computacional and Ingeniería de Software?

They are separate Ceneval exams. Ciencias Computacionales weights algorithms, discrete mathematics and logic (40 items), system software such as operating systems, compilers and networks (30), application development (40) and intelligent computing, including AI, data mining and distributed computing (30). Ingeniería Computacional gives about a third of its items to hardware implementation, and Ingeniería de Software focuses on requirements analysis, design, development and project management.