Scribd
Upload
16 views1 page

DSA Course Plan

The DSA Course Plan outlines a comprehensive curriculum covering various data structures and algorithms through live classes, extra doubt sessions, and daily problem sets. It includes modules on arrays, linked lists, stacks, queues, hashing, trees, graphs, time and space complexity, and miscellaneous topics. The course aims to build logic and understanding of DSA fundamentals and their applications.

Uploaded by

mdsanowarali7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views1 page

DSA Course Plan

The DSA Course Plan outlines a comprehensive curriculum covering various data structures and algorithms through live classes, extra doubt sessions, and daily problem sets. It includes modules on arrays, linked lists, stacks, queues, hashing, trees, graphs, time and space complexity, and miscellaneous topics. The course aims to build logic and understanding of DSA fundamentals and their applications.

Uploaded by

mdsanowarali7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DSA Course Plan.

❖​ What will we cover in this course?


➢​ Topic wise live classes.
➢​ Extra doubt classes.
➢​ Provide a problem of the day of the discussed topics.
➢​ Provide problems set to practice every topic.
❖​ Data Structures & Algorithms (DSA) Course Curriculum.
➢​ Module -1: Introduction.
■​ Programming language options.
■​ What is DSA?
■​ Type of Data structure.
■​ Why do we study DSA?
■​ Logic building.
➢​ Module -2: Array.
■​ What is an array?
■​ Why do we use arrays?
■​ Operation in array.
➢​ Module -3: Linked-list.
■​ Introduction of linked-list.
■​ Linked-list Memory.
■​ Type of LL.
■​ LL operations.
➢​ Module -4: Stacks & Queues.
➢​ Module -5: Hash.
■​ Hash table.
■​ Hash set.
■​ Hash maps.
➢​ Module -6: Trees.
■​ Introduction of trees.
■​ Binary trees.
■​ Pre, Post order trees.
■​ Array Implementation.
■​ BST(Binary search tree).
➢​ Module -7: Graph.
■​ Introduction of graphs.
■​ Graph implementation.
■​ Graph traversal.
■​ Cycle detection.
➢​ Module -8: Time & Space complexity.
➢​ Module -9: Miscellaneous.

You might also like