본문 바로가기

국제바칼로레이트 · IB Diploma

Computer Science · SL

이 과정의 문제지, 표본 및 커리큘럼 문서입니다.

← 시험

핸드아웃, 연습지 및 슬라이드

공유된 주제 문서는 출처 과정 및 주제 제목을 유지합니다. 선택한 보드의 규정을 사용하여 커버리지, tiers 및 고사 요건을 적용하십시오.

교재 자료 · 국제바칼로레이트 · IB Diploma · Computer Science · SL (9)
연습지 · 국제바칼로레이트 · IB Diploma · Computer Science · SL (20)
프레젠테이션 슬라이드 · 국제바칼로레이트 · IB Diploma · Computer Science · SL (9)
연습 walkthrough 슬라이드 · 국제바칼로레이트 · IB Diploma · Computer Science · SL (20)
교재 자료 · A-Level 컴퓨터 과학 (20)
연습지 · A-Level 컴퓨터 과학 (88)
프레젠테이션 슬라이드 · A-Level 컴퓨터 과학 (20)
연습 walkthrough 슬라이드 · A-Level 컴퓨터 과학 (167)

과정 단위 및 학습 목표

이 수업은 선택된 과정 목표를 다룹니다. 나머지 미달성 항목을 확인하십시오. 이 자료는 완전한 준비 프로그램이 아닙니다.

A.1 · 컴퓨터 기초
  • Checking an asserted identity.
  • Separate authentication from authorization. Authentication checks identity; authorization determines permitted actions. A threat model connects a valuable asset, a possible attack and an appropriate control.
  • Use a fictitious school dataset to define users and permissions. Draw data flows, compare validation and verification, and specify tests for normal, boundary and invalid input. Do not use real credentials or student records in exercises.
인증
주장된 신원 확인 검증
승인
허용된 작동 사항 결정
A.2 · 네트워크
  • Achieved rate of useful data transfer.
  • Transmission time depends on data size and rate. Total delay may also include propagation, processing and queueing. Encryption protects content under its assumptions but does not remove congestion or every metadata exposure.
  • Trace a message route using a documented local model. Record payload size, units and measured time. Use school-approved networks and synthetic messages; do not scan or intercept another user traffic.
처리량(스루풋)
유용한 데이터 전송의 달성된 속도
지연 시간
통신 중 발생하는 지연
A.3 · 데이터베이스
  • Attribute set uniquely identifying a table row.
  • A join combines rows according to a specified condition. The result count depends on relationship cardinality and filters. A foreign key constraint enforces a relationship rule; it does not automatically encrypt personal data.
  • Design a small synthetic user-order dataset with no real personal information. Declare keys, test duplicate and missing-reference inserts, then check a query result against a hand-worked expected table.
주키
테이블 행을 고유하게 식별하는 속성 집합
외부 키
다른 테이블의 키를 참조하는 속성 집합
A.4 · 머신러닝
  • An attribute set uniquely identifying a record.
  • A primary key uniquely identifies a record; a foreign key relates records. In prediction, leakage can expose information unavailable at the real decision time. Accuracy alone may hide an unbalanced target distribution.
  • Use fictional booking records to identify entities, attributes and relationships. For a learning exercise, use a public non-sensitive dataset, separate training and test data, and describe who may be affected by errors. The current 2027 CS objective scope awaits the acquired guide.
주키
레코드를 고유하게 식별하는 속성 집합
데이터 유출
목표 예측 시점에 사용 불가능한 정보의 활용
B.1 · 컴퓨팅 사고
  • A finite procedure solving a stated task.
  • State input conditions and expected outputs. Use boundary cases, empty collections where allowed, duplicates and invalid values. Distinguish a wrong algorithm from a wrong implementation or an incomplete requirement.
  • Trace a search over a small fictional sorted list. State the indexing convention. For binary search, update bounds so the remaining interval shrinks and reject unsorted input unless sorting is part of the task.
알고리즘
제시된 과제를 해결하는 유한한 절차
경계 테스트
허용된 입력 범위의 한계에서 수행되는 테스트
B.2 · 프로그래밍
  • A finite procedure solving a stated task.
  • State input conditions and expected outputs. Use boundary cases, empty collections where allowed, duplicates and invalid values. Distinguish a wrong algorithm from a wrong implementation or an incomplete requirement.
  • Trace a search over a small fictional sorted list. State the indexing convention. For binary search, update bounds so the remaining interval shrinks and reject unsorted input unless sorting is part of the task.
알고리즘
제시된 과제를 해결하는 유한한 절차
경계 테스트
허용된 입력 범위의 한계에서 수행되는 테스트
B.3 · 객체 지향 프로그래밍
  • Controlling access to state through an interface.
  • A method call acts on a particular instance. State changes should satisfy preconditions and postconditions. Polymorphism lets code use a common interface with different implementations when the contract is respected.
  • Implement a small synthetic account or inventory model. Test two independent instances, rejected invalid operations and boundary values. Keep the model away from real financial accounts and credentials.
캡슐화
인터페이스를 통해 상태에 대한 접근 제어
인스턴스
클래스의 개별 객체
Case study · 사례 연구(case study)
  • Completed work per unit time under a stated workload.
  • A recommendation should connect a requirement to a mechanism and an observable test. For example, a concurrency problem requires a strategy that prevents conflicting updates, plus tests demonstrating the invariant. A claim about faster response requires comparable workload measurements rather than only a complexity label. Evaluate alternatives under the same stated conditions.
  • Use an original school-approved scenario and synthetic data. Build a matrix of claim, supporting scenario evidence, technical explanation, limitation and acceptance test. Mark missing facts explicitly and show how the recommendation would change if an assumption failed. This prepares case-based reasoning without reproducing an unavailable IB assessment case study or inventing its examination rubric.
처리량(스루풋)
명시된 작업 부하 하에서 단위 시간당 완료된 일의 양
수용 테스트
특정 사용자 요구사항이 충족되었는지 검증하는 테스트
IA · 계산적 해결책
  • A finite procedure solving a stated task.
  • State input conditions and expected outputs. Use boundary cases, empty collections where allowed, duplicates and invalid values. Distinguish a wrong algorithm from a wrong implementation or an incomplete requirement.
  • Trace a search over a small fictional sorted list. State the indexing convention. For binary search, update bounds so the remaining interval shrinks and reject unsorted input unless sorting is part of the task.
알고리즘
제시된 과제를 해결하는 유한한 절차
경계 테스트
허용된 입력 범위의 한계에서 수행되는 테스트

해당 자격증 대비

  • This ordering records the 2027 A/B structure separately from the 2014 course final assessment in 2026.
  • Do not carry forward old Options A–D or the old assessment weights. A.4 machine learning and B.3 OOP are in the new public structure; B.4 is HL-only.
  • Current paper marks, case-study assessment differences, approved language conventions and IA rubric remain blocked pending the current guide.
  • The project is a school-supervised working computational solution with requirements, tests and user evaluation, never an invented written replacement.

여전히 필요한 교육 범위

  • 2027 exact objectives/rubrics not verified from an acquired guide. These original foundation cases do not establish full current-course parity.

규격 서식 및 표본 문서

과정 자료

수업 준비

문서가 이용 가능합니다. 모든 과정에 대해 보드별 노트, 평가 및 상호작용형 과거 문제집 연습이 제공되지는 않습니다.

수업 →

로그인 또는 계정 만들기

IGCSE, A-Level & AP