All Practice Exams

Free Practice Questions for Sudan School Certificate — Computer Science

Exam-style questions and explanations by OpenExamPrep.

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

Loading practice questions...

Sample Sudan School Certificate — Computer Science Practice Questions

Try these sample questions to review concepts for the Sudan School Certificate — Computer Science exam. Each question includes a detailed explanation. Start the interactive quiz above for the full 20+ question experience with AI tutoring.

1What is the decimal value of the binary number 10110?
A.18
B.22
C.26
D.44
Explanation: The nonzero place values are 16, 4 and 2. Their sum is 22.
2For input pairs (A,B) = (1,0) and then (1,1), what are an AND gate's outputs in that order?
A.1 then 1
B.1 then 0
C.0 then 1
D.0 then 0
Explanation: An AND gate produces 1 only when both inputs are 1. The first pair therefore gives 0 and the second gives 1.
3In an 8-bit two's-complement system, how is -5 represented?
A.10000101
B.11111010
C.00000101
D.11111011
Explanation: Positive 5 is 00000101. Invert all bits to obtain 11111010, then add 1 to obtain 11111011.
4For Boolean variables, simplify NOT(A AND B) AND A.
A.A AND NOT B
B.NOT A AND B
C.A OR NOT B
D.NOT A OR NOT B
Explanation: De Morgan's law gives (NOT A OR NOT B) AND A. Distributing removes A AND NOT A and leaves A AND NOT B.
5Which data structure removes items in last-in, first-out order?
A.Queue
B.Stack
C.Sorted array
D.Relational table
Explanation: A stack removes the most recently pushed item first. Its push and pop operations normally use the same end.
6Array A occupies consecutive memory locations, each element using 4 bytes. A[0] begins at address 1000. Where does A[3] begin?
A.1003
B.1008
C.1012
D.1016
Explanation: The offset for index 3 is 3 times 4 = 12 bytes. Adding this to the base address gives 1012.
7In a singly linked list, node P points to node Q. To insert new node N between them without losing Q, which sequence is correct?
A.Set P.next = N; then N.next = P.next
B.Set N.next = P; then P.next = Q
C.Set Q.next = N; then N.next = P
D.Set N.next = Q; then P.next = N
Explanation: First preserve the link from N to the original successor Q. Then redirect P to N, producing P -> N -> Q.
8In Pascal, after 's := 0; for i := 1 to 4 do s := s + i;', what is s?
A.10
B.4
C.6
D.24
Explanation: The loop includes i = 1, 2, 3 and 4. Adding these to the initial zero gives 10.
9Which condition must hold for the usual binary-search algorithm on an array?
A.All values must be identical
B.The array must be ordered by the search key
C.The key must be at the first position
D.The array must contain an even number of entries
Explanation: Binary search uses the comparison with a middle element to discard half the remaining range. This deduction requires ordering by the same key used for the comparisons.
10One left-to-right bubble-sort pass compares adjacent entries and swaps them when the left one is larger. Starting with [5, 1, 4, 2], what remains after this pass?
A.[1, 2, 4, 5]
B.[1, 5, 2, 4]
C.[1, 4, 2, 5]
D.[5, 4, 2, 1]
Explanation: The swaps produce [1,5,4,2], then [1,4,5,2], then [1,4,2,5]. A single pass places the largest element at the end but need not sort the whole array.

About the Sudan School Certificate — Computer Science Exam

Independent English-language MCQ study adaptation for the Arabic Computer Science paper. It is not an official translation or format simulation and does not replace writing algorithms, tracing programs or drawing system diagrams.

Exam sponsor: Ministry of National Education (وزارة التعليم والتربية الوطنية); General Directorate of Measurement, Evaluation and Examinations (الإدارة العامة للقياس والتقويم والامتحانات), Sudan. The requirements and fees below concern the certification or admission exam, separate from our free practice resources.

Assessment

One three-hour, 100-mark written paper in the published 2025 guide. Tasks include binary arithmetic, Pascal tracing, searching and sorting, coding, Unix commands, data structures and system diagrams. A separate mandatory programming practical, oral or coursework component was not established in the accessed sources.

Time Limit

3 hours

Passing Score

Unknown — confirm the current pass standard with the examination authority.

Exam / Certification Fees

Unknown — confirm the current examination sitting fee with the examination authority.

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.

20%; 4 practice items

Logic circuits and binary counting

Logic gates, Boolean simplification and binary representation.

20%; 4 practice items

Data structures

Stacks, arrays, linked lists and Pascal tracing.

20%; 4 practice items

Graphical algorithms (الخوارزميات البيانية)

Search, sorting, comparison counts and prefix coding; not a separate SQL unit.

20%; 4 practice items

Operating systems

CPU scheduling, Unix commands, process states and batch processing.

20%; 4 practice items

Analysis and design of automated information systems

Requirements, record identification, entity relationships and output testing.

Preparing for the Sudan School Certificate — Computer Science Exam

What You Need to Know

  • Passing score: Unknown — confirm the current pass standard with the examination authority.
  • Assessment: One three-hour, 100-mark written paper in the published 2025 guide. Tasks include binary arithmetic, Pascal tracing, searching and sorting, coding, Unix commands, data structures and system diagrams. A separate mandatory programming practical, oral or coursework component was not established in the accessed sources.
  • Time limit: 3 hours
  • Exam / certification fees: Unknown — confirm the current examination sitting fee with the examination authority. Official sources

Using Our Practice Resources

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

Sudan School Certificate — Computer Science: Suggested Study Strategy

1Trace every loop iteration and pointer change on paper.
2Use the current prescribed textbook, including its Pascal and Unix terminology.

Frequently Asked Questions

Is this a programming practical simulation?

No. These questions teach recognition and reasoning; practise writing and tracing the required procedures separately.

Who takes this paper?

The published guide lists Computer Science among the academic science stream's seventh-subject choices. Confirm current registration and eligibility with the examination administration.

Are the current sitting fee and pass mark verified?

No. These fields are pending primary-source confirmation. Check the current examination instructions and your registered school or centre. The Ministry portal publishes certificate issuance charges; those do not establish the examination sitting fee or a per-subject total.