Python 3: Project-based Python, Algorithms, Data Structures

BY
Udemy

Want to learn to build Algorithms and Data Structures making use of Python? Choose this course by Udemy.

Mode

Online

Fees

₹ 449 2299

Quick Facts

particular details
Medium of instructions English
Mode of learning Self study
Mode of Delivery Video and Text Based

Course overview

Python 3: Project-based Python, Algorithms, Data Structures course is an online programme designed for the programmers and approachable for beginners that introduces coding with Python and the way to use Python in building  Algorithms and Data Structures with Projects. The curriculum helps the participants to advance their potential in computer science, boosting their chance of being prioritized in the job market. 

Python 3: Project-based Python, Algorithms, Data Structures online course, offered by Udemy, is structured in two parts. The first part provides insight into the basic concepts of Python and programming such as functions, strings, execution context, frames, etc. Whereas the second part talks about the topics related to  Algorithms, Data Structures, and Performance Analysis including basics and advanced theories of algorithms, operations with Data structures, etc. 

Python 3: Project-based Python, Algorithms, Data Structures certification offers the learners the course through a wide variety of course materials and exercises such as animation heavy instructional video, coding exercises, quizzes, Python scripts, assessment tests, live help, and designated office hours with the instructor. 

The highlights

  • Online course 
  • 30-Day Money-Back Guarantee
  • Downloadable resources
  • Coding exercises
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of completion
  • English videos subtitle
  • Multiple assessment tests
  • Office hours with the instructor

Program offerings

  • 14.5 hours on-demand video
  • 9 articles
  • 81 downloadable resources
  • 14 coding exercises
  • Full lifetime access
  • Access on mobile and tv
  • Certificate of completion
  • English videos subtitle
  • 14+ hours of animation heavy instructional video

Course and certificate fees

Fees information
₹ 449  ₹2,299

The fees for Python 3: Project-based Python, Algorithms, Data Structures is -

HeadAmount
Original PriceRs. 2299.00
Discounted PriceRs. 449.00

 

certificate availability

Yes

certificate providing authority

Udemy

What you will learn

Knowledge of algorithms Knowledge of python

The learners and programmers, at the end of Python 3: Project-based Python, Algorithms, Data Structures online certification, will be able to have a deep understanding of Python 3, programming languages, and to learn to build projects using Python. Plus, the programme will let the participants explore the Program Execution and Information flow.  After the course, the students will be able to have an A-Z understanding of both Algorithms and Data Structures. 

The syllabus

Intoduction

  • Introduction
  • Live help, office hours, and Python e-book
  • Course structure and content overview

Development environment setup

  • [IMPORTANT] - Note to beginners, please don't skip this
  • Section intro and overview
  • Command-line basics cheat sheet
  • Download and install Python
  • Setup Atom as text editor (setup used in this course)
  • Exploring Jupyter Notebooks interface (optional)

Python in-depth

  • Section intro and overview
  • Command-line/Terminal basics
  • Strings, variable, top-down execution flow
  • Strings basics - I
  • Let's get started!
  • (IMPORTANT) A note on quizzes, coding exercises and assessment tests
  • Strings: concatenation, indexing, slicing, python console
  • Strings basics - II
  • String methods, functions, and import statements
  • Strings basics - III
  • Strings basics exercise
  • Print formatting and special characters
  • Print formatting basics
  • Numbers, math, type casting and input
  • Math fun
  • Numbers practice
  • Assessment test - Python basics: Text, numbers and print formatting
  • Introduction to branching (if, elif, else) and conditionals
  • Building if, elif, else blocks incrementally
  • Branching practice
  • Lists, dicts, sets and tuples - Intro to compound data types in Python
  • Compound data types
  • Lists - an in-depth look 1
  • Lists 1
  • Lists practice
  • Lists - an in-depth look 2
  • Lists 2
  • More lists practice
  • Dictionaries, sets and tuples
  • Compound data types
  • Dictionaries practice
  • Sets and Tuples practice
  • Iterators, for loops, generators, list comprehension
  • For loops, generators and list comprehension
  • Assessment test - Lists, dicts, tuples, sets and iteration
  • While loops, enumerate, zip
  • While loops and more generators
  • Functions - an introductory look
  • Function basics - 1
  • Functions - implementation step by step
  • Functions basics - 2
  • Functions - execution context, frames, mutable vs. immutable arguments in-depth
  • Functions
  • Functions warm-up
  • (Challenge exercise) Function and logic practice
  • Assessment test - Functions, data types, iterators
  • Classes and objects - an introductory look
  • Classes intro
  • Building a custom Student class and intro to special methods
  • Custom object intro
  • Add some methods to the class
  • Special methods and what they are
  • Special methods
  • Reading from and writing to files
  • Read/write ops
  • Add read functionality and utilize special and static methods
  • Inheritance, subclasses and complete example class
  • Classes practice
  • Bonus Python specific content (Optional)
  • Python specifics - Lambda expressions
  • Lambda expressions and map function
  • Lambda expressions coding practice
  • Generators - under the hood
  • Build your own generators using yield

