🇵🇰 NTS NAT-ICS · flashcards

NTS NAT-ICS Computer Science Flashcards

50 question-and-answer cards covering Computer Science as it is examined in NTS NAT-ICS. 24 of them are printed below, taken from across the deck — no signup, no paywall on the preview.

50Cards in deck
24Free preview
21Syllabus topics
~79Chars per answer
FreePrice

24 sample cards from the Computer Science deck

Sampled from the end of the deck, so these are different cards from the ones shown on the syllabus page.

  1. What is the base (radix) of the binary, octal, decimal, and hexadecimal number systems?

    Binary = 2, Octal = 8, Decimal = 10, Hexadecimal = 16.

  2. Which digits/symbols are used in the hexadecimal number system?

    0-9 and A, B, C, D, E, F (where A=10, B=11, C=12, D=13, E=14, F=15).

  3. How do you convert a decimal integer to binary?

    Repeatedly divide the number by 2 and record the remainders; the binary value is the remainders read from bottom to top.

  4. How many binary digits (bits) represent one octal digit and one hexadecimal digit?

    One octal digit = 3 bits; one hexadecimal digit = 4 bits.

  5. Convert the binary number 1011 to decimal.

    11 (8 + 0 + 2 + 1 = 11).

  6. Convert the decimal number 25 to binary.

    11001.

  7. Convert the binary number 11110 to octal.

    36 (group as 011 110 = 3 6).

  8. Convert the binary number 11111111 to hexadecimal.

    FF (group as 1111 1111 = F F).

  9. Convert the hexadecimal number 2A to decimal.

    42 (2x16 + 10 = 32 + 10 = 42).

  10. What is a bit, and what is a byte?

    A bit is a single binary digit (0 or 1); a byte is a group of 8 bits.

  11. What does ASCII stand for and how many bits does standard ASCII use?

    American Standard Code for Information Interchange; standard ASCII uses 7 bits, representing 128 characters.

  12. What is Unicode and why is it used instead of ASCII?

    Unicode is a universal character encoding standard that can represent characters from virtually all writing systems worldwide, overcoming ASCII's limitation of only 128/256 characters.

  13. What is the ASCII value of the uppercase letter 'A' and the digit '0'?

    'A' = 65 and '0' = 48.

  14. What are the three basic logic gates?

    AND, OR, and NOT gates.

  15. What is the output of an AND gate, and of an OR gate?

    AND outputs 1 only when ALL inputs are 1; OR outputs 1 when AT LEAST ONE input is 1.

  16. What does a NOT gate (inverter) do?

    It reverses/inverts the input: output is 1 when input is 0, and 0 when input is 1.

  17. What are NAND and NOR gates, and why are they special?

    NAND = NOT-AND, NOR = NOT-OR. They are 'universal gates' because any logic circuit can be built using only NAND or only NOR gates.

  18. When does an XOR (Exclusive OR) gate output 1?

    When its inputs are different (an odd number of 1s); output is 0 when inputs are the same.

  19. State De Morgan's two theorems in Boolean algebra.

    NOT(A AND B) = NOT A OR NOT B; and NOT(A OR B) = NOT A AND NOT B.

  20. In Boolean algebra, what do A + 1 and A . 0 equal?

    A + 1 = 1 and A . 0 = 0.

  21. List four major functions of an operating system.

    Process/CPU management, Memory management, File management, and Device (I/O) management (also providing a user interface and security).

  22. What is the difference between multitasking and multiprogramming?

    Multiprogramming keeps several programs in memory so the CPU is never idle; multitasking lets a single user run multiple tasks/programs apparently simultaneously.

  23. What is virtual memory?

    A memory-management technique that uses part of the hard disk as an extension of RAM, allowing the system to run programs larger than physical memory.

  24. What is a flowchart, and which symbols represent start/stop, process, and decision?

    A diagram that represents an algorithm step-by-step using symbols: oval = start/stop (terminal), rectangle = process, and diamond = decision.

What this deck covers

The Computer Science deck follows the NTS NAT-ICS Computer Science syllabus — 6 chapters and 21 topics — so questions land on material that is genuinely examinable rather than trivia around it. That works out to roughly 8.3 cards per chapter.

Answers are written to be recallable, not just readable — averaging about 79 characters, which is long enough to carry the reasoning and short enough to say out loud.

A deck like this earns its keep on the second and third pass. Read the syllabus first so you know the shape of the subject, then use the cards to find the specific facts that have not stuck.

Computer Science flashcards FAQ

How many Computer Science flashcards are in this NTS NAT-ICS deck?

50 cards. This page previews 24 of them, sampled evenly across the deck so you can judge the difficulty before installing anything.

Are these NTS NAT-ICS flashcards free?

Yes. The preview here is free to read with no signup, and the full 50-card deck is free inside the Examius app.

What do the Computer Science cards cover?

They follow the NTS NAT-ICS Computer Science syllabus — 6 chapters and 21 topics — so the questions track what is actually examinable.

How should I use these flashcards?

Read the syllabus first so you know the shape of the subject, then drill the deck. Examius schedules each card with spaced repetition, so cards you keep missing come back sooner and ones you know drift further apart.