NoTuition.inNoTuition.in Start free

Class 10 olympiad-style practice

Class 10 Computer Olympiad Practice

Our Class 10 computer set covers logic gates, Python lists and dictionaries, functions, SQL and internet protocols, along with AI, robots and new gadgets, and a reasoning section on coding, blood relations, scheduling puzzles and syllogisms, with an explanation for every answer.

Our mock test pattern for Class 10 Computer

Each of the 4 mock tests has 50 questions for 60 marks, to finish in 60 minutes. There is no negative marking.

SectionQuestionsMarks eachMarks
Logical Reasoning10110
Computer Science30130
AI, Robotics and IT515
Achievers section5315
Total5060

Our sections and question counts follow the Level 1 layout that the Science Olympiad Foundation (SOF) publishes on sofworld.org, as checked on 27 October 2026. The questions are written by our team. Organisers can change a pattern, so confirm the current one with your school.

Topics in our Class 10 Computer olympiad syllabus

Logical Reasoning

Computer Science

AI, Robotics and IT

The 8 topic worksheets

  1. Computer organisation and data (difficulty 1, 15 questions, free)
    Buses and addresses, cache and memory types, cores, units with 1024, bits for a range, base conversions, ASCII, Unicode and hex colour codes.
  2. Code puzzles, analogies and syllogisms (difficulty 1, 15 questions)
    Letter, sentence and symbol codes, an alphabet test, word and letter-group analogies, odd one out, and syllogisms with possibility conclusions.
  3. Boolean algebra and logic gates (difficulty 2, 15 questions)
    Gate circuits, NAND and NOR as universal gates, De Morgan's and other Boolean laws, XOR and XNOR, and binary addition and subtraction.
  4. Python: loops and collections (difficulty 2, 15 questions)
    Nested loops and patterns, break and continue, slicing, list and string methods, tuples, dictionaries and the line that raises an error.
  5. Relations and arrangement puzzles (difficulty 2, 15 questions)
    Family puzzles and trees, blood and marriage links, seating with mixed facing directions, and scheduling puzzles with must-be-true and could-be-true choices.
  6. Databases, web forms and networks (difficulty 2, 15 questions)
    SQL results from small tables, keys, form controls and CSS for an admission form, box widths, protocols and devices, and transfer times.
  7. Python functions and programs (difficulty 3, 15 questions)
    Parameters, default arguments, return and print, local and global names, built-in and math functions, error names, and longer traces.
  8. Security, AI and mixed challenge (difficulty 3, 15 questions)
    Encryption, attacks and cyber law, AI methods and ethics, robot control, e-governance and emerging IT, hard puzzles and Achievers practice.

After the worksheets come 4 full mock tests in the pattern above, each with a 60-minute timer and section-wise results.

The guided lab and Worksheet 1 of each set are free to use now. Paid plans are launching soon: Pro will open worksheets 1 to 4 and mock tests 1 and 2, and Pro+ all 8 worksheets and all 4 mock tests.

Free guided lab

Get to know the Class 10 computer olympiad-style paper and practise the habits each section needs, from letter codes, syllogisms and seating puzzles to logic gates, Python, SQL, CSS, networks, cyber law, AI and robots, and the 3-mark Achievers questions. The lab is free on every plan. It walks through the paper section by section, works 3 to 5 examples one step at a time, and ends with common mistakes and a short exam-day summary. It takes about 25 minutes.

Class 10 Computer olympiad questions with answers

These 10 questions are from Worksheet 1, the free worksheet in this set. Try each one before you open the answer.

Q1. A CPU must store the number 42 in the memory location whose address is 3000. Which bus carries which value?

  1. The address bus carries 3000, and the data bus carries 42
  2. The address bus carries 42, and the data bus carries 3000
  3. The control bus carries 3000, and the data bus carries 42
  4. The address bus carries both 3000 and 42, one after the other
Show answer

Answer: (a) The address bus carries 3000, and the data bus carries 42

