0% found this document useful (0 votes)
83 views

Datastructures and Algorithms

This document provides a roadmap for learning computer science topics like programming languages, data structures, algorithms, and problem solving techniques. It outlines fundamental concepts like functions, object oriented programming, and pseudo code. It also details specific data structures like arrays, linked lists, stacks, queues, hash tables, trees, and graphs. Common algorithms like sorting, searching, shortest path, and spanning tree algorithms are covered. Platforms for practicing problems are recommended at the end.

Uploaded by

joshimeet479
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
83 views

Datastructures and Algorithms

This document provides a roadmap for learning computer science topics like programming languages, data structures, algorithms, and problem solving techniques. It outlines fundamental concepts like functions, object oriented programming, and pseudo code. It also details specific data structures like arrays, linked lists, stacks, queues, hash tables, trees, and graphs. Common algorithms like sorting, searching, shortest path, and spanning tree algorithms are covered. Platforms for practicing problems are recommended at the end.

Uploaded by

joshimeet479
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Related Roadmaps

Find the detailed version of this roadmap


Computer Science Roadmap Along with resources and more roadmaps
Programming Language Roadmaps
https://roadmap.sh
Data Structures & Algorithms

Language Syntax Control Structures

JavaScript Java Go

C# C++ Python Pick a Language Programming Fundamentals

Rust Ruby
Functions OOP Basics

Pseudo Code

Array Linked Lists

Stacks Queues Data Structures


Basic Data Structures

Hash Tables
What are Data Structures?

Importance of Data Structures


Time vs Space Complexity Algorithmic Complexity

How to Calculate Complexity? Bubble Sort Merge Sort

Sorting Algorithms Insertion Sort Quick Sort


Common Runtimes Asymptotic Notation

Constant Big O Notation Selection Sort Heap Sort

Logarithmic Big-θ Notation

Linear Big-Ω Notation


Search Algorithms Linear Search Binary Search
Polynomial

Exponential Binary Trees

Factorial
Binary Search Trees
Tree Data Structures Directed Graph

AVL Trees
Undirected Graph

B-Trees
Tree Traversal Search Algorithms
Graph Data Structure
In-Order Traversal Breadth First Search

Pre-Order Traversal Depth First Search


Search Algorithms
Trie
Post-Order Traversal
Breadth First Search
Segment Trees
Depth First Search
Fenwick Trees Advanced Data Structures

Disjoint Set (Union-Find) Shortest Path Algos.

Su"x Trees and Arrays Dijkstra's Algorithm

Bellman-Ford

B/B+ Trees
Linear Indexing
Indexing Complex Data Structures Skip List Minimum Spanning Tree
Tree-Based Indexing
ISAM Prim's Algorithm

Kruskal's Algorithm
2-3 Trees

Problem Solving Techniques Platforms for Practice Leetcode

Edabit

Brute Force Backtracking

Greedy Algorithms Randomised Algorithms

Divide and Conquer Recursion

Dynamic Programming Two Pointer Technique Keep Learning


Sliding Window Technique

You might also like