Careers 2.0 on Stack Overflow is free

Careers 2.0 is a great match for StackOverflow and it will really help employers find the right programmers for the job, plus it provides programmers with an interesting background showing their efforts in StackOverflow answers. “Everything is completely redesigned and rebuilt to look great, work fast,” says Spolsky. Careers 2.0 is free for developers with the catch that you have to be invited by either your peers or a StackOverflow moderator (before anyone with a credit card could sign up). Employers have to pony up $500 for weekly access. n the future, automatic robot recruiters will use mental telepathy and nuclear fusion technology to get people the perfect jobs. When that happens, rest assured that those robots will be wearing Stack Overflow insignia, but until then, Careers 2.0 is a big leap ahead.More...

Interview Questions for Senior and Mid Software Engineers

I found these questions in Scott Hanselman blog. Certainly Scott Hanselman wasn't trying to boil all of .NET Software Development down to a few simple "trivia" questions. However, questions by Scott get folks thinking. Believe that really good ASP.NET (and for that matter, WinForms) is a little more than just draging a control onto a designer and hoping for the best. A good race driver knows his car - what it can do and what it can't. Scott Hanselman say his comments regarding to inteviewing process: "I do a LOT of interviewing here (Microsoft), and for a while we were hiring ASP.NET people.  Here's some of the questions that I asked them.  I came up with these questions because you'd "just know" this stuff if you spent time working on a REAL WORLD ASP.NET site - through design, development, debugging, production debugging, and deployment.". Check these questions out! More...

Big-O (Theta) analysis

A good understanding of big-O analysis is critical to making a good impression with the interviewer. Big-O analysis is a form of run-time analysis that measures the efficiency of an algorithm in terms of the time it takes for the algorithm to run as a function of the input size. It’s not a formal benchmark, just a simple way to classify algorithms by relative efficiency.

In mathematics, computer science, and related fields, big-O notation (also known as big Oh notation, big Omicron notation, Landau notation, Bachmann–Landau notation, and asymptotic notation) (along with the closely related big-Omega notation, big-Theta notation, and little o notation) describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. Big O notation characterizes functions according to their growth rates: different functions with the same growth rate may be represented using the same O notation. More...

Knowing what kind of programmer you are

All programmers are not alike. Knowing what kind of programmer you are is crucial to finding the right kind of job. While you can probably do many different kinds of programming tasks, they won’t all turn your crank in the same manner. Doing something you don’t really enjoy is fine on a short-term basis, but you need to be interested in and excited by what you’re doing to sustain you over the long term. The best programmers are passionate about their work, and you can’t truly be passionate about something that’s only moderately interesting to you. More...

Top 50 facts about Jon Skeet

If you don't know who Jon Skeet is read Jon Skeet facts. There aren't many people in the world that come close to his level of knowledge and passion for C#. In fact he mentioned to me the other day that: "I have a copy of the C# spec on every machine I work on." Jon is currently, by a pretty large margin, the highest-ranking user on Stack Overflow. He's also written a few books on the subject. There is no one, anywhere, that could do a better job on this production. Can Jon Skeet ask a question that even Jon Skeet can't answer? Yes. And he can answer it, too. More...