The address bus says where in memory the value goes (location 3000), and the data bus carries what is stored there (42). The control bus carries signals such as 'write now', not addresses or values, and one bus never carries both the address and the data.

Q2. A small computer has an address bus with 16 lines and a data bus with 8 lines, and each address holds one byte. A program tries to store the number 200 at address 70,000. Which statement is correct?

  1. Both the address and the value are out of reach for this computer
  2. The address is out of reach, but the value fits on the data bus
  3. The value is too large for the data bus, but the address can be reached
  4. Both the address and the value are fine for this computer
Show answer

Answer: (b) The address is out of reach, but the value fits on the data bus

16 address lines give 2 to the power 16 = 65,536 addresses (0 to 65,535), so 70,000 cannot be named. 8 data lines carry values from 0 to 255, and 200 lies within that.

Q3. A program reads 1000 numbers that are stored one after another in RAM, in order and once each. Each number takes 8 bytes, and the first one starts at the beginning of a cache line. The cache starts empty. On a miss, the CPU copies the whole 64-byte cache line that holds the number into the cache, and it brings nothing else into the cache. Nothing is removed from the cache during the run. How many of the 1000 reads are misses, and how many are hits?

  1. 1000 misses and no hits
  2. 8 misses and 992 hits
  3. 125 misses and 875 hits
  4. 875 misses and 125 hits
Show answer

Answer: (c) 125 misses and 875 hits

The 1000 numbers take 1000 × 8 = 8000 bytes, which fill 8000 ÷ 64 = 125 cache lines. The first read in each line misses and brings in all 64 bytes, that is, 8 numbers, so the next 7 reads in that line are hits. That gives 125 misses and 1000 − 125 = 875 hits. Even though each number is read only once, the cache helps, because data stored next to the number just used is likely to be needed soon. Dividing 64 by 8 gives the 8 numbers in each line, not the number of misses.

Q4. Cache memory is usually made of SRAM, and main memory of DRAM. Which statement about these two kinds of RAM is correct?

  1. SRAM keeps its data after the power is switched off, which is why it holds the start-up firmware
  2. DRAM keeps each bit as charge in a tiny capacitor that leaks, so it must be refreshed many times a second
  3. SRAM has to be refreshed many times every second, while DRAM holds its bits as long as the power stays on
  4. DRAM is faster than SRAM, which is why the larger main memory is made of DRAM and not of SRAM
Show answer

Answer: (b) DRAM keeps each bit as charge in a tiny capacitor that leaks, so it must be refreshed many times a second

A DRAM bit is a small charge that slowly leaks away, so the memory is read and rewritten (refreshed) all the time. SRAM needs no refresh and is faster, but it is costlier; both lose their data when the power goes off.

Q5. Harleen's laptop has 8 GB of RAM, and the operating system and her other programs use 2 GB of it. Each web browser tab she opens needs 320 MB. Taking 1 GB = 1024 MB, how many tabs fit in the RAM that is left?

  1. 20
  2. 18
  3. 25
  4. 19
Show answer

Answer: (d) 19

The free RAM is 6 GB = 6 × 1024 = 6144 MB, and 6144 ÷ 320 = 19.2, so 19 whole tabs fit. Using 1000 MB for 1 GB gives 6000 ÷ 320 = 18.75, which wrongly suggests 18, and 20 comes from rounding 19.2 up.

Q6. Lalremruati is choosing between two laptops for exporting videos. On one core, part X of an export takes 20 s and cannot be split up, because each step needs the one before it. Part Y takes 80 s on one core but splits evenly over any number of cores. Laptop P has 2 cores and laptop Q has 8 cores, of the same design and clock speed. About how long does the export take on each laptop? (Ignore the time needed to share out the work.)

  1. P: 40 s, Q: 10 s
  2. P: 60 s, Q: 30 s
  3. P: 50 s, Q: 12.5 s
  4. P: 100 s, Q: 100 s
Show answer

Answer: (b) P: 60 s, Q: 30 s

