Skip to contentSkip to footer

Verification Interview Questions

Salaries
Interviews

3,655 verification interview questions shared by candidates

First Round: 1. AND and OR gate using 2:1 Mux 2. Single line logic to check if a number is a power of 2 3. Working of in-order pipeline 4. Inputs to the program counter in an in-order pipeline 5. Working of a Branch Predictor and operations on it 6. Converting the in-order pipeline to an out-of-order pipeline 7. Register renaming and examples of memory disambiguation 8. Recursive function to find factorial of a number Second Round: 1. Project implementation details from resume 2. Function to perform binary search, first using iterations and then using recursion - also, how to terminate the recursion if the key is not found
avatar

Digital Verification Engineer

Interviewed at Apple

4.1★
Sep 19, 2016

First Round: 1. AND and OR gate using 2:1 Mux 2. Single line logic to check if a number is a power of 2 3. Working of in-order pipeline 4. Inputs to the program counter in an in-order pipeline 5. Working of a Branch Predictor and operations on it 6. Converting the in-order pipeline to an out-of-order pipeline 7. Register renaming and examples of memory disambiguation 8. Recursive function to find factorial of a number Second Round: 1. Project implementation details from resume 2. Function to perform binary search, first using iterations and then using recursion - also, how to terminate the recursion if the key is not found

class A; function int foo(); int a; return ++a; endfunction endclass program tb; A a; int b, c; initial begin for(int i = 0; i < 10; i++) begin b = a.foo(); c = foo(); $display("B = %0d", b); $display("C = %0d", c); end end function int foo(); int a; return ++a; endfunction
avatar

Design Verification Engineer

Interviewed at Apple

4.1★
Sep 21, 2023

class A; function int foo(); int a; return ++a; endfunction endclass program tb; A a; int b, c; initial begin for(int i = 0; i < 10; i++) begin b = a.foo(); c = foo(); $display("B = %0d", b); $display("C = %0d", c); end end function int foo(); int a; return ++a; endfunction

First interview - I was asked to write pseudo code for memory allocation (like malloc/free). Second interview - I was asked to describe verification environment for a FIFO, considering sync/async. And to write a UVM monitor.
avatar

Verification Engineer

Interviewed at Apple

4.1★
May 4, 2024

First interview - I was asked to write pseudo code for memory allocation (like malloc/free). Second interview - I was asked to describe verification environment for a FIFO, considering sync/async. And to write a UVM monitor.

Viewing 1301 - 1310 interview questions

Glassdoor has 3,655 interview questions and reports from Verification interviews. Prepare for your interview. Get hired. Love your job.