Kurser /

Data Structure & Algorithms PART I

Kursinnehåll

Data Structure & Algorithms PART I

1. Introduction to ADS

What is an Algorithm?Data Structure and Types Asymptotic Notations 1/2 Asymptotic Notations 2/2

2. Data Structures Part I

Stack Queue Types of Queue Linked List Hash Table Hash Collision

3. Trees Part I

Tree Data Structure Binary Tree Binary Tree and Its Types Heap Data Structure BST BST Insertion BST Deletion AVL TREE

4. Trees Part II

More about Binary Trees B Tree Prefix Tree Octree To be Continued

Data Structure and Types

You have a heap of candies and, of course, want to store them in some way.

You can put them in the box.

In computer programming, this box is called the Data Structure. So, the data structure is a storage that is used to store and organize data.

During the course, we will get acquainted with all data structures. Let’s learn what data structures exist.

Data structures:

Linear: array, stack, queue, linked list;
Non-linear: graph, trees;
Hash table.

You need to know how to choose the best data structure for your project as it helps you to write memory and time-efficient code.

Why do we need to learn ADS (Algorithm and Data Structures)?

Data Structures are used to hold data, and Algorithms are used to solve problems using that data;
ADS gives the solutions to problems in detail and gives you an insight into how efficient it is to use each one of them;
Also, you learn the science of evaluating the efficiency of any algorithm.

Choose non-linear data structures.

Select the correct answer

stack

trees

array

graph

queue

None of it

Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 1. Kapitel 2

Fråga AI

Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal

Kursinnehåll

Data Structure & Algorithms PART I

1. Introduction to ADS

What is an Algorithm?Data Structure and Types Asymptotic Notations 1/2 Asymptotic Notations 2/2

2. Data Structures Part I

Stack Queue Types of Queue Linked List Hash Table Hash Collision

3. Trees Part I

Tree Data Structure Binary Tree Binary Tree and Its Types Heap Data Structure BST BST Insertion BST Deletion AVL TREE

4. Trees Part II

More about Binary Trees B Tree Prefix Tree Octree To be Continued

Data Structure and Types

You have a heap of candies and, of course, want to store them in some way.

You can put them in the box.

In computer programming, this box is called the Data Structure. So, the data structure is a storage that is used to store and organize data.

During the course, we will get acquainted with all data structures. Let’s learn what data structures exist.

Data structures:

Linear: array, stack, queue, linked list;
Non-linear: graph, trees;
Hash table.

You need to know how to choose the best data structure for your project as it helps you to write memory and time-efficient code.

Why do we need to learn ADS (Algorithm and Data Structures)?

Data Structures are used to hold data, and Algorithms are used to solve problems using that data;
ADS gives the solutions to problems in detail and gives you an insight into how efficient it is to use each one of them;
Also, you learn the science of evaluating the efficiency of any algorithm.

Choose non-linear data structures.

Select the correct answer

stack

trees

array

graph

queue

None of it

Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 1. Kapitel 2

Vi beklagar att något gick fel. Vad hände?