Do you know what is DSA

Question

Hello , Do you know what is Data structure,algorithms , Time and space complexity ?

If you do please post it as comment

Answer 1

Data Structure and Algorithms

Do you have a specific question related and if so is it a code that has issues 🤔

The question and answer forum is for code related issues per guidelines.

Community created lesson
https://www.sololearn.com/learn/773/?ref=app

Welcome to Sololearn
https://www.sololearn.com/discuss/1316935/?ref=app
https://www.sololearn.com/discuss/3021159/?ref=app
https://www.sololearn.com/discuss/333866/?ref=app

Answer 2

Data Structures (DS)
Data Structures are ways to organize and store data in a computer so that it can be efficiently accessed, modified, and manipulated. Common examples include:

- Arrays
- Linked Lists
- Stacks
- Queues
- Trees (Binary Trees, AVL Trees, etc.)
- Graphs
- Hash Tables

Algorithms
Algorithms are step-by-step procedures to solve problems or perform specific tasks. They take input, process it, and produce output. Examples include:

- Sorting Algorithms (Bubble Sort, Selection Sort, etc.)
- Searching Algorithms (Linear Search, Binary Search, etc.)
- Graph Algorithms (DFS, BFS, etc.)
- Dynamic Programming Algorithms

Time Complexity
Time Complexity measures the amount of time an algorithm takes to complete as a function of the input size. It's usually expressed using Big O notation. Common examples include:

- O(1) - Constant Time Complexity
- O(log n) - Logarithmic Time Complexity
- O(n) - Linear Time Complexity
- O(n log n) - Linearithmic Time Complexity
- O(n^2) - Quadratic Time Complexity
- O

Answer 3

Refer to the above answer for info, but here’s some meta:

Dsa is a huge topic that can take 6 months or more of consistent studying to fully grasp. It’s pretty much the backbone of most decisions software engineers make, backend moreso than frontend but frontend uses it too.

It basically outlines these major categories:
Amortization — when I say “most efficient”, are you curious how we measured efficiency? This. But everyone calls it Big O. It consists of Time Complexity and Space Complexity.

Data Structures — how to structure data in certain patterns that maximize the efficiency of indexing, search, insertion, and deletion. Each data structure (for example, an array) does some of those things listed above more efficiently, so DS is also about knowing when to use certain ones over others.

Algorithms — basically about choosing the most efficient way to (A) sort a list of data, (B) search a list of data, or (C) search a non-list of data (like a tree or a graph— which are both are datastructures).