JAMB2026 UTME registration opens — closes April 25.NUCNUC approves 4 new private universities; full list released.WAECMay/June WASSCE timetable now available for SS3 finalists.NBTEPolytechnic ND/HND mobility framework reaffirmed for 2026/27.NCCENCE curriculum review begins across federal Colleges of Education.NYSCBatch B Stream II call-up letters to be printed from May 30.CampusTutorNew: Adaptive Exam Practice — try a free 10-question simulation.CampusTutorCGPA Forecast v2 is live — predict your semester before exams.

UNILORIN · 100 level · 3 units

UNILORIN CSC 101 — Introduction to Computer Science / Introduction to Computing Past Questions

Recurring exam topics, sample past questions and revision strategy for CSC 101 at University of Ilorin.

About CSC 101 at UNILORIN

CSC 101 (or COSC 101, COS 101 depending on institution) introduces the foundational concepts of computer science to first-year students across many faculties. The course typically covers a brief history of computing, generations of computer hardware, classification of computers, internal organisation (CPU, memory, I/O), number systems (binary, octal, hexadecimal conversions), introduction to algorithm design and flowcharting, basic programming concepts, an introduction to operating systems, and a survey of application software. Past questions at this level emphasise definitions, classifications and number-system conversions — three areas where students often lose marks because they over-rely on intuition rather than memorising the conversion procedure. Students from non-computer-science faculties find the course mostly straightforward but stumble on binary arithmetic and flowchart construction, while students from computer-science faculties find the theoretical history and classification questions deceptively wide-ranging. CA usually involves a mid-semester test and a graded flowchart or short program. The exam typically lasts 2 hours and tests breadth rather than depth — so do not over-specialise. Cover everything, lightly.

Recurring Topics in CSC 101 Past Papers

  • History of computing

    Generations, key inventors, mechanical to electronic transitions.

  • Computer classifications

    By size (super, mainframe, mini, micro), by purpose, by type (analog, digital, hybrid).

  • Number systems

    Conversion between binary, octal, decimal and hexadecimal; binary arithmetic.

  • Computer organisation

    CPU, memory hierarchy, input/output devices, system bus.

  • Algorithm and flowcharting

    Pseudocode, flowchart symbols, basic control structures.

  • Programming basics

    High vs low-level languages, compilers vs interpreters.

  • Operating systems

    Functions, types (batch, time-sharing, real-time), examples.

Sample Past Questions (CSC 101)

  1. Q1. Convert the binary number 10110110₂ to decimal and hexadecimal.

  2. Q2. List four functions of an operating system.

  3. Q3. Draw a flowchart to find the largest of three numbers entered by a user.

  4. Q4. Differentiate between a compiler and an interpreter, giving one example of each.

  5. Q5. Explain three generations of computers and the dominant technology in each.

3 more past questions — unlock free with a CampusTutor account

  1. Q6. Convert 437₁₀ to binary.

  2. Q7. List five differences between RAM and ROM.

  3. Q8. Define an algorithm. State four properties of a good algorithm.

Unlock the full UNILORIN CSC 101 pack

CSC 101 Exam Format at UNILORIN

Typically a 2-hour examination with a mix of objective (40 marks), short-answer definitions (30 marks) and one long question requiring a flowchart or short pseudocode (30 marks). CA contributes 30 percent.

Practise CSC 101 the smart way

CampusTutor walks you through every past question step-by-step, generates new variations of the same archetype, and quizzes you until the steps are automatic.

Start free — UNILORIN CSC 101 prep