x Turn on thread page Beta
 You are Here: Home >< Maths

# Aqa D1 Paper!!!!!!!!!! watch

1. Omg! is anyone terrified?! any tips!
I want an A
2. ?????????
3. I did this and got 76 last June, due to completly messing up a 22 MARK linear programming question!

So my tip is linear programming, learn it!
4. (Original post by c0nfus3d)
Omg! is anyone terrified?! any tips!
I want an A
good luck dont rush the exam, take your time but NOt too long make sure you pace yourself well, if you know all the methods you will be fine just dont make the stupid mistakes which come when you rush and dont go through the work consistently. Read the question properly sometimes if you cant work it out and youve finished the other questions confidently, make sure you haveenough time 2 go back. My problem with D1 was time management so i missed out on some marks so yeh good luck.
5. (Original post by EasyTiger)
I did this and got 76 last June, due to completly messing up a 22 MARK linear programming question!

So my tip is linear programming, learn it!
Yeah but that was the hardest linear programming question that's ever been up. I remember those darn widgets.
6. thankyou!
7. Anyone know if it matter which number is on a line when it comes to algorithm psuedo code?

When do you go a line down, ive been looking at past papers and there all different?

Also, shell sort is set out different in some past papers as well, where they make sub lists? HELP
8. I still don't know what a widget is.

Tbh, your lucky im not sittin this one everyone ive sat seems to have changed for the worse so far.

D1 22 mark linear programming question, where the scale didnt even fit the data, M1 AND C3 last friday, immensly different..
9. someone! QUOTE ME- WHAT IS A TOUR?!
10. (Original post by c0nfus3d)
someone! QUOTE ME- WHAT IS A TOUR?!
TOUR - is a path where you visit every VERTEX/NODE once and return to your starting position. Example of a TOUR : ABCDA . A term TOUR is usually used when we talk about "Travelling Salesman" , nearest neighbour algorithm to be precise ( used to find the Upper Bound)
BTW I am doing D1 and D2 this Summer ^^ scaaaaryy , but I am doing every single exercise in the textbook + timed past paper questions, Do you think it's enough to get an A in decision?
11. (Original post by kaosu_souzousha)
TOUR - is a path where you visit every VERTEX/NODE once and return to your starting position. Example of a TOUR : ABCDA . A term TOUR is usually used when we talk about "Travelling Salesman" , nearest neighbour algorithm to be precise ( used to find the Upper Bound)
BTW I am doing D1 and D2 this Summer ^^ scaaaaryy , but I am doing every single exercise in the textbook + timed past paper questions, Do you think it's enough to get an A in decision?

LOL! Bit too late for the info now!
If I can get an A, I'm sure you can!
What you're doing right now sounds great, but just comb through everything finely if you run out of things to revise!
Hope you do well!
12. (Original post by c0nfus3d)
LOL! Bit too late for the info now!
If I can get an A, I'm sure you can!
What you're doing right now sounds great, but just comb through everything finely if you run out of things to revise!
Hope you do well!
"run out of stuff" is actually a matter which concerns me ^^.Well I'am going to do all the textbook exercises for the main coarse and Rest of Exam Papers for desert.
Decision exams are actually not tricky, they just check the techniques and methods however sloppy mistakes can pull you down =P, boundaries are harsh
Hope you did well in your exam =)))
13. (Original post by kaosu_souzousha)
"run out of stuff" is actually a matter which concerns me ^^.Well I'am going to do all the textbook exercises for the main coarse and Rest of Exam Papers for desert.
Decision exams are actually not tricky, they just check the techniques and methods however sloppy mistakes can pull you down =P, boundaries are harsh
Hope you did well in your exam =)))
Couldn't agree more!
I got an A!
14. (Original post by c0nfus3d)
Couldn't agree more!
I got an A!
were there any Linear Programming questions? or Sorting algorihms in the exam
15. (Original post by kaosu_souzousha)
were there any Linear Programming questions? or Sorting algorihms in the exam
both
16. (Original post by c0nfus3d)
both
Just finished D1 book ^^ most of the stuff is quite straightforward, I just hope I don't make any sloppy mistakes hehe well in april gonna selfstudy D2 then loads of past papers in May. My D1 is on 8th of June and D2 on 18th =)))))) and some physics,chemistry in between xDDD
17. So there is already a thread for this!! I have made another but I'm glad I found this anyway. I also want an A for D1 as well; I think I will get it, just find linear programming difficult.

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: May 25, 2010
Today on TSR

### University rankings 2019

Cambridge at number one

### I have imposter syndrome at Cambridge

Poll
Useful resources

Can you help? Study help unanswered threadsStudy Help rules and posting guidelinesLaTex guide for writing equations on TSR

## Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE