uCertify

Data Structures and Algorithms in Python

(UHV-3331.AE1)
Lessons
Lab
TestPrep
Get A Free Trial

Skills You’ll Get

Download Course Outline

1

Python Primer

  • 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
  • Exercises
2

Object-Oriented Programming

  • Goals, Principles, and Patterns
  • Software Development
  • Class Definitions
  • Inheritance
  • Namespaces and Object-Orientation
  • Shallow and Deep Copying
  • Exercises
3

Algorithm Analysis

  • Experimental Studies
  • The Seven Functions Used in This Course
  • Asymptotic Analysis
  • Simple Justification Techniques
  • Exercises
4

Recursion

  • Illustrative Examples
  • Analyzing Recursive Algorithms
  • Recursion Run Amok
  • Further Examples of Recursion
  • Designing Recursive Algorithms
  • Eliminating Tail Recursion
  • Exercises
5

Array-Based Sequences

  • 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
6

Stacks, Queues, and Deques

  • Stacks
  • Queues
  • Double-Ended Queues
  • Exercises
7

Linked Lists

  • 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
  • Exercises
8

Sorting and Selection

  • 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
9

Searching

  • Linear Search
  • Binary Search
  • Interpolation Search
  • Majority Voting
  • Summary
  • Exercises
10

Trees

  • General Trees
  • Binary Trees
  • Implementing Trees
  • Tree Traversal Algorithms
  • Case Study: An Expression Tree
  • Exercises

1

Python Primer

  • Using the Bitwise Operator
  • Using the Equality Operator and the list Class
  • Using Arithmetic Operators
  • Performing Bitwise Operations
  • Using the Comparison Operator
  • Using the if-elif-else Statement - Part 1
  • Using the if-elif-else Statement - Part 2
  • Using the if-else Statement
  • Determining the Armstrong Number
  • Rectifying Errors
  • Finding LCM of Two Numbers
  • Creating a Function with its Default Value
  • Handling Exception
  • Using the dir Function
  • Using the math Module
2

Object-Oriented Programming

  • Understanding the init Method
  • Understanding Numeric Progressions
3

Recursion

  • Calculating the Product of Two Positive Integers
  • Finding the Minimum Element
4

Array-Based Sequences

  • Using the extend Method
  • Adding Elements to a List
  • Implementing a Dynamic Array
  • Using the getsizeof Function
  • Removing Elements from a List
  • Constructing the Caesar Cipher Algorithm
5

Stacks, Queues, and Deques

  • Using Stack Abstract Data Type Method
6

Linked Lists

  • Implementing a Queue
  • Implementing a Stack
  • Implementing a Queue with a Circular Linked List
  • Implementing a Deque with a Doubly Linked List
7

Sorting and Selection

  • Using a Sorting Function
  • Using the len() Built-In Function
8

Searching

  • Understanding the Linear Search Algorithm
  • Understanding Binary Search
  • Understanding Interpolation Search
  • Discussing about Searching, Hash Tables, and Recursion

Any questions?
Check out the FAQs

Still have unanswered questions and need to get in touch?

Contact Us Now

Data Structures and Algorithms in Python

$279.99

Buy Now

Related Courses

All Courses