build a function that get: s - sum of puckets n - number of puckets MIN - minimu value of a pucket MAX - maximum value of a pucket return an array in length n that each pucket have a value between MIN and MAX and the sum of all puckets is s. all puckets are random.
Given a Adder and was told to verify it? What are the testcases that you consider?
Questions mainly on SV and UVM. Very few Questions on protocols. Few Puzzels. SV UVM question were in depth. this involved writing various codes for driver, sequence etc. Constraints related questions on array. Assertions were aslo asked
Find 5 first maximums of an array under the condition than if two numbers are sitting side by side in the array, one of them cannot be in the maximum list.
Q : Draw the FSM diagram for a given case considering mealey machine and taking the overlap cases.
mentioned above in detail .. ..
1. basics of Verilog. 2. verification coding questions. 3. coding question in Verilog.
What is carrier aggregation,MIMO, OFDM , RACH procedure. What is the difference between enum and a macro difference between struct and union difference between interface and abstract class and be through with every line on your resume.
Output the sum of the largest series of consecutive values, in an infinite arbitrary series of numbers.
Create an application like Visio.
Viewing 2071 - 2080 interview questions