Now when you say Logic and reasoning, can you tell me more little bit more on it?
Here in US, they say i would have to take calculus, trigonometry, pre-calculus to major in computer scince.
See, the thing is Computer Science is not the same as Information Tech. To do most of the shitty enterprise programming, most of your work will be centered around objects and methods (OR VARIANTS). Most of the stuff is very well encapsulated. That's IT, that's application for you.
But what about Computer Science. We recently recruited a C programmer for our company. One of the main questions on the test was this :
Write a program that outputs all prime numbers from 1-10000.
Simple, no?
Well, almost everyone answered that one, but we selected only one guy. How? because only that one guy had a good answer. Here was the logic behind his solution.
let c be a composite number such that p*q = c, then q*p must also be equal to c. Also, if p < sq.root(c), then q > sq.root(c). If both of them are greater than sq.root(c), the product will be bigger than c, likewise if both are lesser than sq.root(c), the product will less than c.
So basically, to check if a number between 100-10000 is prime, all we need to do is check if its divisible by a prime number from 1-100, because if it's not, it will also not be divisible by a prime number from 100 to 10000. Likewise, to generate the prime numbers from 10-100, only need to check against primes from 1-10.
In implementation, this is what that looks like.
2 is prime -> list.
3 is prime ->
for numbers from 3-9, only check against 2. So 5 is prime, 7 is prime.
for numbers from 9 to 25, only check against 2 and 3
for numbers between 25 and 49, only check 2,3,5.
for numbers between 49 and 121, only check 2,3,5,7.
and so on!
Basically ALL this math. Now that I've done the math for you, even a noob can write a C-program to solve it.
This is just a SIMPLE problem.
read my post above for guidance, dont worry math wasnt my strongest subject also lol
