• Congratulations to the Class of 2024 on your results!
    Let us know how you went here
    Got a question about your uni preferences? Ask us here

Search results

  1. S

    Calculating Transmission Speeds

    Be careful with your terms, bandwidth refers to the range of frequencies a signal occupies. It is related to speed, but it is definitely NOT a measure of speed. Post the question you speak of?????
  2. S

    is there a program...

    You can add other files and folders using the P&D Wizard.... From memory, early in the wizard it shows a list of all the included files. Use the add button to add all your help files (or any files for that matter). At a latter stage it asks you to confirm the install path for each file. At...
  3. S

    Half Yearly Revision Questions

    Tenosynovitis is inflammation of the lubricating sheath surrounding all tendons. This condition can occur to any tendon. In the case of carpal tunnel syndrome, tenosynovitis occurs to the sheaths surrounding the tendons within the carpal tunnel. As the carpal tunnel is composed of bones it...
  4. S

    heinemann IPT txtbook and a bit of encouragement

    My IPT Prelim Text is not yet available. Should be out in about 6 weeks. There are some sample chapters available at www.pedc.com.au
  5. S

    ALgorithm problem

    Next really is a temp variable, now look at these lines: set Next to data at PositionOfNext Do all the shuffle stuff, which will likely overwrite the data at PositionOfNext set data at Current to Next The result being that the data held in the array element with index...
  6. S

    Differences between Selection and Insertion Sorts

    BEGIN SelectionSort Pass = 1 (Initialise Pass, we use Pass to track the number of items we have correctly sorted; we're just about to sort the first item. Also Pass identifies the first item in the unsorted part of the array. In this algorithm the array is indexed from 1, so Pass is...
  7. S

    Schema and Schematic Diagram

    In terms of database design, a schema is an ERD; they are one and the same. The whole point of relational DBs is to reduce duplicate data. For example think about a flat file version of your above schema... The teachers names need to be entered for every class they teach, hang on, actually...
  8. S

    Differences between Selection and Insertion Sorts

    When performing both selection and insertion sorts within a single array, part of the array (commonly the LHS) holds the elements already sorted. The rest (usually the RHS) holds the items waiting to be sorted. Selection sort (ascending): 1. Initially the sorted part is empty. 2. Perform a...
  9. S

    paradigms

    I'm not sure what this question has to do with paradigms???
  10. S

    Algorithm Help

    Heaps better! Your in Band 5 now!! To get into Band 6 consider the following: 1. You don't need to define data structures in algorithms, so trash that line. 2. Your PlayerScore(Server)=0 is vague. You should initialise both PlayerScores explicitly. ie. PlayerScore(0)=0 and...
  11. S

    Algorithm Help

    If you use an array then Player1Score and Player2Score could become PlayerScore(Server) where Server is either 0 or 1. Now you can toss the coin and if Head then Server=0 else Server=1. The question asks to "describe how to score a ball game", so its unecessary to have this repeat loop at all...
  12. S

    Algorithm Help

    1. What's the point of the INITIALISE Variables line, its irrelevant as this is what the next two lines do. 2. What does Coin Toss mean, presumably determines who serves. You need to detail this somehow. 3. What does Play game mean when it's within a loop. Seems to me this inside Repeat is...
  13. S

    ALgorithm problem

    Yes it does overlap, however this is OK because the data item being inserted has first been stored in Next. This data item is shoved into its correct position after the appropriate shuffle (or lack of shuffle) has happened in the inside loop. In essence the variable Next is being used as the...
  14. S

    Integration problem

    Oops... Thanks Keypad... I got c wrong... Will edit my post...
  15. S

    easy question (that i can't solve)

    Yeah great, but I'd suggest a little more explanation is in order, this is not an Ext1 or 2 forum! (x+2)/(1-x)<1 Firstly x<>1 (to avoid division by 0). Multiply by the square of the denominator as this ensures we are multiplying by a positive number and hence the inequality sign is not...
  16. S

    easy question (that i can't solve)

    RyddeckerSMP: should have been -1/2 not 1/2 An alternate solution... (x+2)/(1-x)<1 Firstly x<>1 Can't have 0 denominator (<> means does not equal) Now when the denominator is +ve then 1-x>1 x<1 ....(1) And... x+2<1-x x<-1/2 ...(2) (1) and (2) are both true only when...
  17. S

    inverse trig problem

    No she doesn't do SDD or IPT, apart from MSN messenger, computers really don't interest her in the slightest! She is using this site, her username is Louisey!, so help her out, particularly with English. I haven't got a clue about how to help her with English! I think it's pretty reasonable...
  18. S

    inverse trig problem

    I was a Maths teacher also... however it's been more than 10 years since I ever looked at any 3Unit Maths stuff. My daughter's doing the HSC this year, so I'm also doing a bit of a brush up! Sam
  19. S

    inverse trig problem

    This is a standard integral so... LHS=arctan x from 3/5 to 4 = arctan 4 - arctan 3/5 Let u=arctan 4 so tan u =4 Let v=arctan 3/5 so tan v=3/5 Sort of looks like we can use the expansion for tan(a-b) using u and v rather than a and b Which is.... tan(u-v)=(tan u + tan...
  20. S

    Integration problem

    I haven't done this stuff for ages, but here goes.... First get y' into a form we can differentiate... y'=2^-x lny'=ln(2^-x) lny'=-x ln2 y'=e^(-xln2) Differentiate this sucker, seems strange but it helps... y''=-ln2.e^(-xln2) = -ln2.2^(-x) This means that... Integral...
Top