Write a complex asserino
Design Verification Engineer Interview Questions
3,712 design verification engineer interview questions shared by candidates
virtual memory standard libraries in C how to build a cache how will you move data in cache what is recursion linked lists, binary tree, flat architecture, how a CPU would work
virtual memory standard libraries in C how to build a cache how will you move data in cache what is recursion linked lists, binary tree, flat architecture, how a CPU would work
Why OOPs is important
1.what are the problems you faced during your project?
Given an expression with brackets, Suggest a solution to check legality: Examples: ((), )(), (((} , {[()]
1. Basics of digital electronics like combinational gates, mux, flip flops, registers, finite state machines, Verliog/ RTL code. 2. Difference between i) setup and hold time, ii) synchronous and asynchronous rests(explain through verilog coding) , iii) mealy and moore iv) tasks and function v) combinational and sequential vi) blocking and non-blocking statements vii) inter and intra statement delay 3. Verilog code for flip flops and finite state machines. 4. Maximum operating frequency of the circuit which had a combo logic between 2 flip flops. (HINT: Setup and hold time equation's based ques) 5. Varying what factor in the equation of setup and hold time can the violation of setup and hold time can be eliminated. (HINT: By varying combo propagation time.) 6. Flip flop conversions, truth tables, a logic implementation through mux, kmaps. 7. ASIC flow diagram, what is netlist, what is RTL. 8. OOPS concepts, sorting algorithms, time complexity. 9. Types of interrupts, what happens when interrupt is called. 10. What is function, what is class. How a class is called. 11. Detecting a sequence through mealy and moore state machines.
OOP and polymorphism. Basic System Verilog and UVM coding.
Convert the RTL logic to a gatelvel netlist. Constraint question from system verilog.
3 Question 1 about one of my own projects, Question 2 about verification (Giving a situation which test would you run), Question 3 is a software question write a function that checks if the given input is a palindrome which is simple but then they start to make it harder and harder count how much palindromes there is in 1 string and now the same while getting the input 1 by 1 ... in O(nlogn) or O(n)
Viewing 3591 - 3600 interview questions