As a Software Engineer at Plessey, you are stepping into a pivotal role within a company at the forefront of advanced optoelectronics and semiconductor innovation. Your work directly influences the development of cutting-edge display technologies, bridging the gap between complex hardware systems and high-performance software solutions. This is not merely about writing code; it is about engineering robust, efficient systems that power the next generation of visual experiences. You will work in a highly specialized environment where the stakes are high and the technical challenges are significant. Whether you are working on infrastructure, process automation, or device simulation, your contributions are the backbone of the company’s ability to iterate and scale. Because Plessey operates in a niche, high-tech sector, you will find yourself collaborating with world-class engineers, physicists, and researchers, making this an ideal role for those who thrive on solving complex, real-world engineering problems. ##### Tip The environment at Plessey is highly technical and research-oriented. Be prepared to explain the "why" behind your code, as the team values deep conceptual understanding over simple implementation.
Initial Screening
reportedThe process begins with a general screening to assess candidate fit.
What to demonstrate
- The process begins with a general screening to assess candidate fit
- Depth in FPGA Development
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 Assessments
reportedCandidates undergo deeper, panel-based technical evaluations.
What to demonstrate
- Candidates undergo deeper, panel-based technical evaluations
- Depth in FPGA Development
How to prepare
- Answer aloud and timed: What are the potential failure points in this system design, and how would you mitigate them?
- Answer aloud and timed: Describe your process for debugging a complex issue that spans both hardware and software layers.
Technical Presentations
reportedCandidates are required to present technical topics and solve real-world problems.
What to demonstrate
- Candidates are required to present technical topics and solve real-world problems
- Depth in FPGA Development
How to prepare
- Answer aloud and timed: How do you ensure your code is maintainable and scalable for long-term project lifecycles?
- Answer aloud and timed: Walk us through a technical project you led; what were the primary challenges?
Holistic Evaluation
reportedMultiple team members assess the candidate's technical skills and collaborative abilities.
What to demonstrate
- Multiple team members assess the candidate's technical skills and collaborative abilities
- Depth in FPGA Development
How to prepare
- Answer aloud and timed: Please present a topic relevant to our current work that demonstrates your specialized knowledge.
- Answer aloud and timed: How would you approach a task where the requirements are initially ambiguous?
Final Panel Stages
reportedCandidates showcase detailed technical case studies and engage in presentation practice.
What to demonstrate
- Candidates showcase detailed technical case studies and engage in presentation practice
- Depth in FPGA Development
How to prepare
- Answer aloud and timed: Describe a time you had to pivot your technical strategy based on new data or constraints.
- Answer aloud and timed: How do you ensure your work meets the high-quality standards required for semiconductor manufacturing?
PracHub editorial advice for the preparation topics above.
Own your gaps
If you don't know an answer, admit it clearly and then explain how you would find the answer. This is seen as a sign of maturity and technical integrity.
Prepare your presentation early
Do not leave your technical presentation to the last minute. Practice it in front of peers if possible to refine your delivery.
Understand the industry
Research the specific challenges currently facing the optoelectronics and semiconductor industry to show you are aligned with the company’s broader mission.
Focus on the "Why
Don't just explain what you did; explain why you chose that specific solution over alternatives.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
How would you optimize this specific algorithm for a resource-constrained environment?
How would you optimize this specific algorithm for a resource-constrained environment?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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 would you approach a task where the requirements are initially ambiguous?
How would you approach a task where the requirements are initially ambiguous?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
Diff a projection against the primary without per-row point reads
The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.
Approach
- Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
- Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
- For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
- Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.
Follow-up
- The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
- Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?
Stop tag and share joins from fanning out a page
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
- 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.
- 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.
- 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.
- 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 why the owner filter ignores the listing index
The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.
Approach
- Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
- For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
- Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
- Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.
Follow-up
- 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
- A dashboard runs this for 40 owners in one page load. What changes about the design?
Can you explain the trade-offs between these two architectural approaches in a hardware-interfacing context?
Can you explain the trade-offs between these two architectural approaches in a hardware-interfacing context?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 the potential failure points in this system design, and how would you mitigate them?
What are the potential failure points in this system design, and how would you mitigate them?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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?
How do you ensure your code is maintainable and scalable for long-term project lifecycles?
How do you ensure your code is maintainable and scalable for long-term project lifecycles?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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?
Walk us through a technical project you led; what were the primary challenges?
Walk us through a technical project you led; what were the primary challenges?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Please present a topic relevant to our current work that demonstrates your specialized knowledge.
Please present a topic relevant to our current work that demonstrates your specialized knowledge.
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- 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 ensure your work meets the high-quality standards required for semiconductor manufacturing?
How do you ensure your work meets the high-quality standards required for semiconductor manufacturing?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- 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 your process for debugging a complex issue that spans both hardware and software layers.
Describe your process for debugging a complex issue that spans both hardware and software layers.
Approach
- Establish what changed and when, before forming any theory.
- Pick a bisection that eliminates candidates whichever way it turns out.
- Check the instrumentation before believing the symptom.
- 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?
Built from the rounds and topics Plessey candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Plessey loop
- Write out the reported sequence: Initial Screening, Technical Assessments, Technical Presentations, Holistic Evaluation, Final Panel Stages.
- 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 5 reported rounds, with the weakest marked.
02Work FPGA Development
- Spend the session on FPGA Development, which Plessey candidates report being tested on.
- Write one worked example in FPGA Development and time yourself on it.
Deliverable: One timed worked example in FPGA Development.
03Work Software Engineering Fundamentals
- Spend the session on Software Engineering Fundamentals, which Plessey candidates report being tested on.
- Write one worked example in Software Engineering Fundamentals and time yourself on it.
Deliverable: One timed worked example in Software Engineering Fundamentals.
04Work Technical Theory & Concepts
- Spend the session on Technical Theory & Concepts, which Plessey candidates report being tested on.
- Write one worked example in Technical Theory & Concepts and time yourself on it.
Deliverable: One timed worked example in Technical Theory & Concepts.
05Answer out loud: Technical Theory and Domain Knowledge
- Answer aloud, timed: How would you optimize this specific algorithm for a resource-constrained environment?
- Answer aloud, timed: Can you explain the trade-offs between these two architectural approaches in a hardware-interfacing context?
Deliverable: Spoken answers to 2 reported Technical Theory and Domain Knowledge question(s), under time.
06Answer out loud: Practical Application and Presentation
- Answer aloud, timed: Walk us through a technical project you led; what were the primary challenges?
- Answer aloud, timed: Please present a topic relevant to our current work that demonstrates your specialized knowledge.
Deliverable: Spoken answers to 2 reported Practical Application and Presentation question(s), under time.
07Dry run for Plessey
- Run one full mock under time, then write down the two questions you most want to ask your interviewers.
Deliverable: A completed timed mock and two questions to ask.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe a time you had to pivot your technical strategy based on new data or constraints.
Describe a time you had to pivot your technical strategy based on new data or constraints.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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?
Unblock an engineer without taking the keyboard
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
Approach
- Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
- Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
- Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
- Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.
Follow-up
- How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
- Their handler calls an external endpoint before recording that it did. What do you tell them to change first?
Argue against a design, lose, and commit anyway
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
Approach
- State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
- Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
- Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
- Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.
Follow-up
- What threshold on that alert would have proved you right, and did anyone ever look at it?
- If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?
- 01
Describe a time you had to pivot your technical strategy based on new data or constraints.
- 02
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
- 03
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
How difficult are the technical interviews?
They are considered challenging. The interviewers are experts, so prepare to engage in a deep, peer-level discussion rather than a basic Q&A session.
Plessey Software Engineer candidate reports ↗How much time should I spend preparing?
Dedicate at least a few weeks to brush up on both your core technical foundations and the specifics of your past projects. The presentation round, in particular, requires significant lead time for preparation.
Plessey Software Engineer candidate reports ↗What is the culture like at Plessey?
It is a highly professional, technical, and collaborative environment. They value intellectual honesty and a proactive approach to problem-solving.
Plessey Software Engineer candidate reports ↗Will I be working on-site?
Given the nature of the work, which often involves hardware integration, expect on-site presence to be a significant component of the role in Plymouth.
Plessey Software Engineer candidate reports ↗What topics does Plessey test in interviews?
Plessey interviews most often cover Engineering Management, FPGA Development, Process Engineering Management, Software Engineering Fundamentals, and Technical Leadership. The exact emphasis depends on the specific role you apply for.
Plessey Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Plessey Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.