INFORMATION-I · Common Test for University Admissions (大学入学共通テスト)
INFORMATION-I/11
Information I
Information I · 2020 · Variant 1
Relative difficulty
Analysis source: National Center for University Entrance Examinations (DNC)
Analysis aligned to the official syllabus and assessment design.
4.0 / 5
100
60 min
Algorithms and data: trace loops and conditionals carefully, calculate summaries or probabilities from data, and judge whether information-system choices are secure and appropriate.
Cohort performance
Session statistics from official examination reports
Total marks
100
Duration
60 min
Session difficulty
4.0 / 5
Calculator policy
Scientific calculators permitted only where specified in the DNC implementation guidelines; programming functions and CAS are prohibited. En
Key examiner messages
Top priorities from the principal examiner before you revise
情報I covers information society, communication, data utilization, programming, networks, information design and problem solving with computers. The R7 Common Test Information I paper has 4 questions and emphasizes computational thinking, data interpretation, algorithms, securit…
Information I is officially 60 minutes, 100 marks and 4 questions, so each question averages about 15 minutes and 25 marks.
Algorithm tracing should be mechanical: initialize variables, process each iteration, update counters and only then test loop conditions as specified.
Binary conversion uses positional weights: 101101₂ = 32 + 8 + 4 + 1 = 45.
The DNC Problem Evaluation Committee publishes per-subject reports after each January session, rating alignment with the Course of Study (学習指導要領), item difficulty balance, and whether items discriminate without exceeding syllabus scope.
Question difficulty map
How candidates performed on each question in this series
No data available in official reports
Assessment objectives
Skill and AO weighting from official examiner commentary
Skill weighting
Cognitive skills emphasised in official test design.
Algorithmic reasoning
Weight: 34100%Data interpretation and calculation
Weight: 2882%Systems/security understanding
Weight: 2265%Information design judgment
Weight: 1647%
Method marks watchlist
Where working, steps, or method marks were commonly lost
No data available in official reports
Recurring mistakes across years
Themes examiners flag in multiple recent sessions for this subject
Programming: Updating variables in the wrong order inside a loop. — Trace line by line in a table and do not combine steps mentally.
Data: Using a graph visually without checking axis scale, units or missing data. — Circle axes, legend and sample size before calculating…
Security: Choosing encryption when the problem is authentication, backup or access control. — Name the threat first: eavesdropping, imper…
Binary: Confusing bits and bytes or powers of 10 and powers of 2. — Write 1 byte = 8 bits and common powers 2^8=256, 2^10=1024.
Algorithms: Assuming a sorted list or valid input when the problem did not state it. — Check preconditions before applying search, sortin…
Question choice intelligence
Mean scores and popularity for optional questions (HKDSE electives)
No data available in official reports
Level exemplars
What candidate scripts at each grade level looked like
No data available in official reports
Grade & admission context
How marks relate to grade thresholds and entry standards
Official body
National Center for University Entrance Examinations (DNC)
Grading system
Per-subject raw scores (素点); universities convert to deviation values (偏差値, mean 50) — no national pass/fail grade
Scale band
0–100 raw
Scale band
Deviation 50 = mean
Scale band
University cut-off
Deep insights
What top candidates did
Techniques and approaches examiners rewarded in this series
Trace programs with a table
For loops and conditionals, make columns for iteration, variable values and output. Update values in order exactly as the pseudocode does.
Know basic data measures
Mean, median, mode, range, variance-like spread, correlation and cross-tabulation appear through practical datasets. Always read units and missing-value rules.
Use binary and representation rules
Review bits, bytes, binary/decimal conversion, character encoding, image/audio representation and compression. Write powers of two quickly.
Separate security concepts
Confidentiality, integrity, availability, authentication, authorization, encryption and backups solve different problems. Match measure to threat.
Understand networks functionally
IP addresses, DNS, routing, protocols, servers and clients are tested as mechanisms. Draw the path information takes through the system.
Read design questions by user goal
Information design asks whether a chart, interface or message communicates accurately to the intended audience. Check visibility, accessibility, misleading scale and cognitive load.
Command word playbook
How to match each command word to the expected response style
No data available in official reports
Time traps
Sections where candidates spent disproportionate time relative to marks
No data available in official reports
Syllabus traceability
Topics linked to questions and mark weighting in this session
Information society, security and communication
Official topic weighting
Information design and data representation
Official topic weighting
Programming, algorithms and problem solving
Official topic weighting
Networks, databases, data analysis and simulation
Official topic weighting
MCQ trap analytics
Commonly chosen wrong options from examiner commentary
No data available in official reports
Topic heatmap across years
Mark concentration by topic and exam year for this subject
Mark intensity
Programming, algorithms and problem solving
Networks, databases, data analysis and simulation
Information society, security and communication
Information design and data representation
Difficulty trend
How session difficulty has shifted across recent years
Paper comparison
Marks and duration breakdown across papers in this session
Information I: Four multi-part questions on information society, data use, programming, networks and problem solving
Marks you can still earn
Where valid approaches outside the mark scheme may still gain credit
No data available in official reports
Practise what examiners flagged
Target weak topics from this report inside the Revui app
Information society, security and communication
Official topic weighting
Practise in RevuiInformation design and data representation
Official topic weighting
Practise in RevuiProgramming, algorithms and problem solving
Official topic weighting
Practise in RevuiNetworks, databases, data analysis and simulation
Official topic weighting
Practise in RevuiSelf-diagnostic checklist
Key actions before you sit this paper — copy and tick off as you revise
- 1Message
情報I covers information society, communication, data utilization, programming, networks, information design and problem solving with computers. The R7 Common Test Information I paper has 4 questions and emphasizes computational thinking, data interpretation, algorithms, securit…
- 2Message
Information I is officially 60 minutes, 100 marks and 4 questions, so each question averages about 15 minutes and 25 marks.
- 3Message
Algorithm tracing should be mechanical: initialize variables, process each iteration, update counters and only then test loop conditions as specified.
- 4Message
Binary conversion uses positional weights: 101101₂ = 32 + 8 + 4 + 1 = 45.
- 5Message
The DNC Problem Evaluation Committee publishes per-subject reports after each January session, rating alignment with the Course of Study (学習指導要領), item difficulty balance, and whether items discriminate without exceeding syllabus scope.
- 6Pitfall
Programming: Updating variables in the wrong order inside a loop. — Trace line by line in a table and do not combine steps mentally.
- 7Pitfall
Data: Using a graph visually without checking axis scale, units or missing data. — Circle axes, legend and sample size before calculating…
- 8Pitfall
Security: Choosing encryption when the problem is authentication, backup or access control. — Name the threat first: eavesdropping, imper…
- 9Pitfall
Binary: Confusing bits and bytes or powers of 10 and powers of 2. — Write 1 byte = 8 bits and common powers 2^8=256, 2^10=1024.
- 10Pitfall
Algorithms: Assuming a sorted list or valid input when the problem did not state it. — Check preconditions before applying search, sortin…
- 11Strength
Trace programs with a table: For loops and conditionals, make columns for iteration, variable values and output. Update values in
- 12Strength
Know basic data measures: Mean, median, mode, range, variance-like spread, correlation and cross-tabulation appear through pra
- 13Strength
Use binary and representation rules: Review bits, bytes, binary/decimal conversion, character encoding, image/audio representation and co
Teacher briefing pack
One-page session summary for tutors and classroom review
2020 2020
Information I
情報I covers information society, communication, data utilization, programming, networks, information design and problem solving with computers. The R7 Common Test Information I paper has 4 questions and emphasizes computational thinking, data interpretation, algorithms, security a
情報I covers information society, communication, data utilization, programming, networks, information design and problem solving with computers. The R7 Common Test Information I paper has 4 questions and emphasizes computational thinking, data interpretation, algorithms, securit…
Information I is officially 60 minutes, 100 marks and 4 questions, so each question averages about 15 minutes and 25 marks.
Algorithm tracing should be mechanical: initialize variables, process each iteration, update counters and only then test loop conditions as specified.
Programming: Updating variables in the wrong order inside a loop. — Trace line by line in a table and do not combine steps mentally.
Data: Using a graph visually without checking axis scale, units or missing data. — Circle axes, legend and sample size before calculating…
- Total marks
- 100
- Duration
- 60 min
- Session difficulty
- 4.0 / 5
- Calculator policy
- Scientific calculators permitted only where specified in the DNC implementation guidelines; programming functions and CAS are prohibited. En
Session analysis
情報I covers information society, communication, data utilization, programming, networks, information design and problem solving with computers. The R7 Common Test Information I paper has 4 questions and emphasizes computational thinking, data interpretation, algorithms, security and responsible use of information. National Center for University Entrance Examinations (DNC) emphasises algorithms and data: trace loops and conditionals carefully, calculate summaries or probabilities from data, and judge whether information-system choices are secure and appropriate.. Priority revision: Information society, security and communication, Information design and data representation, Programming, algorithms and problem solving, Networks, databases, data analysis and simulation. For loops and conditionals, make columns for iteration, variable values and output. Update values in order exactly as the pseudocode does.
Updated 2026-07-03
Paper breakdown
Information I: Four multi-part questions on information society, data use, programming, networks and problem solving
Top chapters
Exam structure insights
Marks by syllabus topic
Revision priority from official test-design weighting.
Mark accessibility
Estimated difficulty spread based on official design.
Algorithms and data: trace loops and conditionals carefully, calculate summaries
Paper structure
Official paper breakdown for this subject.
Information I
100·4·100%
Official syllabus scope
情報I covers information society, communication, data utilization, programming, networks, information design and problem solving with computers. The R7 Common Test Information I paper has 4 questions and emphasizes computational thinking, data interpretation, algorithms, security and responsible use of information.
Difficulty verdict
Rated 4/5 for January sessions. Algorithms and data: trace loops and conditionals carefully, calculate summaries or probabilities from data, and judge whether information-system choices are secure and appropriate.
What examiners measure
1. Understand information society, rights, security, privacy and responsible communication. 2. Analyze data using tables, graphs, statistics and simple modeling. 3. Read and reason about algorithms, programs, variables, conditionals, loops and procedures. 4. Understand networks, digital representation and information-system mechanisms. 5. Solve problems by decomposing tasks and evaluating computational results.
Where the marks are
Highest-weight syllabus areas: Information society, security and communication; Information design and data representation; Programming, algorithms and problem solving; Networks, databases, data analysis and simulation.
Examiner notes & key calculations
- Information I is officially 60 minutes, 100 marks and 4 questions, so each question averages about 15 minutes and 25 marks.
- Algorithm tracing should be mechanical: initialize variables, process each iteration, update counters and only then test loop conditions as specified.
- Binary conversion uses positional weights: 101101₂ = 32 + 8 + 4 + 1 = 45.
- Data questions may require percent change = (new - old) / old x 100, conditional proportions or interpreting correlation without asserting causation.
- Security controls map to goals: encryption protects confidentiality, hashes/checksums support integrity, backups support availability, authentication verifies identity.
- Network questions often distinguish address resolution, routing and application protocols; DNS does not carry the webpage itself, it resolves names to addresses.
- Information design items reward audience-aware judgment: a technically correct graph can still be misleading if scale, color or labeling obscures comparison.
- Paper 1: Information I · 100 marks · 60 min · Four multi-part questions on information society, data use, programming, networks and problem solving.
Exam tips
Paper format
- Duration
- 60 min
- Total marks
- 100
- Weighting
- 100%
- Question types
- Four multi-part questions on information society, data use, programming, networks and problem solving
- For loops and conditionals, make columns for iteration, variable values and output. Update values in order exactly as the pseudocode does.
- Mean, median, mode, range, variance-like spread, correlation and cross-tabulation appear through practical datasets. Always read units and missing-value rules.
- Review bits, bytes, binary/decimal conversion, character encoding, image/audio representation and compression. Write powers of two quickly.
Common mistakes
Programming
Updating variables in the wrong order inside a loop.
How to avoid: Trace line by line in a table and do not combine steps mentally.
Data
Using a graph visually without checking axis scale, units or missing data.
How to avoid: Circle axes, legend and sample size before calculating or comparing.
Security
Choosing encryption when the problem is authentication, backup or access control.
How to avoid: Name the threat first: eavesdropping, impersonation, tampering, loss or unavailability.
Analysis is paraphrased for study purposes. Always verify against the official examiner report and mark scheme.