Karteikarten
Week 9: Backtracking & Stacks/Queues
Karten in diesem Stapel (8)
- 1N-Queens problem- Input: positive integer n
- Output: all configurations of n queens on an n x n chessboard such that none of them are attacking each other - 2General backtracking approachAdvantage over brute force: does not explore a large number of invalid configurations (once an invalid partial solution is reached, algorithm backtracks)
- 3N-Queens using general backtracking template
- 4Extensive reachability problem (recursive)
- 5StackLinear data structure where you can:
- Only interact with the item on top (LIFO)
- 'Push' something to put it on top
- 'Pop' to take something from the top
- Check the size of the stack - 6Depth-first-search
- 7QueueLinear data structure where you can:
- Only interact with front and rear (FIFO)
- 'Enqueue' something to put it at the end of the queue
- Get the 'next' item from the front of the queue - 8Breadth-first search
Informationen
- Beschreibung
- Computer Science (FIT1045: Algorithms & Programming Fundamentals in Python) Karteikarten am Week 9: Backtracking & Stacks/Queues, erstellt von Melina Mackey am 24/10/2019.
- Erstellt von
- Melina Mackey
- Aufrufe
- 0
- Verlauf
-
- Erstellt von Melina Mackey · 2 Sep 2019
- Kopiert von Melina Mackey · 2 Sep 2019
- Kopiert von Melina Mackey · 2 Sep 2019
- Kopiert von Melina Mackey · 2 Sep 2019
- Kopiert von Melina Mackey · 16 Sep 2019
- Kopiert von Melina Mackey · 18 Sep 2019
- Kopiert von Melina Mackey · 21 Sep 2019
- Kopiert von Melina Mackey · 24 Okt 2019
- Bewertung