Given a i-order list of operations along with operands, we need to compute the result. Converting inorder operations to post order operations was a fundamental question? Like before we need to handle error checks as well as follow object-oriented coding
The recruiter draw an RC circuit and let me draw the vo/vin diagram in 10ns.
How to size an inverter, and its operating regions
give you the preorder and postorder print of tree nodes, reconstruct the tree.
Explain what a critical path is.
Given a 2d array sorted in increasing order from left to right and top to bottom, what is the best way to search for a target number?
Name a time where you had to sacrifice quality in order to finish on time
In the last round few questions asked were What is thrashing What is paging
Reverse a linked list. After presenting a solution I was asked to provide a recursive method.
it is basic algorithms. The first is a sort algorithm. There is an array with a million integer. The integer's length is 10 bit. Find an algorithm with run complexity of N. The second is about detect if there is any circle in a linkelist
Viewing 1601 - 1610 interview questions