An applied Swiss-inspired curriculum combining algorithmic rigour, systems architecture, digital trust and practical engineering capability for modern technology leaders.
The BSc in Creative Computing at Brookfield School of Computing is engineered to provide deep competency across core computer science, systems design, and targeted domain applications. Students develop fluency in software craftsmanship, distributed architectures, algorithm optimization, and data governance.
Instruction balances rigorous theoretical foundations with practical code repositories, laboratory simulations, and ethical technology review aligned with modern international computing standards.
| Code | Module Title | Type | Discipline & Learning Outcome |
|---|---|---|---|
| CS101 | Algorithmic Thinking & Computational Problem Solving | Theory | Formulate problem decomposition, pseudocode, asymptotic growth invariants and algorithmic thinking in Creative Computing. |
| CS102 | Structured Programming Laboratory in Python | Practical | Implement recursive routines, file I/O operations, modular functions and structured algorithms in Python. |
| CS103 | Discrete Mathematics, Combinatorics & Graph Structures | Theory | Prove theorems using induction, set theory, graph connectivity, Euler circuits and formal predicate logic. |
| CS104 | Computer Organization & Digital Logic Design Lab | Practical | Design combinational logic circuits, multiplexers, ALUs and flip-flops using digital logic simulators. |
| CS105 | Information Representation & Computer Data Structures | Theory | Analyze binary representation of integers, IEEE 754 floating-point precision, UTF-8 strings and bitwise masks. |
| CS106 | Relational Database Engineering & Declarative SQL Lab | Practical | Design normalized entity-relationship schemas and write optimized multi-table declarative SQL queries. |
| CS107 | Computing History, Philosophy & Ethical Responsibilities | Theory | Analyze the Turing machine thesis, history of computation, ethical responsibilities of scientists and privacy. |
| CS108 | UNIX Environment, Shell Scripting & Git Toolchains Lab | Practical | Master Unix shell piping, process management, regex filters, text processing and Git version control. |
| CS109 | Technical Communication & Scientific Problem Solving in Creative Computing | Theory | Author technical mathematical proofs, algorithm complexity reports and computational case studies. |
| Code | Module Title | Type | Discipline & Learning Outcome |
|---|---|---|---|
| CS201 | Abstract Data Types & Algorithm Design Foundations | Theory | Analyze linked lists, stacks, queues, binary search trees, hash tables and Big-O, Big-Omega, Big-Theta bounds. |
| CS202 | Object-Oriented Programming & Systems Design in Java Lab | Practical | Implement polymorphic class hierarchies, interfaces, abstract data types and generic collections in Java. |
| CS203 | Linear Algebra, Vector Spaces & Matrix Transformations | Theory | Compute matrix determinants, rank, vector null spaces, eigenvalues and orthogonal basis sets. |
| CS204 | Systems Programming & C Language Memory Management Lab | Practical | Write low-level C programs manipulating raw pointers, dynamic heap allocations and POSIX system calls. |
| CS205 | Computer Architecture, Instruction Sets & CPU Pipelining | Theory | Deconstruct RISC vs CISC instruction sets, hazard detection, branch prediction and superscalar CPU pipelines. |
| CS206 | Assembly Language Programming Lab (x86 / ARM) | Practical | Write assembly routines, manage stack call frames, pass register arguments and inspect machine code disassembly. |
| CS207 | Operating Systems Architecture: Processes, Scheduling & Memory | Theory | Analyze process control blocks (PCB), CPU scheduling algorithms (CFS), virtual memory paging and page faults. |
| CS208 | Concurrent Programming, POSIX Threads & Synchronization Lab | Practical | Solve the dining philosophers, producer-consumer and reader-writer problems using POSIX mutexes and semaphores. |
| CS209 | Applied Creative Computing First-Year Practicum: Systems Tool Build | Practical | Deliver a functional Unix utility or custom memory allocator implemented in C with unit tests and benchmarking. |
| Code | Module Title | Type | Discipline & Learning Outcome |
|---|---|---|---|
| CS301 | Advanced Algorithms: Greedy Methods, Dynamic Programming & Graphs | Theory | Analyze Bellman-Ford, Dijkstra, Floyd-Warshall, dynamic programming matrix chain multiplication and knapsack. |
| CS302 | Advanced Algorithm Implementation & Competitive Coding Lab | Practical | Implement complex graph algorithms, minimum spanning trees, max-flow/min-cut and dynamic programming in C++. |
| CS303 | Computer Networks, Architecture & Layered Protocols | Theory | Deconstruct TCP congestion control, sliding window flow control, IP routing algorithms (OSPF, BGP) and DNS. |
| CS304 | Network Socket Programming in C/C++ Lab | Practical | Construct asynchronous multi-client TCP/UDP socket servers utilizing select, poll and Linux epoll mechanisms. |
| CS305 | Theory of Computation, Automata & Formal Languages | Theory | Prove regular language limits with pumping lemmas, build deterministic finite automata (DFA) and pushdown automata. |
| CS306 | Lexical Analysis & Context-Free Parser Engineering Lab | Practical | Write custom lexers and context-free parsers for a domain-specific language using Flex and Bison / ANTLR. |
| CS307 | Software Engineering Principles, Lifecycle Models & Architecture | Theory | Evaluate architectural styles: client-server, layered, microkernel, pipe-and-filter and agile life cycles. |
| CS308 | Web Systems Engineering & Full-Stack Development Lab | Practical | Engineer a modern database-backed web application using a modern backend framework and responsive frontend. |
| CS309 | Scientific Computing & Mathematical Research Methodologies | Theory | Formulate numerical stability, floating-point error propagation and reproducible scientific research methods. |
| Code | Module Title | Type | Discipline & Learning Outcome |
|---|---|---|---|
| CS401 | Computational Complexity, P vs NP & Decidability Theory | Theory | Prove Turing machine undecidability, halting problem reductions, NP-completeness proofs (3-SAT, Clique, Hamiltonian). |
| CS402 | Approximation & Randomized Algorithms Workshop | Practical | Implement randomized quicksort, Monte Carlo approximations and greedy approximation heuristics for NP-hard problems. |
| CS403 | Compiler Construction: Parsing, ASTs & Code Generation | Theory | Analyze abstract syntax trees (AST), symbol tables, static semantic analysis, intermediate representation (IR) and LLVM. |
| CS404 | LLVM Compiler Optimization & Code Generation Lab | Practical | Construct an end-to-end compiler translating source code into optimized native assembly using the LLVM framework. |
| CS405 | Database Systems Internals: B-Trees, WAL & Query Planners | Theory | Analyze write-ahead logging (WAL), ARIES recovery, multi-version concurrency control (MVCC) and cost query plans. |
| CS406 | Storage Engine & In-Memory Database Implementation Lab | Practical | Construct an in-memory B+ tree storage engine with transactional ACID locking and binary serialization in C++. |
| CS407 | Machine Learning & Pattern Recognition Foundations | Theory | Derive linear classifiers, kernel SVMs, decision trees, k-means clustering and neural network backpropagation. |
| CS408 | Applied Machine Learning Implementation Lab | Practical | Train and evaluate machine learning models on benchmark vision and tabular datasets using Scikit-Learn and PyTorch. |
| CS409 | Industrial Creative Computing Team Project: Computational Systems Studio | Practical | Collaborate to design, construct and benchmark a scalable computational software platform. |
| Code | Module Title | Type | Discipline & Learning Outcome |
|---|---|---|---|
| CS501 | Distributed Systems Architecture, Consensus & Fault Tolerance | Theory | Analyze Byzantine generals problem, Paxos, Raft consensus, vector clocks, Lamport timestamps and distributed transactions. |
| CS502 | Distributed Consensus Implementation Lab (Raft / RPC) | Practical | Implement a fault-tolerant distributed key-value store with leader election and log replication using gRPC. |
| CS503 | Parallel & High-Performance Computing (OpenMP, MPI & CUDA) | Theory | Analyze Amdahl's law, Gustafson's law, shared-memory thread pools and distributed-memory message passing. |
| CS504 | High-Performance Parallel Computing Lab (MPI & OpenMP) | Practical | Parallelize scientific matrix multiplication and stencil algorithms across multi-core CPUs and cluster nodes using MPI. |
| CS505 | Applied Cryptography, Hash Functions & Secure Communication | Theory | Analyze block cipher security, public-key cryptosystems, zero-knowledge proofs and secure enclave architectures. |
| CS506 | Cryptographic Protocol Implementation & Security Audit Lab | Practical | Implement secure cryptographic handshake protocols and audit software implementations against timing attacks. |
| CS507 | Swiss & Global Standards for Critical Computing Systems | Theory | Audit safety-critical software against DO-178C avionics standards, ISO 26262 automotive safety and formal verification. |
| CS508 | Formal Methods, Model Checking & Automated Verification Lab | Practical | Formally verify protocol invariants and state transition models using TLA+, Spin or Z3 SMT solvers. |
| CS509 | Senior Creative Computing Capstone Project: Architecture & Formal Specification | Practical | Author formal architectural blueprints, mathematical specifications and algorithmic complexity proofs. |
| Code | Module Title | Type | Discipline & Learning Outcome |
|---|---|---|---|
| CS601 | Quantum Computing Horizons & Post-Turing Paradigms | Theory | Analyze qubits, superposition, quantum entanglement, quantum circuits, Shor's algorithm and Grover search. |
| CS602 | Senior Creative Computing Capstone Project: System Build & Engineering | Practical | Implement the complete software or hardware-software system with rigorous algorithmic optimizations and testing. |
| CS603 | Senior Creative Computing Capstone Project: Empirical Benchmarking & Profiling | Practical | Execute rigorous performance profiling, measuring cache misses, memory bandwidth and throughput scaling. |
| CS604 | Technical Leadership & Scientific Advisory in Computing | Theory | Communicate deep technical research, architectural risk and computational trade-offs to senior leadership. |
| CS605 | Production Hardening, Containerization & CI/CD Deployment Lab | Practical | Package the system into hardened container images and establish continuous integration testing suites. |
| CS606 | Societal Impact, Algorithmic Ethics & Future of Computing | Theory | Evaluate the long-term societal consequences of pervasive computing, artificial intelligence and ethical responsibility. |
| CS607 | Industry Technical Computer Science Portfolio & Code Defense | Practical | Defend algorithmic choices, data structure efficiency and theoretical correctness before an expert panel. |
| CS608 | Peer Review, Scientific Dissemination & Technology Transfer | Theory | Author peer-reviewable scientific manuscripts conforming to IEEE/ACM publishing and reproducibility standards. |
| CS609 | Final Creative Computing Capstone Project Demonstration & Oral Defense | Practical | Demonstrate the live production computational system and pass an oral academic dissertation examination in Creative Computing. |
Secondary School Diploma / Swiss Matura / International Baccalaureate or recognized foreign upper-secondary certificate. English proficiency IELTS 6.0+ or equivalent.
Brookfield School of Computing is an independent private education institution in formation. Academic programmes, entry requirements, fees and awards are subject to institutional review and applicable Swiss legal regulations.