You are Here: Home >< Maths

# AQA D1 Question

Announcements Posted on
Why bother with a post grad? Are they even worth it? Have your say! 26-10-2016
1. How do you solve June 15 question 3d
2. Another one:
june 15 5b
3. June 15 question 7 too
4. 3D: The bubble sort algorithm has О(n2) complexity. Find the maximum total number of comparisons. In other words, the worst case scenario. The worst case scenario = [n(n-1)/2]. In this case n=16. so the we have 16(15)/2 = 240/2 = 120

7a:

7b:

7c:
The graph is eulerian implies that each vertex has an even order. An example of such a graph is below:

I can't help with 5b unfortunately as I have only just started D2/C, but I hope that helps ^_^
5. (Original post by fpmaniac)
Another one:
june 15 5b
If you have done 5a correctly, you will see that your repeated routes are AG and BC
To get to A-G, you have to go through D so what i do is highlight that repeated route (theres 2. A-D D-G)
Then highlight the BC repeated route.
What i usually do is count the Degree of the Vertex and divide by 2.
For D. you have 4 ways to get to D + the other 2 you have just drawn on= 6
6/2=3
for C, you have a degree of 5 + 1 repeated route (BC)=6
6/2=3

## Register

Thanks for posting! You just need to create an account in order to submit the post
1. this can't be left blank
2. this can't be left blank
3. this can't be left blank

6 characters or longer with both numbers and letters is safer

4. this can't be left empty
1. Oops, you need to agree to our Ts&Cs to register

Updated: June 24, 2016
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:
Today on TSR

### Who is getting a uni offer this half term?

Find out which unis are hot off the mark here

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read here first

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams