Scribd
Upload
24 views3 pages

Python Checklist 9618 CS Paper4

This document is a comprehensive Python learning checklist for the Cambridge 9618 Computer Science Paper 4, covering essential topics such as Python fundamentals, control structures, functions, data structures, algorithms, programming paradigms, file handling, and exception handling. It includes specific skills and concepts to master, such as recursion, Big-O notation, and various data structures like stacks, queues, and binary trees. Additionally, it emphasizes practice and tracing techniques to enhance understanding and problem-solving abilities.

Uploaded by

Muhammad Arham Khaliq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views3 pages

Python Checklist 9618 CS Paper4

This document is a comprehensive Python learning checklist for the Cambridge 9618 Computer Science Paper 4, covering essential topics such as Python fundamentals, control structures, functions, data structures, algorithms, programming paradigms, file handling, and exception handling. It includes specific skills and concepts to master, such as recursion, Big-O notation, and various data structures like stacks, queues, and binary trees. Additionally, it emphasizes practice and tracing techniques to enhance understanding and problem-solving abilities.

Uploaded by

Muhammad Arham Khaliq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Python Learning Checklist for Cambridge 9618 Computer Science Paper 4

Python Fundamentals

- [ ] Syntax, indentation, comments

- [ ] Variables and data types (int, float, str, bool)

- [ ] Operators: arithmetic, comparison, logical

- [ ] Input and output (input(), print())

- [ ] Type casting (int(), str(), etc.)

- [ ] String manipulation (split(), join(), slicing, etc.)

- [ ] Basic math functions (abs(), pow(), round())

Control Structures

- [ ] if, elif, else

- [ ] for loops and while loops

- [ ] break, continue, pass

- [ ] Nested loops and conditional statements

Functions

- [ ] Defining functions using def

- [ ] Parameters and return values

- [ ] Scope (local vs global)

- [ ] Recursion (required in syllabus)

- [ ] Trace recursive functions (stack and unwinding)

Data Structures & ADTs

- [ ] Lists: creation, indexing, slicing, append(), insert(), remove(), pop()

- [ ] Stacks using list or deque: push, pop, peek, isEmpty

- [ ] Queues using deque: enqueue, dequeue

- [ ] Linked Lists: Node class, insert/delete at head/tail

- [ ] Binary Trees: Node class, insert, traverse

- [ ] Graphs: understanding nodes, edges, adjacency (theory only)

- [ ] Dictionaries: key-value operations


Python Learning Checklist for Cambridge 9618 Computer Science Paper 4

- [ ] Big-O Notation: time and space complexity

Searching & Sorting Algorithms

- [ ] Linear Search: write and explain

- [ ] Binary Search: preconditions, implementation

- [ ] Insertion Sort

- [ ] Bubble Sort

- [ ] Understand how data order affects performance

Abstract Data Types Implementation

- [ ] Implement Stack, Queue, Linked List, Binary Tree from scratch using classes

Programming Paradigms

- [ ] Low-level: concepts like immediate, direct, indirect addressing

- [ ] Imperative (procedural): use of variables, functions

- [ ] Object-Oriented Programming: class, __init__, inheritance, encapsulation, polymorphism

- [ ] Declarative: understand and simulate rules/facts logic in Python

File Handling

- [ ] Open/read/write/append files using open()

- [ ] read(), readline(), readlines()

- [ ] write() and writelines()

- [ ] File modes: 'r', 'w', 'a', etc.

Exception Handling

- [ ] try, except blocks

- [ ] finally, else with try

- [ ] Catching specific exceptions

- [ ] Knowing when to use exception handling


Python Learning Checklist for Cambridge 9618 Computer Science Paper 4

Practice & Tracing

- [ ] Trace algorithm flow (dry run)

- [ ] Trace recursive functions step-by-step

- [ ] Trace sorting and searching algorithms

- [ ] Practice past paper problems on ADTs, recursion, OOP, file handling

You might also like