Download appDownload App

Data Structures in JavaScript: Master The Fundamentals

Data Structure helps you in organizing data in the most efficient way so that operations can be performed effectively. With the knowledge of data structure, you can organize your code efficiently for...

  • All levels
  • English

Course Description

Data Structure helps you in organizing data in the most efficient way so that operations can be performed effectively. With the knowledge of data structure, you can organize your code efficiently for faster operations. Whereas, the algorithm is a step by step procedure which is used to solve a problem. For any activity, be it solving a computer problem, or writing source code, or innovating new pr...

Data Structure helps you in organizing data in the most efficient way so that operations can be performed effectively. With the knowledge of data structure, you can organize your code efficiently for faster operations. Whereas, the algorithm is a step by step procedure which is used to solve a problem. For any activity, be it solving a computer problem, or writing source code, or innovating new programs, algorithms are required. Knowing the fact, we have launched this course for better learning of all the concepts revolving around data structures and algorithms.

What you’ll learn
  • Introduction
  • All the aspects of arrays, lists and big o time space asymptomatic analysis
  • About linked lists, coding linked lists, linked list class, get at index, remove at index, add at index and others
  • Introduction to stacks, its implementation, stack out of linked list, stack out of array, balance parenthesis challenge, balance parenthesis solution, condense challenge, condense inefficient solution, condense efficient solution
  • Introduction to queues, its implementation, Josephus challenge, Josephus solution, sieve of Eratosthenes challenge and its solution
  • Recursion and Trees

Covering Topics

1
Section 1 : introduction
2
Section 2 : Arrays
3
Section 3 : Lists
4
Section 4 : Big o Time Space Asymptotic Analysis
5
Section 5 : Linked Lists
6
Section 6 : Stacks
7
Section 7 : Queues
8
Section 8 : Recursion
9
Section 9 : Trees
10
Section 10 : Hash Maps

Curriculum

      Section 1 : introduction
1
Introduction
      Section 2 : Arrays
2
Arrays vs Lists
3
Common Array Iterations
4
Pairwise Array Comparisons
5
Array Functions Preview
6
Searching Arrays
7
Is Sorted Challenge
8
Is Sorted Solution
9
2d Arrays Preview
10
Iterating Over 2d Arrays
11
2d Bounds Checking
12
Minesweeper Challenge
13
Minesweeper Solution
14
Tally Sort Challenge
15
Tally Sort Solution
      Section 3 : Lists
16
Lists Out of Arrays Preview
17
Implementing List Push and Grow
18
Implementing List Remove
19
Implement List Insert
20
List Contains Challenge
21
List Contains Solution
22
List Get and Set
23
Concat Challenge
24
Concat Solution
      Section 4 : Big o Time Space Asymptotic Analysis
25
Intro to Big o
26
Big o of n Squared
27
Timing Big o of one Versus n Versus n Squared
28
No Constants- n Big o Notation
29
Big o Challenge
30
Big o Solution
      Section 5 : Linked Lists
31
Linked Lists
32
Coding Linked Lists
33
Linked List Manipulation Challenge
34
Linked List Manipulation Solution
35
Linked List Class
36
Get at Index
37
Remove at Index
38
Add at Index
39
Summarizing Arrays vs Linked Lists
40
Prefer Manipulating Pointers to Copying Data
      Section 6 : Stacks
41
Intro to Stacks
42
Stack Implementations
43
Stack out of Linked List
44
Stack out of Array
45
Balance Parenthesis Challenge
46
Balance Parenthesis Solution
47
Paren Bracket Curly Balance Challenge
48
Paren Bracket Curly Balance Solution
49
Condense Challenge
50
Condense Inefficient Solution
51
Condense Efficient Solution
      Section 7 : Queues
52
Intro to Queues
53
Implementing a Queue
54
Josephus Challenge
55
Josephus Solution
56
Sieve of Eratosthenes Challenge
57
Sieve of Eratosthenes Solution
58
Native js Arrays Stacks and Queues
      Section 8 : Recursion
59
Intro to Recursion
60
Recursive Fibonacci
61
Palindrome Challenge
62
Palindrome Hints
63
Palindrome Solution
64
Palindrome Bonus
      Section 9 : Trees
65
Intro to Trees
66
Iterating Over Trees
67
Tree Sum Challenge
68
Tree Sum Solution
69
Tree Contains Challenge
70
Tree Contains Solution
71
Tree Size Leaves Challenge
72
Tree Size Leaves Solution
73
Tree Min Max Height Challenge
74
Tree Min Max Height Solution
75
Binary Search Trees
76
Binary Search Tree Add
77
Binay Search Tree Contains Challenge
78
Binary Search Tree Contains Solution
79
Unbalanced Binary Search Trees
80
Morse Code Challenge
81
Morse Code Solution
      Section 10 : Hash Maps
82
Intro to Hash Maps
83
Handling Collisions with Linear Probing
84
Handling Collisions by Chaining Linked Lists
85
Coding Linked List Collisions

Frequently Asked Questions

It is an online tutorial that covers a specific part of a topic in several sections. An Expert teaches the students with theoretical knowledge as well as with practical examples which makes it easy for students to understand.

A Course helps the user understand a specific part of a concept. While a path and E-Degrees are broader aspects and help the user understand more than just a small area of the concept.

A Course will help you understand any particular topic. For instance, if you are a beginner and want to learn about the basics of any topic in a fluent manner within a short period of time, a Course would be best for you to choose.

We have an inbuilt question-answer system to help you with your queries. Our support staff will be answering all your questions regarding the content of the Course.