CLASS 10Intermediate LEVEL

Data Structures & Algorithms (DSA)

An intermediate DSA course for Class 10 students covering linked lists, trees, recursion, backtracking, hashing, and advanced sorting techniques such as merge sort and quick sort — developing structured, efficient problem-solving skills.

Duration

10 Days

Total Hrs

26 Hours

Level

Intermediate

What You'll Get

Expert Trainer-Led Sessions
Training Slides & Learning Materials
Practical Assignments
Assessment & Progress Report
Course Completion Certificate

Methodology

Instructor-Led Training
Practical Hands-on Sessions
Live Demonstrations
Mini Assignments & Assessments
Project-Based Learning

Detailed Syllabus

Practical, engaging and concept-based learning

1

Linked Lists in Depth

Topics Covered

Singly linked lists
Doubly linked lists

Practical / Activities

Implement a singly linked list with insert/delete operations

Outcomes

Implement and manipulate linked lists

2

Introduction to Trees

Topics Covered

Binary trees — structure and terminology

Ready to start?

₹499

One-time Enrollment Fee

Enroll Now

Course Snapshot

Course Code
LEQ-C10-DSA
Grade Level
Class 10

Prerequisites

Class 9 DSA course or equivalent experience

Enroll Now

Tree traversal (inorder, preorder, postorder)

Practical / Activities

Implement binary tree traversal

Outcomes

Understand and implement basic tree structures

3

Recursion, Backtracking & Hashing

Topics Covered

Recursive problem-solving strategies
Introduction to backtracking
Hashing basics

Practical / Activities

Solve a backtracking problem (e.g., simple maze)

Outcomes

Apply recursion and backtracking techniques

4

Advanced Sorting

Topics Covered

Merge sort
Quick sort

Practical / Activities

Merge sort implementation

Outcomes

Apply divide-and-conquer sorting algorithms

Objectives

Implement singly and doubly linked lists
Understand and traverse binary trees
Apply recursion and backtracking to solve problems
Implement advanced sorting algorithms