Hardware & Execution

Every abstraction has a price, and it is paid in cycles and cache misses.

  • Introduction to CS Fundamentals (Hardware)

    • Workshop Series
    • Online
    • 2 h
    • Engineers & Executives
    • 30 participants
    • OLIVESOFT
    • Slides (.pptx)

    Two-part workshop series delivered for OLIVE-LEARN (OLIVESOFT's internal workshop training programme), tracing data movement from parallel hardware architectures down to logic gates.

    Part 1: Efficient execution and parallel compute

    • Data & code execution: CPU instruction pipelining, memory hierarchy (L1/L2/L3 caching), and how DMA, NICs, and APUs offload data movement from the main core.
    • Parallel compute & Python bindings: SIMD, SIMT, and MIMD execution models, demonstrating how high-level Python code (NumPy vectorization, PyTorch GPU threads) targets underlying vector hardware.

    Part 2: Circuit-level computation

    • Data storage and arithmetic built up from SR/D latches to 4-bit registers, adders, and an arithmetic logic unit.
  • Assembly Programming Workshop

    • Hands-on Lab
    • On-site
    • 4 h
    • Engineering Students
    • 60 participants
    • Securinets ENIS
    • GitHub repository

    A hands-on lab on hardware execution and low-level data handling, demonstrating the performance gap between high-level Python and bare-metal assembly.

    • Bus & memory architecture: system bus data transfers, byte ordering (endianness), memory-mapped I/O, and register alignment.
    • ARM assembly & stack management: register pressure, bitwise operations, stack frames, conditional execution, and guided coding exercises.
    • Python vs. ARM assembly benchmarking: dual implementations showing how high-level abstractions introduce memory and stack overhead compared to direct register manipulation.
    • Bare-metal game build: extension Breakout game implemented in x86 assembly, C, and C++ to compare manual memory control and execution speed.

Algorithms & Language

Turning brute force into the right complexity, starting at the first line of Python.

  • Introduction to Competitive Programming

    • Workshop
    • On-site
    • 4 h
    • Engineering Students
    • 40 participants
    • IEEE Student Branch ENIS

    A live-coding session guiding participants from brute-force thinking to optimized, pattern-based problem solving.

    • Core technique drills: solved LeetCode problems live using prefix sums, binary search, and two-pointer strategies, converting O(N2) approaches into O(N) and O(log N) solutions.
    • Complexity reasoning: broke down Big-O time and space analysis for iterative and recursive/backtracking code, including theoretical lower bounds for sorting under different assumptions (O(N log N) vs. O(N) when min/max are known).
    • Practice roadmap: provided a self-study path through NeetCode, Codeforces, HackerRank, Competitive Programming 4, CLRS, and Sedgewick's Coursera algorithms course.
  • Introduction to Python

    • Workshop
    • Online
    • 2 h
    • Engineering Students
    • 12 participants
    • IEEE Student Branch ENIS

    A foundational session that took students from Python syntax to parsing real datasets and visualizing them as charts.

    • Environment setup: configured PyCharm with isolated virtual environments (venv) to establish clean, reproducible project workflows.
    • Core language & data structures: covered Python syntax, dynamic state logic, and native structures (lists, tuples, dictionaries) as building blocks for organizing data.
    • File handling & visualization: parsed CSV files using context managers (with open) and the csv module, then plotted the resulting data with Matplotlib.