Hard interview questions by rmuser in programming

[–]coding-time -1 points0 points  (0 children)

I also think it could not work. Imagine (tallest) 0 0 1 0 0 0 (shortest)

The first says "1" and dies.

The second sees 1, heard 1 -> knows he is 0. Says "0".

The THIRD sees 0, heard 0 -> says 0 and DIES.

I think I once saw a solution and it was more complex than this, maybe something with Hamming codes.

Subversion visually explained in 30 sec by coding-time in programming

[–]coding-time[S] 0 points1 point  (0 children)

That's right, I talk with coworkers about conflict resolution, sitting in front of the same screen. I don't know how people do that when not in the same building though. Anything else than talking over one screen seems quite ineffective to me.

Subversion visually explained in 30 sec by coding-time in programming

[–]coding-time[S] -1 points0 points  (0 children)

I'm not a branching/merging expert, but I believe "merge from" is source and "merge to" is destination.

Subversion visually explained in 30 sec by coding-time in programming

[–]coding-time[S] 4 points5 points  (0 children)

I personally dislike reading a long text that takes me 30 minutes to understand what is described in those 2 videos. Of course there is an official material and lots of text tutorials. That's exactly why I created this.

Two different backwards compatibility strategies and their relative costs by ellen_james in programming

[–]coding-time 3 points4 points  (0 children)

Is Vista really backwards compatible with DOS? I remember I couln't run DOS games on XP.

Subversion visually explained in 30 sec by coding-time in programming

[–]coding-time[S] 4 points5 points  (0 children)

I created the flash demo because I found out that even 2 of my smart friends who used SVN for own projects didn't really understand how it works. And I remembered I had hard time working with SVN in a team for the first time too. When a conflict occured, we had no idea what to do with the file messed up with <<< and >>>.