uCertify

Programming in Python

(UOP-PRG310.AE1)
Lessons
Lab
Lab (Add-on)
TestPrep
Get A Free Trial

Skills You’ll Get

Download Course Outline

1

Python, Algorithm, Recursion, and Array-based Sequences

  • Python Overview
  • Objects in Python
  • Expressions, Operators, and Precedence
  • Control Flow
  • Functions
  • Simple Input and Output
  • Exception Handling
  • Iterators and Generators
  • Additional Python Conveniences
  • Scopes and Namespaces
  • Modules and the Import Statement
  • Goals, Principles, and Patterns
  • Software Development
  • Class Definitions
  • Inheritance
  • Namespaces and Object-Orientation
  • Shallow and Deep Copying
  • Experimental Studies
  • The Seven Functions Used in This Course
  • Asymptotic Analysis
  • Simple Justification Techniques
  • Illustrative Examples
  • Analyzing Recursive Algorithms
  • Recursion Run Amok
  • Further Examples of Recursion
  • Designing Recursive Algorithms
  • Eliminating Tail Recursion
  • Python's Sequence Types
  • Low-Level Arrays
  • Dynamic Arrays and Amortization
  • Efficiency of Python's Sequence Types
  • Using Array-Based Sequences
  • Multidimensional Data Sets
  • Exercises
2

Stacks, Queues, Deques, Linked Lists, Trees, and Priority Queues

  • Stacks
  • Queues
  • Double-Ended Queues
  • Singly Linked Lists
  • Circularly Linked Lists
  • Doubly Linked Lists
  • The Positional List ADT
  • Sorting a Positional List
  • Case Study: Maintaining Access Frequencies
  • Link-Based vs. Array-Based Sequences
  • General Trees
  • Binary Trees
  • Implementing Trees
  • Tree Traversal Algorithms
  • Case Study: An Expression Tree
  • The Priority Queue Abstract Data Type
  • Implementing a Priority Queue
  • Heaps
  • Sorting with a Priority Queue
  • Adaptable Priority Queues
  • Exercises
3

Maps, Hash Tables, Skip Lists, Search Trees, and Sorting and Selection

  • Maps and Dictionaries
  • Hash Tables
  • Sorted Maps
  • Skip Lists
  • Sets, Multisets, and Multimaps
  • Binary Search Trees
  • Balanced Search Trees
  • AVL Trees
  • Splay Trees
  • (2,4) Trees
  • Red-Black Trees
  • Why Study Sorting Algorithms?
  • Merge-Sort
  • Quick-Sort
  • Studying Sorting through an Algorithmic Lens
  • Comparing Sorting Algorithms
  • Python's Built-In Sorting Functions
  • Selection
  • Exercises
4

Text Processing, Graph Algorithm, Memory Management and B-Trees

  • Abundance of Digitized Text
  • Pattern-Matching Algorithms
  • Dynamic Programming
  • Text Compression and the Greedy Method
  • Tries
  • Graphs
  • Data Structures for Graphs
  • Graph Traversals
  • Transitive Closure
  • Directed Acyclic Graphs
  • Shortest Paths
  • Minimum Spanning Trees
  • Memory Management
  • Memory Hierarchies and Caching
  • External Searching and B-Trees
  • External-Memory Sorting
  • Exercises
5

Data Analysis and Software Development

  • Create numpy Arrays
  • Handle Data with pandas DataFrame
  • Plot with pandas and seaborn
  • Debugging
  • Automated Testing
  • Write a Test with pytest
  • Add More Information to Your Package
  • More Complex Documentation
A

Appendix A: Character Strings in Python

B

Appendix B: Useful Mathematical Facts

1

Python, Algorithm, Recursion, and Array-based Sequences

  • Using Arithmetic Operators
  • Performing Bitwise Operations
  • Using the if-else Statement
  • Rectifying Errors
  • Finding LCM of Two Numbers
  • Handling Exception
  • Using the dir Function
  • Calculating the Product of Two Positive Integers
2

Stacks, Queues, Deques, Linked Lists, Trees, and Priority Queues

  • Using Stack Abstract Data Type Method
3

Maps, Hash Tables, Skip Lists, Search Trees, and Sorting and Selection

  • Adding Elements to a Set
  • Performing Set Operations
  • Using a Sorting Function
  • Using the len() Built-In Function
4

Text Processing, Graph Algorithm, Memory Management and B-Trees

  • Performing Pattern Matching
5

Data Analysis and Software Development

  • Using numpy Array Attributes
  • Reading Data from Files
  • Adding a Column to the DataFrame
  • Creating Bar Plot Grouped by a Specific Feature
  • Plotting and Analyzing a Histogram
  • Debugging a Sample Python Code
  • Demonstrating Working of unittest

1

Stacks, Queues, Deques, Linked Lists, Trees, and Priority Queues

  • Using the Comparison Operator
  • Using the Bitwise Operator
  • Using the if-elif-else Statement - Part 1
  • Using the if-elif-else Statement - Part 2
  • Understanding the init Method
  • Using the Equality Operator and the list Class
  • Using the math Module
  • Determining the Armstrong Number
  • Creating a Function with its Default Value
  • Finding the Minimum Element

Related Courses

All Courses