100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
CO2412 Computational Thinking Lecture 8 Notes CA$6.35   Add to cart
Quickly navigate to
Preview
  2.  
  3. University Of Central Lancashire Preston (UClan)
  4.  
  5. Computational Thinking (CO2412)

Class notes

CO2412 Computational Thinking Lecture 8 Notes
 11 views  0 purchase
  • Course
  • Computational Thinking (CO2412)
  • Institution
  • University Of Central Lancashire Preston (UClan)

This document contains comprehensive notes from Lecture 8 of the CO2412 course on Computational Thinking. The lecture focuses on the concept of backtracking, a powerful problem-solving technique that incrementally builds solutions and backtracks when constraints are violated.

Preview 1 out of 3  pages

Document information

  • August 20, 2024
  • 3
  • 2023/2024
  • Class notes
  • Amin amini
  • All classes

Subjects

  • computer science
  • computational
  • python
  • algorithms
  • university
  • computer
  • 2nd year
  • efficiency
  • lecture
  • cs
  • notes

Written for

  • University of Central Lancashire Preston (UClan)
  • Unknown
  • Computational Thinking (CO2412)
All documents for this subject (19)

Seller

avatar-seller
BpoBpo

Reviews received

Content preview

CO2412: Computational Thinking
Lecture 8

Backtracking
1. Introduction to Backtracking
o Backtracking is a problem-solving approach that builds solutions
one piece at a time and discards those that do not meet the
problem's constraints.
o In the worst case, the time complexity may be O(n²), but the best
and average cases are often significantly better.
o Backtracking is often implemented recursively, referred to as
recursive backtracking.
Simple Backtracking - A Walkthrough
1. Problem Space Representation
o The problem space consists of states (nodes) and actions (paths
leading to new states). When in a node, you can only see paths to
connected nodes.
o If a node leads to failure, the algorithm backtracks to its "parent"
node and tries other alternatives. If all alternatives lead to failure,
further backtracking is necessary.
Example: Sudoku Problem
1. Sudoku Problem Definition
o Sudoku is a 9x9 grid with some numbers pre-filled. The goal is to
fill the grid so that each row, column, and 3x3 mini-grid contains all
digits from 1 to 9 without repetition.
2. Brute Force Approach to Sudoku
o The brute force approach tries all possible combinations until it
finds one that works. This method is not sophisticated but can be
effective due to the computational speed of modern computers.
Steps in the Brute Force Approach:
o If no open cells are left, the puzzle is solved.

o Scan the grid from left to right, top to bottom, for the first open cell.

o Cycle through digits 1 to 9 and place them in the cell if the setup
remains legal.

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 or Stuvia-credit 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 BpoBpo. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for CA$6.35. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67096 documents were sold in the last 30 days

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

Start selling
CA$6.35
  • (0)
  Add to cart