cswork / libraryOpen practice workspace

Interview guides · AMD Construction Group

AMD Construction Group Software Engineer Interview Guide

AMD Construction Group Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at AMD Construction Group, you play a vital role in building the intelligent software systems, modeling tools, and high-performance infrastructure that power modern high-compute platforms and engineering solutions. The engineering challenges here exist at the intersection of complex software development and hardware-aware systems design. You will work on software layers that drive silicon performance, manage parallel architecture, optimize low-level systems, and automate core computational modeling. Your daily contribution directly influences the capability and efficiency of next-generation tech stack implementations. Whether you are developing low-level runtime libraries, optimizing system performance drivers, designing C/C++ applications, or building developer tools, your code bridges high-level algorithms with underlying compute architectures.

This guide is scoped to a Software Engineer candidate at AMD Construction Group.

Focus areas

  • Power Analysis / Power Planning
  • LLVM / GCC (Compiler Toolchains)
  • Data Structures & Algorithms (DSA)

The AMD Construction Group interview process

AMD Construction Group candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Recruiter Call

Brief 15-to-30-minute call to discuss background, role alignment, and logistics.

What to demonstrate

  • Brief 15-to-30-minute call to discuss background, role alignment, and logistics
  • Depth in Power Analysis / Power Planning

How to prepare

  • Be able to walk your CV end to end in two minutes, and say why this company specifically.
  • Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Phone Interview

45-to-60-minute interview with a hiring manager covering resume deep-dives and foundational technical questions.

What to demonstrate

  • 45-to-60-minute interview with a hiring manager covering resume deep-dives and foundational technical questions
  • Depth in Power Analysis / Power Planning

How to prepare

  • Answer aloud and timed: How do pointer arithmetic and reference variables work under the hood in C systems programming?
  • Answer aloud and timed: Explain the concept of standard template library (STL) internal implementations and runtime complexity.

Virtual Onsite Loop

Multiple rounds of panel interviews focusing on coding, system design, and behavioral assessments.

What to demonstrate

  • Multiple rounds of panel interviews focusing on coding, system design, and behavioral assessments
  • Depth in Power Analysis / Power Planning

How to prepare

  • Answer aloud and timed: How would you write code to manipulate bitwise operators for register mask filtering?
  • Answer aloud and timed: Explain the 5-stage CPU instruction pipeline and describe how structural, data, and control hazards are handled.

Where candidates lose points

Review Your Resume in Detail

Interviewers frequently choose topics directly from your listed projects. Be ready to explain your exact technical contributions, design tradeoffs, and code implementation details for any project listed on your resume.

Explain Your Thought Process Out Loud

During technical problem-solving sessions, think out loud. State your assumptions clearly, explain your logic, and discuss potential edge cases before writing your final code solution.

Brush Up on Low-Level Mechanics

Revisit fundamental concepts such as bit manipulation, memory pointers, stack vs. heap allocation, cache structures, and execution pipeline stages, as these frequently surface during technical discussions.

Prepare Thoughtful Questions for the Team

Leave time at the end of each session to ask insightful questions about the team's ongoing projects, software stack, developer tools, and engineering culture.

Questions & practice

How do you manage memory allocation and deallocation in C/C++, and what are common memory leakage pitfalls?

Medium · Low-Level Systems & C/C++ Programming

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

What are the differences between virtual functions, static binding, and dynamic binding in object-oriented C++

Medium · Low-Level Systems & C/C++ Programming

What are the differences between virtual functions, static binding, and dynamic binding in object-oriented C++?

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

How do pointer arithmetic and reference variables work under the hood in C systems programming?

Medium · Low-Level Systems & C/C++ Programming

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain the concept of standard template library (STL) internal implementations and runtime complexity.

Medium · Low-Level Systems & C/C++ Programming

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

How would you write code to manipulate bitwise operators for register mask filtering?

Medium · Low-Level Systems & C/C++ Programming

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Describe the differences between processes, threads, and how the operating system handles context switching an

Medium · Computer Architecture & Systems Engineer

Describe the differences between processes, threads, and how the operating system handles context switching and memory virtual memory translation.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

How does Direct Memory Access (DMA) reduce CPU overhead during heavy I/O transfers?

Medium · Computer Architecture & Systems Engineer

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

How do you calculate required clock divider ratios and address clock domain crossing (CDC) issues?

Medium · Digital Logic & Hardware-Software Interf

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Given a singly linked list, implement an algorithm to detect a cycle and reverse the list efficiently.

Medium · Algorithms, Data Structures & Problem So

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

