Search results

Re: HSC 2013 4U Marathon \int_0^\infty \negthickspace \frac{1}{(n+1)\sqrt{n}}\;\text{d}n > \sum_{n=1}^{\infty }\frac{1}{(n+1)\sqrt{n}} $ by a sum-of-rectangles argument$ Substitute u=x+1 into the integral, which evaluates into 2\tan^{-1}(\sqrt{x})\]_0^\infty \rightarrow 2^-. Therefore...

what about computing?! :P

Re: HSC 2013 4U Marathon Sorry bro... 15^20 is also double counting! If you have 2 oranges and 15 people, the answer isn't 2^15, it's 16. I can see what you were trying to do, assign oranges to students, but your method thinks that assigning the second orange to the first student and the...

blasphemy!

Re: HSC 2013 4U Marathon If I understand your solution correctly, you're counting (*, O) as different to (O, *) where * is an orange, whereas these both correspond to a single orange for a single student (i.e. you'd be double-counting)

8-12 reps for hypertrophy. squats > leg press

I'm not asian :P and there are a lot of high schoolers who are really experienced programmers (I assume you're one of them?). They're just hidden away though. There's quite a lot of competition for state ranks in the subject.

Pseudocode is a method for representing the logic of an algorithm. It would not make sense to say "What pseudocode did John try to program?" (and indeed, the answer I expect is the name of an algorithm). "John messed up the pseudocode" would also be misleading, as it suggests the issue is...

SDD is verrrrry different to real life software development...

1. Write an algorithm that takes as input an array of integers and outputs the maximum and minimum values in that array. 2. Write an algorithm that takes as input an array of integers and outputs the sum of all the even-indexed elements in the array (i.e. elements at positions 0,2,4,...) 3...

*nurses his poor 93 physics mark* "there there"

You can test values in each interval, or you can picture the parabola that is concave down (because the coefficient of x^2 is positive) with x-intercepts at x=-9 and x=-1 -- for what x values is the parabola > 0 i.e. above the x-axis?

real roots exist when the discriminent b^2-4ac >=0 i.e. (k+3)^2 - 4(k)(-1) >= 0.

Do you have any examples of questions you can't do? It'll be easier to help you on a concrete case. For all the standard algorithms like the sorts, just think about what they do. * Insertion sort goes through each element sequentially and shifts it backwards until it's in its right position...

The specific names used are interchangeable, so yes, "Index" is like "Count" and "Query" is like "ItemToFind". What do you have trouble with? The pseudocode syntax? Or how to translate an abstract solution into an algorithm? To write one from scratch, think about how you'd carry it out by hand...

Understanding an algorithm? It's pretty much a description of a process, like a recipe. Try to translate it into English in your head. E.g. this is a linear search algorithm Index = 1 Found = FALSE WHILE Index <= Length of Array DO IF Array[Index] = Query THEN PRINT "Found!"...

I got through HSC english with only essay plans. My friend did the same with only memorised responses. We both got 95+. Do what works for you.

I've never seen anyone offering SDD tutoring. Is there anything specific you need help with? Any questions etc? Maybe someone here can answer them.

yes

My school got its 2012 major works back, but mine "has been retained for possible inclusion in young writers showcase". However, I haven't been notified about this at all. Does anyone know anything about this? Does the BOS email us? I'm a bit worried because the email address I used for the HSC...