0% found this document useful (0 votes)
1K views3 pages

15 - Days DSA Plan

The document outlines a 15-day crash course covering Data Structures and Algorithms (DSA) and core subjects such as DBMS, Operating Systems, and Computer Networks. Each day focuses on specific topics, including basics, advanced concepts, and practical problems, culminating in interview preparation and mock tests. A promotional offer of 50% off on interview and online assessment slots is also included for enrollees.

Uploaded by

Anshul Somani
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
0% found this document useful (0 votes)
1K views3 pages

15 - Days DSA Plan

The document outlines a 15-day crash course covering Data Structures and Algorithms (DSA) and core subjects such as DBMS, Operating Systems, and Computer Networks. Each day focuses on specific topics, including basics, advanced concepts, and practical problems, culminating in interview preparation and mock tests. A promotional offer of 50% off on interview and online assessment slots is also included for enrollees.

Uploaded by

Anshul Somani
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/ 3

15-Day DSA and Core Subjects Crash Course

Day 1-3: Data Structures & Algorithms Basics

Day 1: Introduction to DSA

Arrays, Strings

Time Complexity & Space Complexity

Basic problems on Arrays and Strings

Day 2: Searching and Sorting Algorithms

Binary Search, Merge Sort, Quick Sort

Problems on Sorting & Searching

Day 3: Recursion and Backtracking

Basics of Recursion

Standard Backtracking Problems (N-Queens, Rat in a Maze, etc.)

Day 4-6: Advanced Data Structures

Day 4: Linked Lists

Singly, Doubly, and Circular Linked Lists

Problems (Cycle detection, Merge Lists, etc.)

Day 5: Stacks and Queues

Stack and Queue implementation

Problems (Next Greater Element, Queue using Stacks)

Day 6: Trees

Binary Trees, Binary Search Trees, AVL Trees

Problems (Traversal, Height, etc.)


Day 7-9: Graphs and Dynamic Programming

Day 7: Graphs

Graph Representation (Adjacency List/Matrix)

BFS, DFS, Topological Sort, Shortest Path

Day 8: Dynamic Programming Basics

Introduction to DP, Memoization vs Tabulation

Problems (Fibonacci, Knapsack, etc.)

Day 9: Advanced DP & Graph Algorithms

Longest Common Subsequence, Matrix Chain Multiplication

Dijkstra’s Algorithm, Floyd-Warshall Algorithm

Day 10-12: Core Subjects

Day 10: DBMS

ER Diagrams, Normalization, Joins

SQL Queries and problems

Day 11: Operating Systems (OS)

Processes, Threads, Scheduling Algorithms

Memory Management, Virtual Memory

Day 12: Computer Networks (CN)

OSI Model, TCP/IP, Protocols (HTTP, FTP, etc.)

Routing Algorithms

Commands
Day 13-14: OOPS and System Design

Day 13: OOP Concepts

Inheritance, Polymorphism, Encapsulation, Abstraction

Problems (Real-world OOP examples, UML diagrams)

Day 14: System Design

Basics of High-Level Design, Low-Level Design

Database Schema Design, API Design

Day 15: Interview Prep & Mock Test

2-3 coding problems simulating an actual interview

Quick revision of key concepts

Bonus Offer:

Enroll in this course and get 50% off on the interview and online assessment slots!

REGISTER NOW

You might also like