국제바칼로레이트 · IB Diploma
Computer Science · HL
이 과정의 문제지, 표본 및 커리큘럼 문서입니다.
핸드아웃, 연습지 및 슬라이드
공유된 주제 문서는 출처 과정 및 주제 제목을 유지합니다. 선택한 보드의 규정을 사용하여 커버리지, tiers 및 고사 요건을 적용하십시오.
교재 자료 · 국제바칼로레이트 · IB Diploma · Computer Science · HL (10)
연습지 · 국제바칼로레이트 · IB Diploma · Computer Science · HL (26)
- 1.1 Computer hardware: the CPU, memory, storage and the cloud
- 1.2 Data representation: binary, hexadecimal and how data is stored
- 1.3 Logic gates and truth tables
- 1.4 Operating systems, control systems and translation
- 2.1 Networks: types, devices, topologies and models
- 2.2 Protocols, IP addressing and data transmission
- 2.3 Network security: firewalls, encryption and certificates
- 3.1 Database design: ERDs, keys and normalization to 3NF
- 3.2 SQL: queries, updates, aggregates and transactions
- 4.1 Machine learning: types, hardware and ethics
- 4.2 Machine learning: data preprocessing and approaches
- 5.1 Computational thinking and problem specification
- 5.2 Flowcharts and trace tables
- 6.1 Programming fundamentals: variables, strings, exceptions and debugging
- 6.2 Data structures: lists, 2D lists, stacks and queues
- 6.3 Algorithms: searching, sorting and Big O
- 6.4 Programming constructs, functions and file processing
- 6.5 재귀
- 7.1 Classes and objects
- 7.2 Encapsulation and UML class diagrams
- 7.3 Inheritance and polymorphism
- 8.1 Abstract data types and linked lists
- 8.2 이진 탐색 트리
- 8.3 Sets and hash tables
- 9.1 Case study skills
- 10.1 Computational solution skills
프레젠테이션 슬라이드 · 국제바칼로레이트 · IB Diploma · Computer Science · HL (10)
연습 walkthrough 슬라이드 · 국제바칼로레이트 · IB Diploma · Computer Science · HL (26)
- 1.1 Computer hardware: the CPU, memory, storage and the cloud · Walk-through
- 1.2 Data representation: binary, hexadecimal and how data is stored · Walk-through
- 1.3 Logic gates and truth tables · Walk-through
- 1.4 Operating systems, control systems and translation · Walk-through
- 2.1 Networks: types, devices, topologies and models · Walk-through
- 2.2 Protocols, IP addressing and data transmission · Walk-through
- 2.3 Network security: firewalls, encryption and certificates · Walk-through
- 3.1 Database design: ERDs, keys and normalization to 3NF · Walk-through
- 3.2 SQL: queries, updates, aggregates and transactions · Walk-through
- 4.1 Machine learning: types, hardware and ethics · Walk-through
- 4.2 Machine learning: data preprocessing and approaches · Walk-through
- 5.1 Computational thinking and problem specification · Walk-through
- 5.2 Flowcharts and trace tables · Walk-through
- 6.1 Programming fundamentals: variables, strings, exceptions and debugging · Walk-through
- 6.2 Data structures: lists, 2D lists, stacks and queues · Walk-through
- 6.3 Algorithms: searching, sorting and Big O · Walk-through
- 6.4 Programming constructs, functions and file processing · Walk-through
- 6.5 재귀 · Walk-through
- 7.1 Classes and objects · Walk-through
- 7.2 Encapsulation and UML class diagrams · Walk-through
- 7.3 Inheritance and polymorphism · Walk-through
- 8.1 Abstract data types and linked lists · Walk-through
- 8.2 이진 탐색 트리 · Walk-through
- 8.3 Sets and hash tables · Walk-through
- 9.1 Case study skills · Walk-through
- 10.1 Computational solution skills · Walk-through
교재 자료 · A-Level 컴퓨터 과학 (20)
연습지 · A-Level 컴퓨터 과학 (88)
- 1.1 데이터 표현
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used
- 1.2 멀티미디어
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling
- 1.3 압축
- 2.1 인터넷 포함 네트워크
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies
- 2.1.2 Cloud computing, transmission media, Ethernet and CSMA/CD, and internet hardware
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing
- 3.1 컴퓨터와 그 구성 요소
- 3.1.1 Primary memory: RAM, ROM and their types
- 3.1.2 Secondary storage: magnetic, solid state and optical
- 3.1.3 Input and output devices, and buffers
- 3.1.4 Embedded systems, monitoring and control
- 3.2 논리 게이트와 논리 회로
- 3.2.1 Truth tables and expressions from a logic circuit
- 3.2.2 Building logic circuits from expressions, problems and truth tables
- 4.1 중앙 처리 장치(CPU) 아키텍처
- 4.1.1 Registers, interrupts, ports and performance
- 4.2 어셈블리 언어
- 4.3 비트 조작
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide
- 5.1 운영 체제
- 5.1.1 Utility software
- 5.1.2 Program libraries and DLL files
- 5.2 언어 번역기
- 5.2.1 Partial compilation (Java) and the IDE
- 6.1 데이터 보안
- 6.2 데이터 무결성
- 7.1 윤리와 소유권
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI
- 8.1 데이터베이스 개념
- 8.1.1 Relationships and E-R diagrams
- 8.1.2 Normalisation from UNF to 3NF
- 8.2 데이터베이스 관리 시스템(DBMS)
- 8.3 데이터 정의 언어(DDL) 및 데이터 조작 언어(DML)
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types
- 9.1 계산적 사고 능력
- 9.1.1 Abstraction and decomposition in practice
- 9.2 알고리즘
- 9.2.1 Logic statements and decisions in an algorithm
- 9.2.2 Flowcharts: reading, drawing and converting
- 9.2.3 Structured English, stepwise refinement and describing an algorithm
- 10.1 데이터 유형과 레코드
- 10.2 배열(Data arrays)
- 10.2.1 Bubble sort, array bounds and the standard array routines
- 10.2.2 Arrays - combined exam practice
- 10.3 파일(File)
- 10.4 추상 데이터 타입(ADT) introduction
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT
- 11.1 프로그래밍 기초
- 11.1.1 Operators and expressions
- 11.1.2 Built-in functions and library routines
- 11.2 구문 구조
- 11.2.1 CASE structures, and choosing between IF and CASE
- 11.2.2 Count-controlled loops: FOR ... NEXT, totals and counts
- 11.2.3 WHILE and REPEAT loops, and choosing the right loop
- 11.2.4 Trace tables: dry-running an algorithm and finding logic errors
- 11.3 구조적 프로그래밍
- 11.3.1 Functions, and choosing between a procedure and a function
- 11.3.2 Parameters by value and by reference, and variable scope
- 11.3.3 Efficient pseudocode and breaking a task into modules
- 12.1 프로그램 개발 수명 주기
- 12.2 Structure Charts
- 12.2.1 State-transition Diagrams
- 12.3 프로그램 테스트 및 유지보수
- 12.3.1 Test strategy, test plans and choosing a testing method
- 13.1 사용자 정의 데이터 타입
- 13.1.1 Designing a user-defined type for a problem, and the linked list
- 13.2 파일 조직화 및 접근(File organisation and access)
- 13.3 부동 소수점 수, 표현 및 조작
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow
- 14.1 프로토콜
- 14.2 회선 전환, 패킷 전환
- 15.1 프로세서, 병렬 처리 및 가상 머신
- 15.2 부울 대수와 논리 회로
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps
- 16.1 운영 체제(OS)의 목적
- 16.2 번역 소프트웨어
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions
- 17.1 암호화, 암호화 프로토콜 및 디지털 인증서
- 18.1 인공지능(AI)
- 19.1 알고리즘
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O
- 19.2 재귀
- 20.1 프로그래밍 패러다임
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals
- 20.2 파일 처리 및 예외 처리
프레젠테이션 슬라이드 · A-Level 컴퓨터 과학 (20)
연습 walkthrough 슬라이드 · A-Level 컴퓨터 과학 (167)
- 1.1 데이터 표현 · Walk-through
- 1.1 데이터 표현 · Past-paper walk-through
- 1.1.1 데이터 표현 · Past-paper walk-through
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used · Walk-through
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used · Past-paper walk-through
- 1.2 멀티미디어 · Walk-through
- 1.2 멀티미디어 · Past-paper walk-through
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling · Walk-through
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling · Past-paper walk-through
- 1.3 압축 · Walk-through
- 1.3 압축 · Past-paper walk-through
- 1.3.1 압축 · Past-paper walk-through
- 2.1 인터넷 포함 네트워크 · Walk-through
- 2.1 인터넷 포함 네트워크 · Past-paper walk-through
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies · Walk-through
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies · Past-paper walk-through
- 2.1.2 Cloud computing, transmission media, Ethernet and CSMA/CD, and internet hardware · Walk-through
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing · Walk-through
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing · Past-paper walk-through
- 3.1 컴퓨터와 그 구성 요소 · Walk-through
- 3.1 컴퓨터와 그 구성 요소 · Past-paper walk-through
- 3.1.1 Primary memory: RAM, ROM and their types · Walk-through
- 3.1.1 Primary memory: RAM, ROM and their types · Past-paper walk-through
- 3.1.2 Secondary storage: magnetic, solid state and optical · Walk-through
- 3.1.2 Secondary storage: magnetic, solid state and optical · Past-paper walk-through
- 3.1.3 Input and output devices, and buffers · Walk-through
- 3.1.3 Input and output devices, and buffers · Past-paper walk-through
- 3.1.4 Embedded systems, monitoring and control · Walk-through
- 3.1.4 Embedded systems, monitoring and control · Past-paper walk-through
- 3.2 논리 게이트와 논리 회로 · Walk-through
- 3.2 논리 게이트와 논리 회로 · Past-paper walk-through
- 3.2.1 Truth tables and expressions from a logic circuit · Walk-through
- 3.2.1 Truth tables and expressions from a logic circuit · Past-paper walk-through
- 3.2.2 Building logic circuits from expressions, problems and truth tables · Walk-through
- 3.2.2 Building logic circuits from expressions, problems and truth tables · Past-paper walk-through
- 4.1 중앙 처리 장치(CPU) 아키텍처 · Walk-through
- 4.1 중앙 처리 장치(CPU) 아키텍처 · Past-paper walk-through
- 4.1.1 Registers, interrupts, ports and performance · Walk-through
- 4.1.1 Registers, interrupts, ports and performance · Past-paper walk-through
- 4.2 어셈블리 언어 · Walk-through
- 4.2 어셈블리 언어 · Past-paper walk-through
- 4.3 비트 조작 · Walk-through
- 4.3 비트 조작 · Past-paper walk-through
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide · Walk-through
- 5.1 운영 체제 · Walk-through
- 5.1 운영 체제 · Past-paper walk-through
- 5.1.1 Utility software · Walk-through
- 5.1.1 Utility software · Past-paper walk-through
- 5.1.2 Program libraries and DLL files · Walk-through
- 5.1.2 Program libraries and DLL files · Past-paper walk-through
- 5.2 언어 번역기 · Walk-through
- 5.2 언어 번역기 · Past-paper walk-through
- 5.2.1 Partial compilation (Java) and the IDE · Walk-through
- 5.2.1 Partial compilation (Java) and the IDE · Past-paper walk-through
- 6.1 데이터 보안 · Walk-through
- 6.1 데이터 보안 · Past-paper walk-through
- 6.2 데이터 무결성 · Walk-through
- 6.2 데이터 무결성 · Past-paper walk-through
- 7.1 윤리와 소유권 · Walk-through
- 7.1 윤리와 소유권 · Past-paper walk-through
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI · Walk-through
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI · Past-paper walk-through
- 8.1 데이터베이스 개념 · Walk-through
- 8.1 데이터베이스 개념 · Past-paper walk-through
- 8.1.1 Relationships and E-R diagrams · Walk-through
- 8.1.1 Relationships and E-R diagrams · Past-paper walk-through
- 8.1.2 Normalisation from UNF to 3NF · Walk-through
- 8.1.2 Normalisation from UNF to 3NF · Past-paper walk-through
- 8.2 데이터베이스 관리 시스템(DBMS) · Walk-through
- 8.2 데이터베이스 관리 시스템(DBMS) · Past-paper walk-through
- 8.3 데이터 정의 언어(DDL) 및 데이터 조작 언어(DML) · Walk-through
- 8.3 데이터 정의 언어(DDL) 및 데이터 조작 언어(DML) · Past-paper walk-through
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types · Walk-through
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types · Past-paper walk-through
- 9.1 계산적 사고 능력 · Walk-through
- 9.1 계산적 사고 능력 · Past-paper walk-through
- 9.1.1 Abstraction and decomposition in practice · Walk-through
- 9.1.1 Abstraction and decomposition in practice · Past-paper walk-through
- 9.2 알고리즘 · Walk-through
- 9.2 알고리즘 · Past-paper walk-through
- 9.2.1 Logic statements and decisions in an algorithm · Walk-through
- 9.2.1 Logic statements and decisions in an algorithm · Past-paper walk-through
- 9.2.2 Flowcharts: reading, drawing and converting · Walk-through
- 9.2.2 Flowcharts: reading, drawing and converting · Past-paper walk-through
- 9.2.3 Structured English, stepwise refinement and describing an algorithm · Walk-through
- 9.2.3 Structured English, stepwise refinement and describing an algorithm · Past-paper walk-through
- 10.1 데이터 유형과 레코드 · Walk-through
- 10.1 데이터 유형과 레코드 · Past-paper walk-through
- 10.2 배열(Data arrays) · Walk-through
- 10.2 배열(Data arrays) · Past-paper walk-through
- 10.2.1 Bubble sort, array bounds and the standard array routines · Walk-through
- 10.2.1 Bubble sort, array bounds and the standard array routines · Past-paper walk-through
- 10.2.2 Arrays - combined exam practice · Walk-through
- 10.3 파일(File) · Walk-through
- 10.3 파일(File) · Past-paper walk-through
- 10.4 추상 데이터 타입(ADT) introduction · Walk-through
- 10.4 추상 데이터 타입(ADT) introduction · Past-paper walk-through
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT · Walk-through
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT · Past-paper walk-through
- 11.1 프로그래밍 기초 · Walk-through
- 11.1 프로그래밍 기초 · Past-paper walk-through
- 11.1.1 Operators and expressions · Walk-through
- 11.1.2 Built-in functions and library routines · Walk-through
- 11.1.2 Built-in functions and library routines · Past-paper walk-through
- 11.2 구문 구조 · Walk-through
- 11.2 구문 구조 · Past-paper walk-through
- 11.2.1 CASE structures, and choosing between IF and CASE · Walk-through
- 11.2.1 CASE structures, and choosing between IF and CASE · Past-paper walk-through
- 11.2.2 Count-controlled loops: FOR ... NEXT, totals and counts · Walk-through
- 11.2.3 WHILE and REPEAT loops, and choosing the right loop · Walk-through
- 11.2.3 WHILE and REPEAT loops, and choosing the right loop · Past-paper walk-through
- 11.2.4 Trace tables: dry-running an algorithm and finding logic errors · Walk-through
- 11.2.4 Trace tables: dry-running an algorithm and finding logic errors · Past-paper walk-through
- 11.3 구조적 프로그래밍 · Walk-through
- 11.3 구조적 프로그래밍 · Past-paper walk-through
- 11.3.1 Functions, and choosing between a procedure and a function · Walk-through
- 11.3.1 Functions, and choosing between a procedure and a function · Past-paper walk-through
- 11.3.2 Parameters by value and by reference, and variable scope · Walk-through
- 11.3.2 Parameters by value and by reference, and variable scope · Past-paper walk-through
- 11.3.3 Efficient pseudocode and breaking a task into modules · Walk-through
- 11.3.3 Efficient pseudocode and breaking a task into modules · Past-paper walk-through
- 12.1 프로그램 개발 수명 주기 · Walk-through
- 12.1 프로그램 개발 수명 주기 · Past-paper walk-through
- 12.2 프로그램 설계 · Walk-through
- 12.2 프로그램 설계 · Past-paper walk-through
- 12.2.1 State-transition Diagrams · Walk-through
- 12.2.1 State-transition Diagrams · Past-paper walk-through
- 12.3 프로그램 테스트 및 유지보수 · Walk-through
- 12.3 프로그램 테스트 및 유지보수 · Past-paper walk-through
- 12.3.1 Test strategy, test plans and choosing a testing method · Walk-through
- 12.3.1 Test strategy, test plans and choosing a testing method · Past-paper walk-through
- 13.1 사용자 정의 데이터 타입 · Walk-through
- 13.1 사용자 정의 데이터 타입 · Past-paper walk-through
- 13.1.1 Designing a user-defined type for a problem, and the linked list · Walk-through
- 13.2 파일 조직화 및 접근(File organisation and access) · Walk-through
- 13.2 파일 조직화 및 접근(File organisation and access) · Past-paper walk-through
- 13.3 부동 소수점 수, 표현 및 조작 · Walk-through
- 13.3 부동 소수점 수, 표현 및 조작 · Past-paper walk-through
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow · Walk-through
- 14.1 프로토콜 · Walk-through
- 14.1 프로토콜 · Past-paper walk-through
- 14.2 회선 전환, 패킷 전환 · Walk-through
- 14.2 회선 전환, 패킷 전환 · Past-paper walk-through
- 15.1 프로세서, 병렬 처리 및 가상 머신 · Walk-through
- 15.1 프로세서, 병렬 처리 및 가상 머신 · Past-paper walk-through
- 15.2 부울 대수와 논리 회로 · Walk-through
- 15.2 부울 대수와 논리 회로 · Past-paper walk-through
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps · Walk-through
- 16.1 운영 체제(OS)의 목적 · Walk-through
- 16.1 운영 체제(OS)의 목적 · Past-paper walk-through
- 16.2 번역 소프트웨어 · Walk-through
- 16.2 번역 소프트웨어 · Past-paper walk-through
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions · Walk-through
- 17.1 암호화, 암호화 프로토콜 및 디지털 인증서 · Walk-through
- 17.1 암호화, 암호화 프로토콜 및 디지털 인증서 · Past-paper walk-through
- 18.1 인공지능(AI) · Walk-through
- 18.1 인공지능(AI) · Past-paper walk-through
- 19.1 알고리즘 · Walk-through
- 19.1 알고리즘 · Past-paper walk-through
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O · Walk-through
- 19.2 재귀 · Walk-through
- 19.2 재귀 · Past-paper walk-through
- 20.1 프로그래밍 패러다임 · Walk-through
- 20.1 프로그래밍 패러다임 · Past-paper walk-through
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals · Walk-through
- 20.2 파일 처리 및 예외 처리 · Walk-through
- 20.2 파일 처리 및 예외 처리 · Past-paper walk-through
과정 단위 및 학습 목표
이 수업은 선택된 과정 목표를 다룹니다. 나머지 미달성 항목을 확인하십시오. 이 자료는 완전한 준비 프로그램이 아닙니다.
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.
- 캡슐화
- 인터페이스를 통해 상태에 대한 접근 제어
- 인스턴스
- 클래스의 개별 객체
B.4 · 추상 데이터 타입 (HL 전용)
- A last-in-first-out abstract data type.
- Choose the structure for the required access pattern. Complexity depends on implementation and assumptions: removing the first item from a shifting array differs from advancing a head pointer in a queue.
- Trace operation sequences by hand, then compare a program with the expected states. Test empty, singleton and repeated operations. State overflow behaviour if capacity is fixed.
- 스택
- 마지막으로 들어온 원소가 먼저 나오는 추상 데이터 구조
- 대기열
- 처음 들어온 원소가 먼저 나오는 추상 데이터 구조
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.
규격 서식 및 표본 문서
과정 자료
수업 준비
문서가 이용 가능합니다. 모든 과정에 대해 보드별 노트, 평가 및 상호작용형 과거 문제집 연습이 제공되지는 않습니다.
수업 →