Home

Welcome to the pythonds wiki!

To translate, use poedit locale/es/LC_MESSAGES/... (replace ... with the proper filename for chapter/section)

Spanish Translation tracking

(section, file, github user, progress)

• Index: index.po reingart 100%
• Assignments: assignments.po reingart 0%`

1. Introduction: Introduction/toctree.po

• 1.1. Objectives: Introduction/Objectives.po
• 1.2. Getting Started: Introduction/GettingStarted.po
• 1.3. What Is Computer Science?: Introduction/WhatIsComputerScience.po
• 1.4. What Is Programming?: Introduction/WhatIsProgramming.po
• 1.5. Why Study Data Structures and Abstract Data Types?: Introduction/WhyStudyDataStructuresandAbstractDataTypes.po
• 1.6. Why Study Algorithms?: Introduction/WhyStudyAlgorithms.po
• 1.7. Review of Basic Python: Introduction/ReviewofBasicPython.po
• 1.8. Getting Started with Data: Introduction/GettingStartedwithData.po
• 1.9. Input and Output: Introduction/InputandOutput.po
• 1.10. Control Structures: Introduction/ControlStructures.po
• 1.11. Exception Handling: Introduction/ExceptionHandling.po
• 1.12. Defining Functions: Introduction/DefiningFunctions.po
• 1.13. Object-Oriented Programming in Python: Defining Classes: Introduction/ObjectOrientedProgramminginPythonDefiningClasses.po
• 1.14. Summary: Introduction/Summary.po
• 1.15. Key Terms: Introduction/KeyTerms.po
• 1.16. Discussion Questions: Introduction/DiscussionQuestions.po
• 1.17. Programming Exercises: Introduction/ProgrammingExercises.po

2. Analysis: AlgorithmAnalysis/toctree.po

• 2.1. Objectives: AlgorithmAnalysis/Objectives.po
• 2.2. What Is Algorithm Analysis?: AlgorithmAnalysis/WhatIsAlgorithmAnalysis.po
• 2.3. Big-O Notation: AlgorithmAnalysis/BigONotation.po
• 2.4. An Anagram Detection Example: AlgorithmAnalysis/AnAnagramDetectionExample.po
• 2.5. Performance of Python Data Structures: AlgorithmAnalysis/PerformanceofPythonDataStructures.po
• 2.6. Lists: AlgorithmAnalysis/Lists.po
• 2.7. Dictionaries: AlgorithmAnalysis/Dictionaries.po
• 2.8. Summary: AlgorithmAnalysis/Summary.po
• 2.9. Key Terms: AlgorithmAnalysis/KeyTerms.po
• 2.10. Discussion Questions: AlgorithmAnalysis/DiscussionQuestions.po
• 2.11. Programming Exercises: AlgorithmAnalysis/ProgrammingExercises.po

3. Basic Data Structures: BasicDS/toctree.po

• 3.1. Objectives: BasicDS/Objectives.po
• 3.2. What Are Linear Structures?: BasicDS/WhatAreLinearStructures.po
• 3.3. What is a Stack?: BasicDS/WhatisaStack.po
• 3.4. The Stack Abstract Data Type: BasicDS/TheStackAbstractDataType.po
• 3.5. Implementing a Stack in Python: BasicDS/ImplementingaStackinPython.po
• 3.6. Simple Balanced Parentheses: BasicDS/SimpleBalancedParentheses.po
• 3.7. Balanced Symbols (A General Case): BasicDS/BalancedSymbols(AGeneralCase).po
• 3.8. Converting Decimal Numbers to Binary Numbers: BasicDS/ConvertingDecimalNumberstoBinaryNumbers.po
• 3.9. Infix, Prefix and Postfix Expressions: BasicDS/InfixPrefixandPostfixExpressions.po
• 3.10. What Is a Queue?: BasicDS/WhatIsaQueue.po
• 3.11. The Queue Abstract Data Type: BasicDS/TheQueueAbstractDataType.po
• 3.12. Implementing a Queue in Python: BasicDS/ImplementingaQueueinPython.po
• 3.13. Simulation: Hot Potato: BasicDS/SimulationHotPotato.po
• 3.14. Simulation: Printing Tasks: BasicDS/SimulationPrintingTasks.po
• 3.15. What Is a Deque?: BasicDS/WhatIsaDeque.po
• 3.16. The Deque Abstract Data Type: BasicDS/TheDequeAbstractDataType.po
• 3.17. Implementing a Deque in Python: BasicDS/ImplementingaDequeinPython.po
• 3.18. Palindrome-Checker: BasicDS/PalindromeChecker.po
• 3.19. Lists: BasicDS/Lists.po
• 3.20. The Unordered List Abstract Data Type: BasicDS/TheUnorderedListAbstractDataType.po
• 3.21. Implementing an Unordered List: Linked Lists: BasicDS/ImplementinganUnorderedListLinkedLists.po
• 3.21.1. The : BasicDS/ImplementinganUnorderedListLinkedLists.po#the-node-class
• 3.21.2. The : BasicDS/ImplementinganUnorderedListLinkedLists.po#the-unordered-list-class
• 3.22. The Ordered List Abstract Data Type: BasicDS/TheOrderedListAbstractDataType.po
• 3.23. Implementing an Ordered List: BasicDS/ImplementinganOrderedList.po
• 3.23.1. Analysis of Linked Lists: BasicDS/ImplementinganOrderedList.po#analysis-of-linked-lists
• 3.24. Summary: BasicDS/Summary.po
• 3.25. Key Terms: BasicDS/KeyTerms.po
• 3.26. Discussion Questions: BasicDS/DiscussionQuestions.po
• 3.27. Programming Exercises: BasicDS/ProgrammingExercises.po

4. Recursion: Recursion/toctree.po

• 4.1. Objectives: Recursion/Objectives.po
• 4.2. What Is Recursion?: Recursion/WhatIsRecursion.po
• 4.3. Calculating the Sum of a List of Numbers: Recursion/pythondsCalculatingtheSumofaListofNumbers.po
• 4.4. The Three Laws of Recursion: Recursion/TheThreeLawsofRecursion.po
• 4.5. Converting an Integer to a String in Any Base: Recursion/pythondsConvertinganIntegertoaStringinAnyBase.po
• 4.6. Stack Frames: Implementing Recursion: Recursion/StackFramesImplementingRecursion.po
• 4.7. Introduction: Visualizing Recursion: Recursion/pythondsintro-VisualizingRecursion.po
• 4.8. Sierpinski Triangle: Recursion/pythondsSierpinskiTriangle.po
• 4.9. Complex Recursive Problems: Recursion/ComplexRecursiveProblems.po
• 4.10. Tower of Hanoi: Recursion/TowerofHanoi.po
• 4.11. Exploring a Maze: Recursion/ExploringaMaze.po
• 4.12. Dynamic Programming: Recursion/DynamicProgramming.po
• 4.13. Summary: Recursion/Summary.po
• 4.14. Key Terms: Recursion/KeyTerms.po
• 4.15. Discussion Questions: Recursion/DiscussionQuestions.po
• 4.16. Glossary: Recursion/Glossary.po
• 4.17. Programming Exercises: Recursion/pythondsProgrammingExercises.po

5. Sorting and Searching: SortSearch/toctree.po

• 5.1. Objectives: SortSearch/Objectives.po
• 5.2. Searching: SortSearch/searching.po
• 5.3. The Sequential Search: SortSearch/TheSequentialSearch.po
• 5.4. The Binary Search: SortSearch/TheBinarySearch.po
• 5.5. Hashing: SortSearch/Hashing.po
• 5.6. Sorting: SortSearch/sorting.po
• 5.7. The Bubble Sort: SortSearch/TheBubbleSort.po
• 5.8. The Selection Sort: SortSearch/TheSelectionSort.po
• 5.9. The Insertion Sort: SortSearch/TheInsertionSort.po
• 5.10. The Shell Sort: SortSearch/TheShellSort.po
• 5.11. The Merge Sort: SortSearch/TheMergeSort.po
• 5.12. The Quick Sort: SortSearch/TheQuickSort.po
• 5.13. Summary: SortSearch/Summary.po
• 5.14. Key Terms: SortSearch/KeyTerms.po
• 5.15. Discussion Questions: SortSearch/DiscussionQuestions.po
• 5.16. Programming Exercises: SortSearch/ProgrammingExercises.po

6. Trees and Tree Algorithms: Trees/toctree.po

• 6.1. Objectives: Trees/Objectives.po
• 6.2. Examples of Trees: Trees/ExamplesofTrees.po
• 6.3. Vocabulary and Definitions: Trees/VocabularyandDefinitions.po
• 6.4. List of Lists Representation: Trees/ListofListsRepresentation.po
• 6.5. Nodes and References: Trees/NodesandReferences.po
• 6.6. Parse Tree: Trees/ParseTree.po
• 6.7. Tree Traversals: Trees/TreeTraversals.po
• 6.8. Priority Queues with Binary Heaps: Trees/PriorityQueueswithBinaryHeaps.po
• 6.9. Binary Heap Operations: Trees/BinaryHeapOperations.po
• 6.10. Binary Heap Implementation: Trees/BinaryHeapImplementation.po
• 6.11. Binary Search Trees: Trees/BinarySearchTrees.po
• 6.12. Search Tree Operations: Trees/SearchTreeOperations.po
• 6.13. Search Tree Implementation: Trees/SearchTreeImplementation.po
• 6.14. Search Tree Analysis: Trees/SearchTreeAnalysis.po
• 6.15. Balanced Binary Search Trees: Trees/BalancedBinarySearchTrees.po
• 6.16. AVL Tree Performance: Trees/AVLTreePerformance.po
• 6.17. AVL Tree Implementation: Trees/AVLTreeImplementation.po
• 6.18. Summary of Map ADT Implementations: Trees/SummaryofMapADTImplementations.po
• 6.19. Summary: Trees/Summary.po
• 6.20. Key Terms: Trees/KeyTerms.po
• 6.21. Discussion Questions: Trees/DiscussionQuestions.po
• 6.22. Programming Exercises: Trees/ProgrammingExercises.po

7. Graphs and Graph Algorithms: Graphs/toctree.po

• 7.1. Objectives: Graphs/Objectives.po
• 7.2. Vocabulary and Definitions: Graphs/VocabularyandDefinitions.po
• 7.3. The Graph Abstract Data Type: Graphs/TheGraphAbstractDataType.po
• 7.4. An Adjacency Matrix: Graphs/AnAdjacencyMatrix.po
• 7.5. An Adjacency List: Graphs/AnAdjacencyList.po
• 7.6. Implementation: Graphs/Implementation.po
• 7.7. The Word Ladder Problem: Graphs/TheWordLadderProblem.po
• 7.8. Building the Word Ladder Graph: Graphs/BuildingtheWordLadderGraph.po
• 7.9. Implementing Breadth First Search: Graphs/ImplementingBreadthFirstSearch.po
• 7.10. Breadth First Search Analysis: Graphs/BreadthFirstSearchAnalysis.po
• 7.11. The Knight’s Tour Problem: Graphs/TheKnightsTourProblem.po
• 7.12. Building the Knight’s Tour Graph: Graphs/BuildingtheKnightsTourGraph.po
• 7.13. Implementing Knight’s Tour: Graphs/ImplementingKnightsTour.po
• 7.14. Knight’s Tour Analysis: Graphs/KnightsTourAnalysis.po
• 7.15. General Depth First Search: Graphs/GeneralDepthFirstSearch.po
• 7.16. Depth First Search Analysis: Graphs/DepthFirstSearchAnalysis.po
• 7.17. Topological Sorting: Graphs/TopologicalSorting.po
• 7.18. Strongly Connected Components: Graphs/StronglyConnectedComponents.po
• 7.19. Shortest Path Problems: Graphs/ShortestPathProblems.po
• 7.20. Dijkstra’s Algorithm: Graphs/DijkstrasAlgorithm.po
• 7.21. Analysis of Dijkstra’s Algorithm: Graphs/AnalysisofDijkstrasAlgorithm.po
• 7.22. Prim’s Spanning Tree Algorithm: Graphs/PrimsSpanningTreeAlgorithm.po
• 7.23. Summary: Graphs/Summary.po
• 7.24. Key Terms: Graphs/KeyTerms.po
• 7.25. Discussion Questions: Graphs/DiscussionQuestions.po
• 7.26. Programming Exercises: Graphs/ProgrammingExercises.po