Algorithms - sort, performance, complexity and big O notation

  • Introduction to section 4 an overview of the material covered in it
  • Bubble sort demonstration and complexity analysis
  • Bubble sort implementation
  • Selection sort demonstration and complexity analysis
  • Selection sort implementation
  • Complexity quiz
  • Insertion sort demonstration and assignment handoff
  • Insertion sort programmatic execution step by step
  • Performance measures - deep dive with a programmatic view
  • Performance measure - calculation
  • O(nlog(n)) performance and algorithm prerequisites
  • Analyze log(n), visualize the math behind it and how it relates to algorithms
  • Merge sort visualization and complexity analysis
  • Implement merge function - part 1
  • Implement merge function - part 2
  • Implement merge function - part 3
  • A look at the recursive divide function
  • An in-depth look at execution context of recursive divide function
  • Recursion mini-project 1 - Countdown timer
  • Recursion mini-project 2 - Factorial
  • Recursion mini-project 3 - Fibonacci series
  • Complete merge sort algorithm and analyze updated execution context
  • Algorithm complexity quiz
  • Quicksort demo
  • Quicksort implementation
  • Section final project objective and motivation
  • Project specs and runtime execution intro
  • Project phase 1: Build random int list generator
  • Project phase 2: Get input from the user for size and range
  • Project phase 3: Add functions, calculate and analyze runtime
  • Project phase 4: Extract redundancies, create function, and cleanup code
  • Project phase 5: Add multiple run functionality and perform additional testing

Algorithm - Search and abstract data structures

  • Introduction to section 5
  • Intro to search - Linear, Bisection/Binary search
  • Search
  • Bisection/Binary search - Iterative implementation
  • Bisection search - recursive implementation
  • Project handoff: Bringing it together
  • Project conclusion walkthrough
  • Hashmaps and O(1) search complexity
  • Operation complexity
  • Hash project 1: Define and set up class blueprint with __init__ and __str__
  • Hash project 2: Set up insert and hashing functionality for data structure
  • Hash project 3: Add update functionality
  • Hash project 4: Build search method
  • Project: Use hash structure in a practical exercise - Quote finder
  • Project: Complete quote finder using hash table
  • Intro to linear data structures - Linked Lists
  • Linked list
  • Build a custom linked list
  • Recursively reverse a linked list
  • Visualize  Stacks and Queues, and their operation
  • Stacks and Queues
  • Introduction to Trees and Binary Search Trees
  • Trees
  • In-order traversal of a Binary Search Tree
  • Traversal order
  • Build a Binary Search Tree from scratch - Insert
  • BST from scratch - In-order traversal
  • Traversal implementation
  • BST from scratch - Search
  • BST from scratch - Delete demo
  • BST - Deleting leaf nodes
  • BST - Deleting nodes with 1 child node
  • BST - Deleting nodes with 2 children
  • Binary Search Trees
  • Project: Job Scheduler using Binary Search Trees - Introduction
  • Project: Job Scheduler execution flow
  • Project: Job Scheduler implementation tips and notes
  • Thank you for taking the course and the next steps

Instructors

Mr Mashrur Hossain
Instructor
Freelancer

Other Bachelors

Mr Nathan House
Leading Cyber Security Expert
Freelancer

Other Bachelors

Articles

Popular Articles

Latest Articles

Trending Courses

Popular Courses

Popular Platforms

Learn more about the Courses

Download the Careers360 App on your Android phone

Regular exam updates, QnA, Predictors, College Applications & E-books now on your Mobile

Careers360 App
150M+ Students
30,000+ Colleges
500+ Exams
1500+ E-books