opistobranchia wrote:
....
>
>>5. Evidence of "passion" for software development
>>
>
> That is me, and I let them know that.
I'd be looking for evidence: i.e Did you write any open source code ?
Are you a member of an open source project? Have you filed any bugs on
open source projects ? Do you have any pet project you have worked on ?
Have you answered any questions on comp.lang.c++ ? Do you attend ACCU
meetings (or other associations or UGs) ? Which journals do you read ?
>
>>As for basic computer science, there are a number of very basic things
>>that very unfortunately, many programmers just don't know.
>>
>>e.g.
>>a)
>> int * p;
>>
>> what is (p+1) ?
>>
>
> This is an error since p does not point to anything, it must point to
> something first. However is p pointed to an array int object then it
> would now point to the next item in the array.
50% of people I interview (phone screen) do not know that.
>
>>b) ( !a && !b ) == !( a || b )
>>
>
> This is demorgans law. We can use boolean algebra or a truth table to
> show that they are both equal
Sure, I'm still astounded to see lots of code that looks like :
if ( !( !a && !b ) ) ....

// some of which I wrote myself

(
>
>>c) System design issues - reference counted objects and cyclic reference
>>counts.
>>
>
> Used for garbage collecting. When keep track of the total references
> to a object. When the count is zero it is ready to be deleted. Cylic
> reference count is the count of a ref b and also b ref a.
So what happens when there is a cyclic reference using reference counts?
>
>>d) What is a sufficient condition for susceptability to deadlock.
>>
>
> Threada has a lock on resource1, and is waiting on resource2 before it
> releases its lock on resource1. Threadb has a lock on resource2 and
> is waiting for threada or is waiting on resource1 before is releases
> resource2. =Deadlock since everybody needs the other to finish
d) What is the minimum sufficient condition for susceptability to deadlock.
I mis-wrote that - the *minimum* sufficient condition. You wrote a
single condition. Or said in another way: "If I have N resources and T
threads, what do I have to guarentee *not to do* to avoid any
possibility of deadlock."
>
>>etc etc
>
>
> Would that be good? Do you have some more interview questions?
Not handy. There are plenty of web sites - some of them have very very
poor questions (where some of the questions are plain wrong). Actually,
the FAQ for comp.lang.c++ is excellent.
>
> Thanks for the tips on the books too. I am liking Effective C++ Third
> Edition 55 Specific Ways to Improve Your Programs and Designs. I also
> subcribe to C++ users journals so I have the last 2 years laying
> around. That is good to know, I will start reading more of the
> articles.
>
Good luck !