OCR A-level Computer Science Paper 2 (H446/02) - 19th June 2023 [Exam Chat]

Praying for lots of OOP, IDEs, sorting algorithms, optimization algorithms, graph traversal the rest of the spec can go to hell lmfaoo

Reply 85

elliotplum

For A* path finding will we be given the values for heuristics, If not can someone please explain how to find the values for the heuristic to put into the table when given the weight of the branches?

(edited 10 months ago)

Reply 86

elliotplum

Original post by atflyy

Praying for lots of OOP, IDEs, sorting algorithms, optimization algorithms, graph traversal the rest of the spec can go to hell lmfaoo

What are optimization algorithms?

Reply 87

Original post by elliotplum

What are optimization algorithms?

A* and dijkstra algorithm are the only optimization algorithms you need to know

Reply 88

Original post by elliotplum

For A* path finding will we be given the values for heuristics, If not can someone please explain how to find the values for the heuristic to put into the table when given the weight of the branches?

You will be given the heuristic values alongside corresponding graph nodes. The heuristic values represent an estimate of the distance from that node to the end node.

Reply 89

elliotplum

Original post by Kingemperor07

You will be given the heuristic values alongside corresponding graph nodes. The heuristic values represent an estimate of the distance from that node to the end node.

Also in answers to these questions i have seen longer routes that have been crossed out is this necessary to do for full marks

Reply 90

Mr_Yoshi

6

Original post by elliotplum

Also in answers to these questions i have seen longer routes that have been crossed out is this necessary to do for full marks

i would imagine so because those longer routes are what the algorithm originally gets and then later finds something quicker. otherwise filling in final results wouldn't need any algorithm you can just fill them in by inspection

Reply 91

Original post by elliotplum

Also in answers to these questions i have seen longer routes that have been crossed out is this necessary to do for full marks

Depends on the algorithm, if it's a question on Dijkstra, then I would explore every single node so that you guarantee the shortest path.
For A*, stop once you've created a path to the end node; A* doesn't require the "shortest" path but a good enough path, therefore you will not need to go through every route to get the full marks.

Reply 92

astar1212

are you sure, what about his bonus predictoin? i think its legit his predictions

Reply 93

BigManBenjamin

Im geuinely loosing it, Im having dreams about the mark scheme and psuedocode. I've never in my life been so terrified of an exam.

Reply 94

gogetter2k19

5

Original post by BigManBenjamin

Im geuinely loosing it, Im having dreams about the mark scheme and psuedocode. I've never in my life been so terrified of an exam.

chill out bro they are just questions written on a piece of A4 paper stapled together

Reply 95

Original post by BigManBenjamin

Im geuinely loosing it, Im having dreams about the mark scheme and psuedocode. I've never in my life been so terrified of an exam.

Why so dramatic? It's not like the exam is trying to murder you.

Reply 96

BigManBenjamin