PracticeVideosBlogFlashcardsEspañol
All Practice Exams

100+ Free Pancyprian Computer Science Practice Questions

Cyprus Pancyprian Access Examination Computer Science (ΠΛΗΡΟΦΟΡΙΚΗ, code 015) practice questions are available now; exam metadata is being verified.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately
100+ Questions
100% Free

Loading practice questions...

Same family resources

Explore More Cyprus Pancyprian Access Examinations

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

Cyprus Pancyprian Access Examination Accounting

Practice Questions

Cyprus Pancyprian Access Examination Advanced Mathematics

Practice Questions

Cyprus Pancyprian Access Examination Ancient Greek

Practice Questions

Cyprus Pancyprian Access Examination Architectural and Technical Drawing

Practice Questions

Cyprus Pancyprian Access Examination Biology

Practice Questions

Cyprus Pancyprian Access Examination Chemistry

Practice Questions
2026 Statistics

Key Facts: Pancyprian Computer Science Exam

015

Official subject code for ΠΛΗΡΟΦΟΡΙΚΗ in the 2026 Pancyprian Access Examinations

Cyprus Examinations Service

3 hours

Official examination duration from the 2026 timetable

Cyprus Examinations Service

EUR 25

2026 fee per access subject (not code 032)

Cyprus Examinations Service

0–20

Marking scale for each Pancyprian subject

Cyprus Examinations Service

8–26 June 2026

Examination period of the 2026 Pancyprian Access Examinations

Cyprus Examinations Service

100

Original practice questions in this study bank

OpenExamPrep

Free 100-question English-language MCQ study bank for Pancyprian Computer Science (code 015). Official duration: 3 hours (08:00–11:00 per the official 2026 timetable). Official fee: EUR 25.00 per access subject in 2026. This bank is a study aid, not an official translation or format simulation.

Sample Pancyprian Computer Science Practice Questions

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

1Which of the following best describes an algorithm?
A.A programming language used to solve computational problems
B.A finite sequence of well-defined, unambiguous steps that solves a problem in finite time
C.A computer program that has been compiled into machine code
D.A diagram showing the hardware components of a computer system
Explanation: An algorithm is a finite, ordered set of precise steps that solves a problem or performs a task. It exists independently of any programming language; a program is only one possible implementation of an algorithm.
2Which of the following is NOT a required property of an algorithm?
A.Finiteness: it must terminate after a finite number of steps
B.Definiteness: each step must be precisely and unambiguously defined
C.It must be written in the C++ programming language
D.Effectiveness: each step must be basic enough to be carried out exactly
Explanation: Algorithms are language-independent: the same algorithm can be expressed in pseudocode, a flowchart, or any programming language. Finiteness, definiteness, and effectiveness are classical required properties of algorithms.
3Trace the pseudocode: x <- 5; y <- 3; x <- x + 2*y; y <- x - y. What is the final value of y?
A.8
B.5
C.11
D.3
Explanation: First x becomes 5 + 2*3 = 11. Then y becomes x - y = 11 - 3 = 8. Note that the updated value of x (11), not the original 5, is used in the last assignment.
4In a flowchart, what does a diamond-shaped symbol represent?
A.An input or output operation
B.The start or end of the algorithm
C.A decision point with a conditional test (e.g. yes/no branches)
D.A processing step such as a calculation
Explanation: In standard flowchart notation, the diamond denotes a decision: a condition is tested and the flow splits into branches (typically yes/no or true/false).
5What precondition must hold for binary search to work correctly on an array?
A.The data must be sorted
B.The data must contain no duplicate values
C.The data must consist of numbers only
D.The array must contain an even number of elements
Explanation: Binary search works by comparing the target with the middle element and discarding half of the remaining range. This halving logic is only valid when the data are ordered.
6A sorted array contains 1000 elements. Using binary search, what is the maximum number of comparisons needed to find a target value (or conclude it is absent)?
A.500
B.100
C.10
D.1000
Explanation: Each comparison halves the search range. Since 2^10 = 1024 >= 1000, at most 10 comparisons are needed (ceiling of log2(1000)). This illustrates the logarithmic efficiency of binary search.
7In the worst case, how many comparisons does linear (sequential) search need on an array of n elements?
A.1
B.n/2
C.log2 n
D.n
Explanation: Linear search checks elements one by one from the start. In the worst case (target absent or in the last position) all n elements are examined, so n comparisons are made.
8Trace the pseudocode: s <- 0; for i <- 1 to 5 do s <- s + i. What is the final value of s?
A.10
B.15
C.20
D.5
Explanation: The loop accumulates 1 + 2 + 3 + 4 + 5 = 15. This is the classic accumulator pattern: a variable initialized to zero that gathers a running total.
9Trace the pseudocode: n <- 1; c <- 0; while n < 100 do { n <- n * 2; c <- c + 1 }. What is the final value of c?
A.6
B.7
C.8
D.100
Explanation: The values of n at each test are 1, 2, 4, 8, 16, 32, 64 (loop runs), then 128 (loop stops). The body executed 7 times, so c = 7.
10Trace the pseudocode: a <- 4; b <- 7; temp <- a; a <- b; b <- temp. What are the final values?
A.a = 4, b = 7
B.a = 7, b = 7
C.a = 7, b = 4
D.a = 4, b = 4
Explanation: The temporary variable preserves the original value of a (4). After a <- b, a is 7; then b <- temp restores the original a into b, giving a = 7 and b = 4. This is the standard swap idiom.

About the Pancyprian Computer Science Practice Questions

Verified exam format metadata for Cyprus Pancyprian Access Examination Computer Science (ΠΛΗΡΟΦΟΡΙΚΗ, code 015) is pending. The practice questions above remain available while official exam length, timing, passing score, fee, and administrator details are reviewed.