Fichas
Week 9: Backtracking & Stacks/Queues
Fichas del conjunto (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
Información
- Descripción
- (FIT1045: Algorithms & Programming Fundamentals in Python) Computer Science Fichas sobre Week 9: Backtracking & Stacks/Queues, creado por Melina Mackey el 24/10/2019.
- Creado por
- Melina Mackey
- Visitas
- 0
- Historial
-
- Creado por Melina Mackey · 2 sep 2019
- Copiado por Melina Mackey · 2 sep 2019
- Copiado por Melina Mackey · 2 sep 2019
- Copiado por Melina Mackey · 2 sep 2019
- Copiado por Melina Mackey · 16 sep 2019
- Copiado por Melina Mackey · 18 sep 2019
- Copiado por Melina Mackey · 21 sep 2019
- Copiado por Melina Mackey · 24 oct 2019
- Valoración