Part X cannot be split, so it takes 20 s however many cores there are. Part Y shares out evenly: 80 ÷ 2 = 40 s on P and 80 ÷ 8 = 10 s on Q. So P takes 20 + 40 = 60 s and Q takes 20 + 10 = 30 s. Splitting all 100 s gives 50 s and 12.5 s, forgetting part X gives 40 s and 10 s, and 100 s on both ignores the extra cores. Q has four times the cores of P but is only twice as fast, because the part that cannot be split does not speed up.

Q7. A data logger in a vaccine store records whole-number temperatures from −90 °C to 37 °C. Each reading is saved as a binary code that numbers these values in order. What is the smallest number of bits each code needs?

  1. 128
  2. 8
  3. 7
  4. 6
Show answer

Answer: (c) 7

From −90 to 37 there are 37 + 90 + 1 = 128 whole numbers, and 7 bits give exactly 2 to the power 7 = 128 codes. Adding a sign bit to the 7 bits for 90 gives 8, which is more than needed, and 128 is the number of values, not of bits.

Q8. A photo filter makes a 'negative' by replacing each of the red, green and blue amounts in a colour code with FF minus that amount. A logo is pure green, #00FF00. What colour does the filter turn it into?

  1. Yellow, #FFFF00
  2. Cyan, #00FFFF
  3. Red, #FF0000
  4. Magenta, #FF00FF
Show answer

Answer: (d) Magenta, #FF00FF

The pairs give red, green and blue in that order, so #00FF00 has red 00, green FF and blue 00. Each becomes FF minus itself: FF, 00, FF, which is full red with full blue, magenta. Yellow is what a pure blue #0000FF would become.

Q9. Sneha's school app must store messages that mix Devanagari, Tamil and English letters. Why does it store text in Unicode rather than in 7-bit ASCII?

  1. 7-bit ASCII has codes for Devanagari and Tamil too, but Unicode stores them in less space
  2. Devanagari and Tamil letters use the same ASCII codes, so the app could not tell them apart
  3. Unicode stores each letter as a small picture, so any script at all can be shown clearly on screen
  4. Unicode gives every letter of these scripts its own code, but 7-bit ASCII has only 128 codes
Show answer

Answer: (d) Unicode gives every letter of these scripts its own code, but 7-bit ASCII has only 128 codes

7-bit ASCII has room for just 128 codes, enough for English letters, digits and symbols but not for Indian scripts. Unicode gives every character of every major script its own number, and the letters are stored as codes, not as pictures.

Q10. In ASCII, the capital letters A to Z have the codes 65 to 90 and the small letters a to z have the codes 97 to 122, in alphabetical order. A computer sorts words by comparing these codes, first letter against first letter, then the next letter only if those are equal. In what order does it sort these words, from smallest to largest? mouse, Keyboard, app, Bluetooth, keypad

  1. Bluetooth, Keyboard, app, keypad, mouse
  2. mouse, keypad, app, Keyboard, Bluetooth
  3. app, keypad, mouse, Bluetooth, Keyboard
  4. app, Bluetooth, Keyboard, keypad, mouse
Show answer

Answer: (a) Bluetooth, Keyboard, app, keypad, mouse

Every capital letter (65 to 90) has a smaller code than every small letter (97 to 122), so the words starting with capitals come first: Bluetooth (B = 66), then Keyboard (K = 75). The small-letter words follow: app (a = 97), keypad (k = 107), mouse (m = 109). So Keyboard and keypad end up apart. Dictionary order ignores capitals, putting small letters first gets the codes the wrong way round, and the last order is largest to smallest.

NoTuition.in is an independent app and is not linked to any olympiad organiser or exam body. Our olympiad-style practice sets and guides are written by our own team; they are not past or sample papers of any exam. IMO, ISO, IEO and ICSO are exams of the Science Olympiad Foundation, and other exam names belong to their organisers; we use them only to describe those exams.

Try Class 10 Computer olympiad practice free

The guided lab and Worksheet 1 are free, with an explanation for every answer. No card needed.