Data Structures and Algorithms in Python - Course and Syllabus
Students

Academic Programs

AI-powered learning for grades 8-12, aligned with major curricula

Professional

Professional Courses

Industry-relevant training in Business, Technology, and Design

Games

Interactive Games

Fun games to boost memory, math, typing, and English skills

Data Structures and Algorithms in Python

Data Structures and Algorithms in Python

This chapter explores the core concepts and principles pertaining to the topic at hand, delving into various aspects such as definitions, applications, and significance within a broader context. Key discussions focus on practical exercises, questions for thought, and collaborative activities to ensure an integrated understanding of the subject matter. The structure facilitates learning through interactive exercises alongside in-depth explanations and summaries.

58 Chapters 48 weeks

Course Chapters

Chapter 1

Algorithms and programming: simple gcd part-A

Chapter 1

Algorithms and programming: simple gcd part-B

Chapter 2

Improving naive gcd

Chapter 3

Euclid's algorithm for gcd

Chapter 4

Downloading and installing Python

Chapter 5

Assignment statement, basic types - int, float, bool - Part A

Chapter 5

Assignment statement, basic types - int, float, bool - Part B

Chapter 6

Strings - Part A

Chapter 6

Strings - Part B

Chapter 7

Lists - Part A

Chapter 7

Lists - Part B

Chapter 8

Control Flow

Chapter 9

Functions

Chapter 10

Examples

Chapter 11

More about range()

Chapter 12

Manipulating lists

Chapter 13

Breaking out of a loop

Chapter 14

Arrays vs lists, binary search - Part A

Chapter 14

Arrays vs lists, binary search - Part B

Chapter 15

Efficiency

Chapter 16

Selection Sort

Chapter 17

Insertion Sort

Chapter 18

Recursion

Chapter 19

Mergesort - Part A

Chapter 19

Mergesort - Part B

Chapter 20

Mergesort, analysis

Chapter 21

Quicksort

Chapter 22

Quicksort analysis

Chapter 23

Tuples and dictionaries

Chapter 24

Function definitions

Chapter 25

List Comprehension

Chapter 26

Exception Handling

Chapter 27

Standard input and output

Chapter 28

Handling files - Part A

Chapter 28

Handling files - Part B

Chapter 29

String functions

Chapter 30

Formatting printed output

Chapter 31

Pass, del() and None

Chapter 32

Backtracking, N queens - Part A

Chapter 32

Backtracking, N queens - Part B

Chapter 33

Global scope, nested functions

Chapter 34

Generating permutations

Chapter 35

Sets, stacks, queues

Chapter 36

Priority queues and heaps - Part A

Chapter 36

Priority queues and heaps - Part B

Chapter 37

Abstract datatypes, classes and objects

Chapter 38

Classes and objects in Python

Chapter 39

User defined lists - Part A

Chapter 39

User defined lists - Part B

Chapter 40

Search trees - Part A

Chapter 40

Search trees - Part B

Chapter 41

Memoization and dynamic programming

Chapter 42

Grid paths

Chapter 43

Longest common subsequence - Part A

Chapter 43

Longest common subsequence - Part B

Chapter 44

Matrix multiplication

Chapter 45

Wrap-up, Python vs other languages - Part A

Chapter 45

Wrap-up, Python vs other languages - Part B