At MCA Connect, a Software Engineer plays a pivotal role in bridging the gap between complex business challenges and elegant technical solutions. As a premier Microsoft Gold Partner, the company specializes in deploying, customizing, and optimizing enterprise-grade Dynamics 365, ERP, and CRM systems. Engineers here do not write code in a vacuum; instead, they build highly integrated, scalable software solutions that directly transform the supply chain, manufacturing, and operational capabilities of global enterprises. The impact of this role is immediate and highly visible. You will be responsible for designing custom extensions, architecting data pipelines, and developing integrations that allow multi-billion-dollar businesses to run seamlessly. Because MCA Connect operates as a specialized consultancy, the engineering team must deliver high-performance code while maintaining a deep appreciation for the end-user experience and overall business strategy. This position is ideal for engineers who crave variety and intellectual challenge. Rather than working on a single legacy product, you will engage with a diverse portfolio of clients, each presenting unique technical hurdles. This requires not only strong foundational software engineering skills but also the consultative mindset necessary to translate abstract client requirements into robust, maintainable codebases.
Initial Touchpoint
reportedInitial contact often occurs at university career fairs or through direct recruitment outreach.
What to demonstrate
- Initial contact often occurs at university career fairs or through direct recruitment outreach
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Answer aloud and timed: Explain the difference between an interface and an abstract class, and provide a real-world scenario where you would choose one over the other.
- Answer aloud and timed: What are the core pillars of Object-Oriented Programming, and how do you apply them to ensure code maintainability?
Technical and Behavioral Evaluation
reportedFirst formal round includes object-oriented programming questions and a review of past experiences.
What to demonstrate
- First formal round includes object-oriented programming questions and a review of past experiences
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
- Re-read the description of the technical and behavioral evaluation above and write down what you would ask to confirm before it.
Behavioral and Cultural Fit Interview
reportedConversational interview focusing on personality, hobbies, and career aspirations.
What to demonstrate
- Conversational interview focusing on personality, hobbies, and career aspirations
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
- Re-read the description of the behavioral and cultural fit interview above and write down what you would ask to confirm before it.
Solution Presentation
reportedCandidates present a technical solution to a business problem to a panel of interviewers.
What to demonstrate
- Candidates present a technical solution to a business problem to a panel of interviewers
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Answer aloud and timed: What programming projects or classes have you completed recently that you are most proud of, and why?
- Answer aloud and timed: How do you manage your time and prioritize tasks when working on multiple client deliverables simultaneously?
PracHub editorial advice for the preparation topics above.
Showcase Your Personality
The interviewers at MCA Connect place a massive emphasis on getting to know you as a person. Do not hesitate to discuss your hobbies, university projects, or personal interests during the conversational rounds.
Over-Prepare for the OOP Basics
Do not lose points on simple questions. Make sure you can easily write out and explain the differences between interfaces, abstract classes, and inheritance models.
Be Proactive with Follow-ups
Some candidates have reported communication gaps after completing their interviews. Stay proactive by sending polite follow-up emails to your recruiter to keep your candidacy top-of-mind.
Sending a brief, professional thank-you email to your interviewers within 24 hours of each round is highly recommended
It reinforces your communication skills and demonstrates your continued interest in the consulting team.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
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?
Merge partitioned event streams into one ordered feed with bounded lateness
The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.
Approach
- Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
- Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
- Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
- Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.
Follow-up
- The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
- The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?
Archive a resource graph without breaking live references or recursing
Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.
Approach
- Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
- Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
- Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
- Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.
Follow-up
- The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
- The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?
Keep soft-deleted accounts from blocking re-registration
app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.
Approach
- Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
- Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
- For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
- State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.
Follow-up
- A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
- How do you honour an erasure request while resource_revision.actor_user_id still references this table?
Replace offset paging on the resource feed with keyset
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
Explain the difference between an interface and an abstract class, and provide a real-world scenario where you
Explain the difference between an interface and an abstract class, and provide a real-world scenario where you would choose one over the other.
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?
What are the core pillars of Object-Oriented Programming, and how do you apply them to ensure code maintainabi
What are the core pillars of Object-Oriented Programming, and how do you apply them to ensure code maintainability?
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 would you explain a highly technical database bottleneck to a non-technical business stakeholder?
How would you explain a highly technical database bottleneck to a non-technical business stakeholder?
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?
Walk us through your approach to designing a solution for a client experiencing severe data latency between th
Walk us through your approach to designing a solution for a client experiencing severe data latency between their CRM and ERP systems.
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 code aligns with a specific client's operational constraints and unique business cultur
How do you ensure your code aligns with a specific client's operational constraints and unique business culture?
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?
Listing latency scales with page size, not with filters
The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.
Approach
- Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
- Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
- Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
- Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.
Follow-up
- The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
- How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?
Built from the rounds and topics MCA Connect candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the MCA Connect loop
- Write out the reported sequence: Initial Touchpoint, Technical and Behavioral Evaluation, Behavioral and Cultural Fit Interview, Solution Presentation.
- 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 4 reported rounds, with the weakest marked.
02Work Object-Oriented Programming (OOP)
- Spend the session on Object-Oriented Programming (OOP), which MCA Connect candidates report being tested on.
- Write one worked example in Object-Oriented Programming (OOP) and time yourself on it.
Deliverable: One timed worked example in Object-Oriented Programming (OOP).
03Work Behavioral Interviewing
- Spend the session on Behavioral Interviewing, which MCA Connect candidates report being tested on.
- Write one worked example in Behavioral Interviewing and time yourself on it.
Deliverable: One timed worked example in Behavioral Interviewing.
04Work Object-Oriented Design Principles
- Spend the session on Object-Oriented Design Principles, which MCA Connect candidates report being tested on.
- Write one worked example in Object-Oriented Design Principles and time yourself on it.
Deliverable: One timed worked example in Object-Oriented Design Principles.
05Answer out loud: Object-Oriented Programming & Design
- Answer aloud, timed: Explain the difference between an interface and an abstract class, and provide a real-world scenario where you would choose one over the other.
- Answer aloud, timed: What are the core pillars of Object-Oriented Programming, and how do you apply them to ensure code maintainability?
Deliverable: Spoken answers to 2 reported Object-Oriented Programming & Design question(s), under time.
06Answer out loud: Behavioral & Past Experiences
- Answer aloud, timed: Describe the biggest technical challenge you faced in a past project and how you went about resolving it.
- Answer aloud, timed: Tell me about a time you had to collaborate with a difficult team member or stakeholder to deliver a software solution.
Deliverable: Spoken answers to 2 reported Behavioral & Past Experiences question(s), under time.
07Answer out loud: Client & Solution Presentation
- Answer aloud, timed: How would you explain a highly technical database bottleneck to a non-technical business stakeholder?
- Answer aloud, timed: Walk us through your approach to designing a solution for a client experiencing severe data latency between their CRM and ERP systems.
Deliverable: Spoken answers to 2 reported Client & Solution Presentation question(s), under time.
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.
How do you handle exception propagation in a multi-layered application architecture?
How do you handle exception propagation in a multi-layered application architecture?
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?
Describe your experience with dependency injection and why it is beneficial in large-scale enterprise applicat
Describe your experience with dependency injection and why it is beneficial in large-scale enterprise applications.
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?
Describe the biggest technical challenge you faced in a past project and how you went about resolving it.
Describe the biggest technical challenge you faced in a past project and how you went about resolving it.
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?
Tell me about a time you had to collaborate with a difficult team member or stakeholder to deliver a software
Tell me about a time you had to collaborate with a difficult team member or stakeholder to deliver a software solution.
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?
What programming projects or classes have you completed recently that you are most proud of, and why?
What programming projects or classes have you completed recently that you are most proud of, and why?
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?
How do you manage your time and prioritize tasks when working on multiple client deliverables simultaneously?
How do you manage your time and prioritize tasks when working on multiple client deliverables simultaneously?
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?
- 01
How do you handle exception propagation in a multi-layered application architecture?
- 02
Describe your experience with dependency injection and why it is beneficial in large-scale enterprise applications.
- 03
Describe the biggest technical challenge you faced in a past project and how you went about resolving it.
- 04
Tell me about a time you had to collaborate with a difficult team member or stakeholder to deliver a software solution.
How technical is the interview process at MCA Connect?
The technical portion focus heavily on fundamental concepts rather than complex, algorithmic whiteboard puzzles. You should expect basic to intermediate questions on Object-Oriented Programming, database design, and past project architecture.
MCA Connect Software Engineer candidate reports ↗What is the purpose of the final presentation round?
The final presentation simulates a real consulting engagement. It is designed to test your ability to analyze a business problem, formulate a technical solution, and present your ideas clearly and confidently to a multi-disciplinary panel.
MCA Connect Software Engineer candidate reports ↗How does the company evaluate cultural fit?
MCA Connect looks for candidates who are friendly, collaborative, and highly adaptable. Because you will be working directly with enterprise clients, interviewers want to ensure you possess the empathy, professionalism, and communication skills required to represent the brand successfully.
MCA Connect Software Engineer candidate reports ↗What is the typical timeline from the initial screen to an offer?
The process generally moves at a steady pace, often taking two to four weeks from the initial recruiter screen to the final presentation. However, scheduling the final panel with six interviewers can sometimes introduce slight delays.
MCA Connect Software Engineer candidate reports ↗What topics does MCA Connect test in interviews?
MCA Connect interviews most often cover Microsoft Dynamics 365 (D365), Behavioral Interviewing, Project Management, Object-Oriented Programming (OOP), and Marketing Analytics. The exact emphasis depends on the specific role you apply for.
MCA Connect 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.
- 01MCA Connect 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.