Jump to content

KayS

Senior Members
  • Posts

    33
  • Joined

  • Last visited

Everything posted by KayS

  1. I appreciate that there may be some visually impaired users. But, this question has diagrams and I found no possible way to display the question. Therefore, I have given a link to the question so I don't offend anyone and whoever can help me go through the question I would appreciate it if you could have a look at the question. http://tinypic.com/r/2livns7/8(I have also attached the file, sorry but I just couldnt draw the diagrams but any quesiton that can b written i will.) The question is regarding Huffman coding, The answer I chose Was A because according to huffman coding you have to sort the frequency by lowest to highest and then take the two lowest out as leaves at the bottom of the tree and start with the highest frequency at top, the one that resembles this description is A, as H & N have the lowest in frequency. Please let me know what you think.
  2. KayS

    Pseudocode

    sorry i meant to write 1000 and it seems to be that C is the best would you agree? because C 13*1000 +62 whereas D 1000(2) ... C returns a lower interger meaning it would be more efficent to process
  3. Hi, everyone the year has ended I finished my 2nd year at University. I was just going over my Subject Knowledge by doing quizzes, practice tests etc on my University site. However, there servers are messed up so I cant download the mark scheme and I don't know if my answers are correct so I'm going to post the question up and give my reasoning behind my answer and you could tell if I'm correct and what the correct answer would be. I have chosen C as the answer as when you give n = 100 it returns the lowest interger meaning that the less amount of data that needs to be processed by the algorithm meaning its would be the fastes. Please let me know if you agree
  4. KayS

    Pseudocode

    Hi, everyone the year has ended I finished my 2nd year at University. I was just going over my Subject Knowledge by doing quizzes, practice tests etc on my University site. However, there servers are messed up so I cant download the mark scheme and I don't know if my answers are correct so I'm going to post the question up and give my reasoning behind my answer and you could tell if I'm correct and what the correct answer would be. I have chosen C as the answer as when you give n = 100 it returns the lowest interger meaning that the less amount of data that needs to be processed by the algorithm meaning its would be the fastes. Please let me know if you agree
  5. hmm ... i think im going to have to wait till next week once reading week is over to ask my supervisor the suspense is killing me lolol
  6. loooooooooool =] thanks for the response's Im so confused on this data protection act quesiton.. i think 1 2 & 3 all would be exempt hmm... quiet confusing lol any other links on exemption after reading the Article I think the answer would be D 1) && 2)...because at the end of the day in 3) they are using personal data...which in actual fact has to be registered to the commissioner. If someone could challenge me, in why my thinking is wrong or if someone would agree with me would help me =]
  7. I am a first year student...3 months into my course I have been give a practice test and im stuck on two questions, however I have a rough idea of what the answers are Firstly: quesiton 14 : answer is B... the problem lies in line 2 because it says they must add all contents in mem location 7,8 & 3 but here it just uses the funciton LOAD 8 which actually replaces the LOAD 7..I think im right the statement should be LOAD 7 ADD 8 ADD 3 STORE 21 the second question is The answer I got is: C : because under the DPA the exemptions clearly state: "Domestic purposes. Processing by an individual only for the purposes of that individual's personal, family or household affairs is exempt" however i could be totally wrong anyone with any suggestions on my answers?
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.