How do you determine if a given graph is bipartite using depth-first search (DFS) or breadth-first search (BFS

Medium · Algorithms, Data Structures & Problem So

How do you determine if a given graph is bipartite using depth-first search (DFS) or breadth-first search (BFS)?

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Solve a sequence detector logic problem using state diagrams or functional programming logic.

Medium · Algorithms, Data Structures & Problem So

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain how you would optimize a multi-dimensional constraint solver or dynamic programming algorithm for perf

Medium · Algorithms, Data Structures & Problem So

Explain how you would optimize a multi-dimensional constraint solver or dynamic programming algorithm for performance.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

What are the step-by-step space and time complexity bounds (Big-O) for standard sorting and search structures?

Medium · Algorithms, Data Structures & Problem So

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

  1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
  2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
  3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
  4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

  • The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
  • How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

  1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
  2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
  3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
  4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

  • The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
  • A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

Explain the 5-stage CPU instruction pipeline and describe how structural, data, and control hazards are handle

Medium · Computer Architecture & Systems Engineer

Explain the 5-stage CPU instruction pipeline and describe how structural, data, and control hazards are handled.

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

What is cache coherency, why is it necessary in multi-core compute systems, and how do protocol invalidated st

Medium · Computer Architecture & Systems Engineer

What is cache coherency, why is it necessary in multi-core compute systems, and how do protocol invalidated states work?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

What are interrupts, interrupt service routines (ISRs), and how are priority levels handled in embedded softwa

Medium · Computer Architecture & Systems Engineer

What are interrupts, interrupt service routines (ISRs), and how are priority levels handled in embedded software?

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Explain the structural and behavioral differences between latches and flip-flops, including setup and hold tim

Medium · Digital Logic & Hardware-Software Interf

Explain the structural and behavioral differences between latches and flip-flops, including setup and hold time requirements.

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Describe the logic implementation of a 2-to-1 multiplexer, a synchronous D flip-flop, and a finite state machi

Medium · Digital Logic & Hardware-Software Interf

Describe the logic implementation of a 2-to-1 multiplexer, a synchronous D flip-flop, and a finite state machine (FSM).

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What are static timing analysis (STA) constraints and why are setup/hold violations critical in system modelin

Medium · Digital Logic & Hardware-Software Interf

What are static timing analysis (STA) constraints and why are setup/hold violations critical in system modeling?

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How do you write and debug blocking versus non-blocking assignments in Verilog or hardware description scripts

Medium · Digital Logic & Hardware-Software Interf

How do you write and debug blocking versus non-blocking assignments in Verilog or hardware description scripts?

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Describe a situation where you encountered a difficult technical bug in a large codebase and how you systemati

Medium · Behavioral & Past Experience Discussion

Describe a situation where you encountered a difficult technical bug in a large codebase and how you systematically debugged it.

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics AMD Construction Group candidates report.

Day 1 — Map the AMD Construction Group loop

  • Write out the reported sequence: Recruiter Call, Technical Phone Interview, Virtual Onsite Loop.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.

Day 2 — Work Power Analysis / Power Planning

  • Spend the session on Power Analysis / Power Planning, which AMD Construction Group candidates report being tested on.
  • Write one worked example in Power Analysis / Power Planning and time yourself on it.

Deliverable: One timed worked example in Power Analysis / Power Planning.

Day 3 — Work LLVM / GCC (Compiler Toolchains)

  • Spend the session on LLVM / GCC (Compiler Toolchains), which AMD Construction Group candidates report being tested on.
  • Write one worked example in LLVM / GCC (Compiler Toolchains) and time yourself on it.

Deliverable: One timed worked example in LLVM / GCC (Compiler Toolchains).

Day 4 — Work Data Structures & Algorithms (DSA)

  • Spend the session on Data Structures & Algorithms (DSA), which AMD Construction Group candidates report being tested on.
  • Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures & Algorithms (DSA).

Day 5 — Answer out loud: Low-Level Systems & C/C++ Programming

  • Answer aloud, timed: How do you manage memory allocation and deallocation in C/C++, and what are common memory leakage pitfalls?
  • Answer aloud, timed: What are the differences between virtual functions, static binding, and dynamic binding in object-oriented C++?

Deliverable: Spoken answers to 2 reported Low-Level Systems & C/C++ Programming question(s), under time.

Day 6 — Answer out loud: Computer Architecture & Systems Engineering

  • Answer aloud, timed: Explain the 5-stage CPU instruction pipeline and describe how structural, data, and control hazards are handled.
  • Answer aloud, timed: What is cache coherency, why is it necessary in multi-core compute systems, and how do protocol invalidated states work?

Deliverable: Spoken answers to 2 reported Computer Architecture & Systems Engineering question(s), under time.

Day 7 — Answer out loud: Digital Logic & Hardware-Software Interfaces

  • Answer aloud, timed: Explain the structural and behavioral differences between latches and flip-flops, including setup and hold time requirements.
  • Answer aloud, timed: How do you write and debug blocking versus non-blocking assignments in Verilog or hardware description scripts?

Deliverable: Spoken answers to 2 reported Digital Logic & Hardware-Software Interfaces question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Walk me through a complex technical project on your resume, detailing your specific design decisions and trade

Medium · Behavioral & Past Experience Discussion

Walk me through a complex technical project on your resume, detailing your specific design decisions and tradeoffs.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you handle changing project requirements or tight technical deadlines when collaborating across teams?

Medium · Behavioral & Past Experience Discussion

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Give an example of a time you had a technical disagreement with a teammate and how you resolved it to move the

Medium · Behavioral & Past Experience Discussion

Give an example of a time you had a technical disagreement with a teammate and how you resolved it to move the project forward.

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Why do you want to work on software engineering systems specifically at AMD Construction Group?

Medium · Behavioral & Past Experience Discussion

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?