πŸ“˜ FIT1047: Introduction to Computer Systems, Networks and Security

Map of Content

Index for FIT1047 (Malaysia campus). Hand-execution unit: number conversions, logic circuits, MARIE assembly traces are the assessed skills β€” every applied note carries a write-from-blank element.

πŸ“Š Assessment Map

  • Assignment 1 (15%) βž” Foundations: Binary Number System (W1) + Boolean Logic Circuit (W2).
  • Assignment 2 (30%) βž” Programming Interview: Assembly Programming (W3–4), Computer Architecture (W3–4), Motherboard & Boot (W5), OS (W5).
  • Assignment 3 (30%) βž” Networks
  • Assignment 4 (25%) βž” Security
  • LO1 (W1–2): number representations + Boolean algebra β†’ logic circuits Β· LO2: hardware/software architectures Β· LO3: MARIE assembly Β· LO4: OS functions.

🧰 Unit Cheatsheet

πŸ“… Knowledge Index

Week 1 β€” Data Representation (Foundations of Computing)

Week 2 β€” Boolean Logic & Circuits

Week 3 β€” Circuits with Memory, Architecture & MARIE

Week 4 β€” Indirect Addressing, Subroutines & Memory

Week 5 β€” Motherboard, I/O, Boot & Operating Systems (A2 material complete)

Week 6 β€” Networks I: Layers & Application Protocols (LO5–6 begin)

Week 7 β€” Networks II: The Four Lower Layers & Addressing

Week 8 β€” Networks III: Switched Ethernet, WiFi & Organisational Networks

Week 9 β€” The Internet: Structure, Access, Delivery & Society

Week 10 β€” Security I: Cryptography & Secure-Channel Protocols (LO7)

Week 11 β€” Security II: Authentication, Access Control & Network Defence (LO7)

Week 12 β€” Security III: Threats, Vulnerabilities, Risk & Privacy (LO7)

🧭 Suggested Reading Order

(read left→right within each week · bold = assessment-critical hand skill)

🎯 Learning Outcomes (key skills per week)

  • W1 βž”
    • convert dec↔bin↔hex + add binary by hand
    • negate via flip+1, range + overflow by sign rule
    • normalise IEEE 754 + explain why is inexact
    • decode ASCII hex, Unicode vs UTF-8
    • switch β†’ transistor β†’ gate story
  • W2 βž”
    • build truth tables (precedence NOT>AND>OR)
    • apply the Boolean laws to simplify/prove equivalence
    • truth table β†’ SOP β†’ circuit
    • minimise with a K-map (Gray code, maximal groups, wrap-around)
    • NAND/NOR universality
  • W3 βž”
    • explain adders/decoder/MUX + compute-all-MUX-select ALU
    • SR latch (hold row, forbidden ), D flip-flop, registers
    • Von Neumann + stored program
    • hand-trace fetch-decode-execute in RTL
    • write MARIE with SkipCond+Jump idioms
  • W4 βž”
    • direct vs indirect addressing ( vs )
    • pointer-walk array loops, counter vs sentinel termination
    • JnS/JumpI subroutines (HEX 0 slot, no recursion)
    • capacity from address width Γ— addressability
    • cache vs swap directions
  • W5 βž”
    • board components + interface trade-offs
    • memory-mapped vs port I/O
    • polling vs interrupts vs DMA
    • the 12-step boot chain, BIOS vs UEFI
    • Running/Ready/Blocked trace, user/kernel mode, system calls
    • MMU isolation + page faults
  • W6 βž”
    • client/server/switch/router + reach ladder
    • transfer time with
    • five layers + PDUs, protocol vs interface
    • encapsulation both directions
    • label a raw HTTP session
    • email’s three hops, POP vs IMAP, MIME
  • W7 βž”
    • digital encodings vs modulation
    • CSMA/CD’s three parts
    • one address per layer
    • subnet arithmetic
    • DNS (iterative vs recursive) + ARP broadcast
    • per-hop routing, RIP vs OSPF
    • TCP seq/ack lifecycle vs UDP
  • W8 βž”
    • switch learning/flood-when-unknown/store-and-forward
    • switch vs hub vs router
    • WiFi channels (), CSMA/CA + hidden node, BSS/ESS
    • rank open/WEP/WPA2-PSK/Enterprise
    • owned LAN/backbone vs the leased WAN triangle
  • W9 βž”
    • AS + BGP, interior vs exterior routing
    • peering vs transit, IXPs, tiers
    • access technologies (ADSL/DSLAM, NBN/GPON, 4G/5G)
    • load balancing vs caching vs CDN
    • IoT security + Mirai/Dyn
    • net-neutrality trade-offs
  • W10 βž”
    • match security goal β†’ mechanism
    • AES + its three weaknesses ( keys)
    • RSA ops + key-length pairs
    • hash properties + MAC-not-bare-hash
    • DH exchange + discrete log, no authentication
    • certificates/CA/revocation
    • TLS + VPN endpoint limits
  • W11 βž”
    • three authentication factors
    • salted-hash password storage
    • MFA + biometric/token/app trade-offs, SIM swap
    • ACL scaling wall β†’ Kerberos/SSO
    • firewall = filter-not-block + its limits
    • IDS vs IPS, NGF TLS-proxy cost
  • W12 βž”
    • attack/malware taxonomy (virus vs worm vs trojan)
    • four vulnerability classes + shared root cause (unchecked input)
    • case-study lesson: exposure + insecure defaults
    • residual risk + NIST RMF Β· profiling, PETs, data minimisation