Finish your current degree, work on projects on the side, and read the more technical things discussed here on HN. Not all these will ever be relevant, but the

Finish your current degree, work on projects on the side, and read the more technical things discussed here on HN. Not all these will ever be relevant, but they indicate your level of ability and your areas of interest. Do you know what the time complexity is of Quicksort, and why? Worst case? Best case? What about Heap sort? Do you know how to use regular expressions? Could you write a parser for lisp? Can you write a recursive fibonacci function? Imperative? Can you find the shortest path in a graph? Can you calculate the diameter of a graph? Its radius? Can you compute in a random permutation of n elements the probability of a cycle of length k, when 2k>n? Does that question make sense to you? Do you know the difference between inner-, outer-, left- and right- joins? Do you understand the implications? Chase down which of these interest you, and put them into practice. If you are knowledgable and have example code to demonstrate, it actually helps if your degree subject isn't CS. Sometimes. (some further questions added in edit)