Jump to content

David Kroell

Members
  • Content Count

    23
  • Joined

  • Last visited

Community Reputation

6 Recognised

Profile Information

  • Gender
    Male
  • Exams
    May 2014
  • Country
    United States
  1. No way! They couldn't give us a spec paper that was more like this exam then?
  2. So you coded a stack just for this? Pretty impressive, under that time limit. I think the examiners should take it, as long as it does it there is no reason for them not to, and tbh even if you missed 40 marks you'd get 60%, so there is no way you got lower than a 6 I think (if a 6 is not >60%, not sure about that). Well I didn't really code the entire stack. I followed what the flow chart stated, that it would draw H in the center and if H was in the center and the stack was empty, it would break the loop and output yes or something like that. I used the syntax pop, from the data booklet. They should really let us have a pseudocode data bookelt in the exam.
  3. Don't worry, there is no penalty for writing in java or anything. you need to write it in a higher level language, that's all. Syntax has no bearing on the marks you get. It's all Computational thinking and logic.
  4. You guys seem to know you're stuff. It's been a privilege to be one of the first computer Sceince Student along with you. Good luck! Paper 2 tomorrow. Databases! Yay! NOT!!!
  5. I found the Queue the hardest one not because the thing itself was hard, but because I couldn't wrap my head around what they wanted. They said they wanted code to do that stuff, but I was thinking that the whole code is run when he flicks the lever, but that makes no sense since that would reload everything in the queue again instead. I did decide to do two methods later on but I didn't finish that as I went back to it in the end The H thing was really weird, but in the end I did a recursive sequence with the base case being size = 5, which would have been when the size was divided by 2 twice, so three generations or something like that. They then asked how you would do it recursively... so idk if I did it weirdly Linked List I used a simple diagram with the boxes, pointers and nodes, showing stuff with temporary pointers and all. An extranet was sort of like a part of a company's intranet made available to its customers/public or something. It gives partial or limited access to it. I think the grade boundaries will be <75 anyway for a 7, so it shouldn't go too bad. It was 69% last year, and considering we have a new syllabus it may even go lower. I used a while true loop for the H. When I had to do it two three generations after I just looped the entire thing 3 times over the other loop. Thus like you said, a nested loop. loop from 0 to 3 loop while true if Stack is not empty H.pop(Stack) else break; end if end loop end loop I did something like that for the 3 generations. According to what Ive said, do you think I did well, the great thing about this exam is that the grade boundaries shouldn't change much. I don't know if we should have done a recursive method for it. Because, they specified a single thread of code would be necessary. They then later on asked us how we would implement it as a recursive method. I said because every generation is the same size as the H before it , it mimics the code. They pointed that out clearly in the instructions when presenting the other code. I couldn't really understand what all that code was there for. Oh well, this was a blow out. Been feeling really depressed the last couple of days. Computer Sceince was something I was good at…
  6. I found the Queue the hardest one not because the thing itself was hard, but because I couldn't wrap my head around what they wanted. They said they wanted code to do that stuff, but I was thinking that the whole code is run when he flicks the lever, but that makes no sense since that would reload everything in the queue again instead. I did decide to do two methods later on but I didn't finish that as I went back to it in the end The H thing was really weird, but in the end I did a recursive sequence with the base case being size = 5, which would have been when the size was divided by 2 twice, so three generations or something like that. They then asked how you would do it recursively... so idk if I did it weirdly Linked List I used a simple diagram with the boxes, pointers and nodes, showing stuff with temporary pointers and all. An extranet was sort of like a part of a company's intranet made available to its customers/public or something. It gives partial or limited access to it. I think the grade boundaries will be <75 anyway for a 7, so it shouldn't go too bad. It was 69% last year, and considering we have a new syllabus it may even go lower. I used a while true loop for the H. When I had to do it two three generations after I just looped the entire thing 3 times over the other loop. Thus like you said, a nested loop. loop from 0 to 3 loop while true if Stack is not empty H.pop(Stack) else break; end if end loop end loop I did something like that for the 3 generations. According to what Ive said, do you think I did well, the great thing about this exam is that the grade boundaries shouldn't change much.
  7. I put two methods as well for the queue. one for enqueuing and one for dequeueing. Stupid me though I think I go my front and rear pointers mixed up. … Binary tree said they wanted it in alphabetical order, so you're good. How did you do for the H one? did you use a while true loop like I did. I had a friend who used a boolean operator for the vehicles queue to simulate the flicking and such...
  8. Well, I think that section A was okay, it was fair, except for that Autonomous agent stuff. No idea… Algorithms I did my best on. Queues we had to know, and I memorized pseudo code for a queue that I just blotted down. A separate block of code for enqueuing and a separate one for dequeuing when the channel was flicked. although may have gotten my front and rear pointers mixed up. Which ever way, I thin that question was good. may have lost a few marks for the mix up of pointers. Then we had that 'H' thing. What was that!!! I tried my best to follow it, it was so confusing. I put a loop counter while true to simulate the progression to the center of the screen and used a stack algorithm in pseudocode that again, I memorized from my notes. I had a real dedicated teacher. I then drew an H with the side being 40 and bottom being 20, and I said that the permutation of H at 3 generations was 16 from 0 to 3 meant 4 endpoints squared. I got 16 for that one. I looped my original code for the drawing of H in the flow chart from 0 to 3 to represent H and 3 generations after that. Tried my best again on that one. Then we had the nice questions with the binary trees and the sorting, I feel really bad though I didn't finish the 9 ark question completely. Really worried about that. Kind of freaking out… I got David fro the fifth stop said it was 5 euros. I sorted the binary tree alphabetically from Carlos Station. What did you guys say for the linked list one. That was a great question but I only had two main sections of appending the table by adding the item to the bottom of the linked list and appending the ext node from the side as well. SaaS - That question was nice… What was Extranet… I know VPN, but what's extranet??? All in all I'll be disappointed if I get below a 5 on this exam. Didn't really go the way I was expecting it to. Please someone give me feedback, this is my major in University for crying out loud!!! I did the best I could.
  9. hi i did that at first, but i realised it wasnt an integer. so basically i dont think you need to. since you had s2 you know that u2 is s2 - u1 did you do that? and what did all of you write for the general expression? i just added the arithmetic sequence with u1=1 d=3 to the geometric one with u1=k r=2 or sth Safe to say, I messed up on that one, my brain wasn't functioning properly then (started with section B). Ah well, aiming for that 5. i wrote it the other way around because f''(-2) was negative? since f'(x) was decreasing so i had f(-2)<F'(6)<f(0) I figured out an expression for Un in the sequence. I said something like… Un=(1+K)+3(n-1)+(K x 2n-1)-K ... Very well could have been wrong… Kind of like what you were saying with an arithmetic and geometric expression hybrid…
  10. Well, if you actually did make a mistake, and you showed working, you can get a mark for correct reasoning, as well as the godsend of error carrying. That saved my ass in more than one past paper.
  11. So the grade boundaries might become even harder than they are now? What is it? 74% for a 6?
  12. I found the gradient was 2/3 I found the gradient as 2/3 too, as gradient is change in y over change in x Yeah it was 3 seconds for Jack and Ryan's aeroplanes I don't know about the last question, I've had 3 exams since this paper and haven't really dwelled on it much! YES!!! I Wasn't sure about that question. I found the time that it took each plane to reach a height of 20, and I subtracted 7 and 4!!! I equated them both to the collision point, found s and t and then found the difference same here! what did you find for the height of plane after 2 sec. (it was the second question of exercise 9) I subtracted 7 and 4, So I got 3 seconds. and th height of the plane after two seconds I believe I got 10, if my memory serves.
  13. I found the gradient was 2/3 I found the gradient as 2/3 too, as gradient is change in y over change in x Yeah it was 3 seconds for Jack and Ryan's aeroplanes I don't know about the last question, I've had 3 exams since this paper and haven't really dwelled on it much! YES!!! I Wasn't sure about that question. I found the time that it took each plane to reach a height of 20, and I subtracted 7 and 4!!!
  14. I found square root of 65 Yeah! Got that too! You had to know a lot of stuff for that question. If you didn't get the U-Substitution earlier, you weren't going to get it.
  15. You had to do integration by U-Substitution. You had to substitute u for x^2+5 and you had to differentiate U, redefine dx, and cancel out the 2x as the numerator. from that point it was a simple integration rule that the integral was ln(x^2+5)
×

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.