Data Structures and Algorithms (C# code in GitHub)

Focused View

Parisa Jalili Marandi

6:33:35

67 View

1. Introduction

1. Introduction.mp4

01:49

2. Search Algorithms

1.1 Search-CompareTable.pdf

1.2 Source Code in C#.html

1. Introduction to Search Algorithms.mp4

01:41

2.1 Linear Search in C#.html

2.2 Linear Search Test in C#.html

2. Linear Search.mp4

06:40

3.1 Hash Table Search in C#.html

3.2 Hash Table Search Test in C#.html

3. Hash Table Search.mp4

06:30

4.1 Binary Search in C#.html

4.2 Binary Search Test in C#.html

4. Binary Search.mp4

08:13

5.1 Ternary Search in C#.html

5.2 Ternary Search Test in C#.html

5. Ternary Search.mp4

10:27

6.1 Jump Search in C#.html

6.2 Jump Search Test in C#.html

6. Jump Search.mp4

08:22

7.1 Exponential Search in C#.html

7.2 Exponential Search Test in C#.html

7. Exponential Search.mp4

02:27

8.1 Fibonacci Search in C#.html

8.2 Fibonacci Search Test in C#.html

8. Fibonacci Search.mp4

10:41

9.1 Interpolation Search in C#.html

9.2 Interpolation Search Test in C#.html

9. Interpolation Search.mp4

10:59

3. Sort Algorithms

1. Introduction to Sort Algorithms.mp4

00:51

2.1 Bubble Sort in C#.html

2.2 Bubble Sort Tests in C#.html

2. Bubble Sort.mp4

12:40

3.1 Insertion Sort in C#.html

3.2 Insertion Sort Tests in C#.html

3. Insertion Sort.mp4

23:27

4.1 Selection Sort in C#.html

4.2 Selection Sort Tests in C#.html

4. Selection Sort.mp4

06:10

5.1 Quick Sort in C#.html

5.2 Quick Sort Tests in C#.html

5. Quick Sort.mp4

22:31

6.1 Merge Sort in C#.html

6.2 Merge Sort Tests in C#.html

6. Merge Sort.mp4

27:52

7.1 Heap Sort in C#.html

7.2 Heap Sort Tests in C#.html

7. Heap Sort.mp4

16:52

8.1 Radix Sort in C#.html

8.2 Radix Sort Tests in C#.html

8. Radix Sort.mp4

07:03

4. Binary Heaps

1. Binary Heaps.mp4

02:53

2.1 Min Binary Heap in C#.html

2.2 Min Binary Heap Test in C#.html

2. Min Binary Heap Introduction.mp4

03:21

3. Min Binary Heap - Insert Operation.mp4

07:28

4. Min Binary Heap - Build Operation.mp4

04:55

5. Min Binary Heap - Delete Root Operation.mp4

08:09

6.1 Max Binary Heap in C#.html

6.2 Max Binary Heap Test in C#.html

6. Max Binary Heap Introduction.mp4

03:02

7. Max Binary Heap - Insert Operation.mp4

08:04

8. Max Binary Heap - Build Operation.mp4

04:51

9. Max Binary Heap - Delete Root Operation.mp4

09:02

10.1 Min-Max Binary Heap in C#.html

10.2 Min-Max Binary Heap Test in C#.html

10. Min-Max Binary Heap Introduction.mp4

04:34

11. Min-Max Binary Heap - Insert Operation.mp4

11:27

12. Min-Max Binary Heap - Delete Root Operation.mp4

10:31

13. Min-Max Binary Heap - Build Operation.mp4

05:48

5. Binary Search Trees

1.1 Binary Search Tree in C#.html

1.2 Binary Search Tree Tests in C#.html

1. Binary Search Tree Introduction.mp4

02:41

2. Binary Search Tree - Insert Operation.mp4

05:15

3. Binary Search Tree - Delete Operation.mp4

05:15

6. AVL Trees

1.1 AVL Tree in C#.html

1.2 AVL Tree Tests in C#.html

1. AVL Tree Introduction.mp4

01:43

2. AVL Tree - Insert Operation.mp4

08:40

3. AVL Tree- Delete Operation.mp4

06:16

7. Red Black Binary Trees

1.1 Red Black Tree in C#.html

1.2 Red Black Tree Tests in C#.html

1. Red Black Trees - Introduction.mp4

01:42

2. Red Black Trees - Insert Operation.mp4

09:34

3. Red Black Trees - Delete Operation.mp4

07:41

8. B-Trees

1.1 2-3 B-Tree Tests in C#.html

1.2 B-Tree implementation in C#.html

1. B-Tree Introduction.mp4

03:51

2. B-Tree Insert Operation.mp4

10:26

3. B-Tree Delete Operation.mp4

17:19

9. B(+) Trees

1.1 2-3 B(+) Tree Tests in C#.html

1.2 B(+) Tree Implementation in C#.html

1. B(+) Tree Introduction.mp4

03:49

2. B(+) Tree Insert Operation.mp4

19:23

3. B(+) Tree Delete Operation.mp4

20:40

Description

Search, Sort, Binary Heaps, Binary Trees, Nary Trees (paired with C# implementations in an open source GitHub repo)

What You'll Learn?

Sort algorithms (bubble, insertion, selection, quick, merge, heap, radix), Search algorithms (linear, hash-table, binary, ternary, jump, exponential, fibonacci), Binary Search Trees, AVL trees, Red-Black trees, B-Trees, B+Trees, Min Binary Heap, Max Binary Heap, Min-Max Binary Heap

Who is this for?

Anyone preparing for coding interviews at GAFAM, or high tech firms

Students of computer science/engineering

What You Need to Know?

Some familiarity with basics in computer science may be useful but is not a must

More details

Description
This course teaches a comprehensive list of basic and advanced data structures and algorithms, an essential topic of coding interviews at tech companies.
The course is paired with a C# GitHub open source project (username: PiJei, repository name:Â AlgorithmsAndDataStructures) where each algorithm is tagged with its space and time complexities (Big O), and tested for correctness with the exact same examples used in this course.
If you are a developer or a graduate student who is preparing for coding interviews at large tech firms as Google, Amazon, Facebook, Apple, Microsoft, or smaller high tech companies, you have landed in the right place. By attending this course you will learn the essential and complex data structures and algorithms, once and for all.Â
Some algorithms are taught over a medium size example such that the algorithm repeats itself several times until it is no longer complex and rather easily understood.
You are expected to maintain the knowledge gained via this course for a very long period of time. This is because this course makes heavy usage of animations , examples, and repetitions, which are the keys for deeply learning new topics.
The course has 45 lectures (~ 400 minutes) covering the following topics:
Search Algorithms:
Linear Search
Hash-Table Search
Jump Search
Exponential Search
Fibonacci Search
Binary Search
Ternary Search
Interpolation Search
Sort Algorithms:
Bubble Sort
Insertion Sort
Selection Sort
Quick Sort
Merge Sort
Radix Sort
Heap Sort
Binary Heaps:
Min Binary Heap
Max Binary Heap
Min-Max Binary Heap
With these operations:
Build
Insert
Delete
Binary Trees:
Binary Search Tree
AVL Tree
RedBlack Tree
With these operations:
Insert
Delete
Nary Trees:
B Tree
B+ Tree
With these operations:
Â a. Insert
Â b. Delete

Who this course is for:
Anyone preparing for coding interviews at GAFAM, or high tech firms
Students of computer science/engineering

User Reviews

Rating

average 0

Total votes0

Focused display

The instructor has 17 years of active experience in computer science and engineering :Employment History - Vice President (Software Engineering), JP.Morgan [2019 to Present] - Engineer/Researcher, Microsoft [2016 to 2019] - Postdoctoral Researcher, Microsoft Research [2014 to 2016] - PhD, University Of Lugano [2009 to 2014] Thesis: High performance State-Machine ReplicationTeaching experiences - Distributed Algorithms, University of Lugano - Java programming language, University of Lugano - Python programming language, University of LuganoCS Interests - Large scale Distributed Systems /Databases - Cloud Services - Networking - Data center resource usage

Udemy

View courses Udemy

Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.