Thread: Frequent Job Interviewing Questions

Thanks axon and mystic_skies..

but they don't expect me to memorize everything i've been into , do they?

Here's one from an interview I had:

Given a node in a singly linked list, with no other knowledge of the list (i.e. not knowing the head), how would you remove that node?

do they want you to actually delete that node, or just write a code that would give the effect that the mentioned node has been removed?? the latter is simple enough, i am not too sure if actual deletion of the node can be done with the limited info. is it possible to delete it ??

For all those who applied for a programming job :

Which would help you most to get the job : your personal portfolio , your experience (like worked with few APIs\systems ..etc) or the job interview?

When you apply for a job, chances are that about hundred other people applied as well. The most important part is the job interview. However, no one will interview a hundred people. First, people will sort out the 10 most likely candidates. This will be done by looking at your resume & cv. Priority here is knowledge of the stuff they work with. Obviously, 2 years Oracle is better than 3 years MS-SQL if the employer is using Oracle. Then there are things in the cv that don't fit the image people have of their future employee. If you have to sort out 90% to keep it managable, you take every reason you can get. I have sorted out resumes for the sole fact that those people had a german D equivalent in Maths 8 years ago in school.

So all parts are important, each in another step of the screening.

@Ping: The code just has to appear to remove the node from the list. As long as the list is without that node afterwards, and there aren't any memory leaks, it's all good.

- Can we generate a C++ source code from the binary file?
Yes and no. You can disassemble a binary file and then try to convert it to C++. However with optimization it most likely will not look anything like your orginal code. Also variable names will be lost.

I'd have to say the answer is no. You cannot put a class back together again, no matter how good a reverse engineer you are.

Originally Posted by PING

do they want you to actually delete that node, or just write a code that would give the effect that the mentioned node has been removed?? the latter is simple enough, i am not too sure if actual deletion of the node can be done with the limited info. is it possible to delete it ??

I want to know the answer, too. And it'd better be some smart solution, not just a joke.

The way I did it; copy the data from next node to the current (first loop this will be the node that should be "deleted") node, set current node to be next. Repeat unitil you reach the end node, then pop that endnode.

> Now the real question becomes: If you are at the tail can you delete the Node?
Damn, beaten to the obvious question now

Yes , if you design it for it to be possible

Sorry, left something out in my initial problem statement. It's a circular singly linked list.