AWS Cloud
Learn practical cloud architecture with offline lessons and reference notes on ExamMaster.
Each lesson below is a full chapter you can read without an account. Sign in only when you want the scored drills.
Lessons
- Billing, Pricing and Cost OptimizationAWS pricing models, cost management tools and strategies to optimize spend.
- DynamoDB NoSQLFully managed key value and document NoSQL database with single digit millisecond latency.
- EBS and EFS StorageBlock storage with EBS and shared file storage with EFS for EC2 workloads.
- Load Balancing and Auto ScalingElastic Load Balancing and Auto Scaling groups for resilient and scalable architectures.
- Lambda and ServerlessEvent driven serverless compute with Lambda plus API Gateway and Step Functions.
- CloudWatch and CloudTrailMonitoring metrics and logs with CloudWatch and auditing API activity with CloudTrail.
- RDS and Aurora DatabasesManaged relational databases with RDS and Aurora including replicas and high availability.
- Route 53 and CloudFront CDNDNS with Route 53 and global content delivery with the CloudFront CDN.
- EC2, S3 Storage and IAM SecurityCore AWS compute with EC2, object storage with S3, and identity and access management with IAM.
- Security, KMS and EncryptionData protection with KMS, encryption in transit and at rest, and the shared responsibility model.
- SQS, SNS and EventBridgeDecoupling applications with queues, pub sub notifications and event routing.
- VPC NetworkingVirtual Private Cloud design with subnets, route tables, gateways and security controls.
- Well Architected Framework and ResilienceThe six pillars of the AWS Well Architected Framework and designing resilient multi AZ systems.
- Input, Output and DMAHow the CPU talks to devices: polling, interrupts, DMA, and the same LOAD aimed at a device register.
- Cache and the Memory HierarchyWhy caches work, where a block may live, and how to average the cost of a hit and a miss.
- Instruction PipeliningOverlap fetch, decode, execute, memory and write-back; hazards that stall that overlap; speedup versus a non-pipelined machine.
- ISA and CPU TimeThe hardware contract: what an instruction is, how it names operands, and the three levers of CPU time.
- Entities, Relationships and TablesFrom a campus-shop ER sketch to the three tables a relational database actually stores.
- Indexing and B+ TreesClustered versus secondary indexes and B+ trees that find a campus-shop sale without a full scan.
- Isolation Levels and LockingWhich accidents a kiosk session may still see, from READ UNCOMMITTED to SERIALIZABLE, and how 2PL implements the stronger ones.
- Second, Third and Boyce–Codd FormSplit the campus-shop leftovers: partial FDs, transitive wardens, and BCNF determinants.
- Functional Dependencies and First Normal FormFDs, attribute closure, candidate keys and atomic cells — the rules that make the campus-shop tables split later.
- Relations, Keys and Basic SQLWhat a relation is, how keys name a row, relational algebra, and SELECT/WHERE on one campus-shop table.
- SQL Joins, Groups and NULLJoin the campus-shop tables, group sales, and handle missing values in SQL.
- Transactions, Accidents and RecoveryACID on one sale, dirty/lost/phantom accidents, conflict serializability and write-ahead logging.
- DNS, HTTP and MailDNS resolution and records, HTTP/HTTPS, well-known ports, and the SMTP send versus POP3/IMAP pull split.
- IP Addressing, CIDR and NATIPv4 addressing, subnetting with CIDR, fragmentation, and support protocols like ARP, DHCP and NAT.
- How a Packet Finds a PathRoutes as next hops, distance-vector Bellman-Ford, count-to-infinity, and link-state Dijkstra.
- TCP Flow and Congestion ControlReceiver window versus congestion window, sliding-window throughput, slow start and AIMD after loss.
- Layers and How a Connection OpensOSI versus TCP/IP layering, TCP versus UDP, the three-way open and four-way close, and the header bytes that name ports.
- DeadlocksCoffman conditions, wait-for / resource-allocation graphs, Banker's algorithm and the minimum-units bound.
- Disk schedulingDisk access time and FCFS, SSTF, SCAN-family head movement.
- File systemsWhat a file is, contiguous / linked / indexed allocation, inodes and directories.
- Memory managementPaging, address translation, the TLB, demand paging and segmentation.
- Page replacementVictim choice under FIFO, LRU and Optimal, and Belady's anomaly.
- Processes and the PCBWhat a process is, the five states, the PCB, context switches, multiprogramming and how two processes exchange data.
- CPU schedulingTurnaround, waiting and response, then FCFS, SJF, SRTF, Round Robin and priority on one three-job walk.
- SynchronizationRaces, the critical-section properties, Peterson's two-process lock, semaphores and monitors.
- System calls and the process APIUser versus kernel mode, the trap that is a system call, and fork / wait / exit.
- ThreadsThreads share a process's address space; user-level versus kernel-level scheduling.
- CachingA fast copy of a CampusClip mapping — hits, write paths, staleness, and where the copy sits after scale-out.
- Latency vs throughputTime for one CampusClip open versus finishes per second, and Little's Law for in-flight work.
- Load vs capacityArrivals versus what a CampusClip host can finish — excess, utilisation, and QPS × payload.
- QueuesWork the CampusClip caller is not waiting on — bursts, producer/broker/consumer, back-pressure, and when not to queue.
- CampusClip walkThe two CampusClip paths — paste and redirect — with the store, key placement, and a sketch that uses only numbers the course already stated.
- Growing past one boxHow CampusClip grows from one host to many — scale up versus out, a load balancer, CAP under a partition, and availability nines.
Practise AWS Cloud
Reading every chapter below is free and needs no account. Practice, mocks and progress live in the app.
Continue with Google — freeNo card, no trial. Works offline once installed.