Algorithmic Thinking - Level 2

Inclusive course for data strcutures

Computer | Python

English

Level: Intermediate

Last updated: Sept. 4, 2025

anima

Viewed by26
0

Prerequisites

For joining this course the candidates must have completed
1. Algorithmic Thinking – Level 1 by Prishni Innovations.
2. Basic familiarity with any programming language.
3. Basic Programming concepts should be clear

Description

This intermediate-level course deepens learners’ understanding of data structures through an inclusive, analogy-rich framework. Designed for programmers with basic programming knowledge, it introduces arrays, stacks, queues, trees, graphs, and hash tables using real-world metaphors and narration-friendly visuals. Learners will explore how algorithmic thinking supports efficient data organization, memory management, and problem-solving. The course emphasizes clarity, auditory engagement, and universal accessibility—ideal for educators, trainers, and learners from diverse backgrounds.

Who can enroll for the course?

This course is designed for programmers who already have a basic understanding of programming concepts and want to deepen their knowledge of algorithms and data structures. It is especially valuable for learners seeking analogy-driven, inclusive instruction—ideal for accessibility-focused trainers.

How long will I have access to this course?

You will have access to this course for 90 days from the date of purchase.

Is there a demo video for this course?

Currently, we do not have a demo video for this course. However, you can check the course description and course content for more details.

Will you recieve a certificate after course completion?

Yes, we provide certificate after assessment and after an additional cost of INR 299. Please write to admin@prishni.in for more details.

Course content

Expand all
1 modules
1 hours 3 minutes

Data Structures - Introduction

3 submodules 63.0

DS - Intro Data

5.0

DS - Introduction to Data and Data Structures

29.0

Ds - Advantages and Disadvantages of Data Structures