100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Summary Computer Science OCR A Level Last Minute Cram Notes £6.49   Add to cart

Summary

Summary Computer Science OCR A Level Last Minute Cram Notes

 11 views  0 purchase
  • Institution
  • OCR

Inspiration for your revision, plus detailed descriptions of key terms and concepts that come up in the A level

Last document update: 1 year ago

Preview 1 out of 7  pages

  • August 29, 2023
  • August 29, 2023
  • 7
  • 2023/2024
  • Summary
All documents for this subject (11)
avatar-seller
shiningstar2
A* 1. Set all distances to infinity, except the start node, which is set to 0
2. Add heuristic values to the table
3. Set start node as current node.
4. Add current node to the “open” list
5. Visit neighbours of this node, if distance from start is less than what is
currently in the table, update their distances from start, f distance and previous
node.
a. Note that f distance only includes the single heuristic distance of the single node
you are calculating for, but all the distances from start up to that node.
6. Add any neighbours not yet visited until now, into the open list – a priority
queue
7. Add current node to closed list, remove it from the open list
8. Set the node with the shortest f distance in the Open list as the current node
9. Repeat from step 4 until end node has been added to the closed list.

Node Distance from Heuristic F distance Previous node
start distance (g+h)
A 0 9
B ∞ 4
C ∞ 56 3 59 A
D ∞ 0
Dijkstra 1. Set all distances to infinity, except the start node, which is set to 0
2. Set start node as current node.
3. Add current node to the “open” list
4. Visit neighbours of this node, if distance from start is less than what is
currently in the table, update their distances from start and previous node.
5. Add any neighbours not yet visited until now, into Open – a priority queue
6. Add current node to closed list, remove it from the open list
7. Set the node with the shortest distance in the Open list as the current node
8. Repeat from step 3 until every node has been visited, and so the shortest path has
been found.

Node Distance from start Previous node
A 0
B ∞
C ∞ 56 A
D ∞

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller shiningstar2. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £6.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67474 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£6.49
  • (0)
  Add to cart