Your 2nd JavaScript Course: Advanced Concepts and Algorithms


Updated on

Course overview

Course type
Paid course
10 hours
199 lessons
Available on completion
Course author
OnlyKiosk Tech
  • Understand how JavaScript works: queue, stack, heap, stack overflow, event loop, task queue, etc.
  • Master ES6 new syntaxes: let, map, set, Symbol, iterator, generator, reflect, promise, proxy, etc.
  • Destructuring assignment
  • Completely understand the JavaScript inheritance and the prototype chain
  • ES6 Module and CommonJS
  • Constructors and classes
  • Real-life creative ways of designing constructors and inheritance programs
  • The strict mode
  • Tail call optimization
  • Recursion
  • Deep and shallow object copy
  • Two-way data binding
  • Data structure
  • Sorting algorithms


Advanced Topics: ES6, Promise, Async Await, Arrow Function, Prototype Chain, Data Structure, Sorting Algorithms

About this course:

This is a JavaScript enhancement course, designed to help junior JavaScript developers gain a wider and deeper understanding of JavaScript.

If you want to take the leap from a junior JavaScript developer to a senior one, then you have found the right course.

What you will learn: 

You will learn ES6 new features like destructuring assignment, async/await, reflect, proxy, symbol, iterator, generator, etc.

Then you will learn the JavaScript object system and prototypal inheritance in the most detailed way. You will learn every methods the Object constructor has.

To completely understand how JavaScript works, you will learn advanced topics like thread, process, stack, queue, heap, task queue, event loop, recursion, deep and shallow object copy, etc.

To further boost your coding skills, you will also learn 8 sorting algorithms: bubble sorting, cocktail sorting, quick sorting, counting sorting, insertion sorting, bucket sorting, selection sorting and heap sorting.

You will also develop a proper understanding of linear and non-linear data structures, including array, linked list, binary search tree, max heap, min heap, etc.

What you will achieve:

After this course, you will develop a solid JavaScript knowledge base and most importantly, gain a deep understanding of how JavaScript works under the hood. These knowledge can help you create more efficient programs and succeed in job interviews.

If you need to learn JS frameworks like Vue, React, Angular, a solid knowledge foundation in JavaScript can tremendously accelerate your study.

Throughout the course, you will also learn how to answer questions that are frequently seen in job interviews.

Content highlights:

  • Lecture 1, 2: Everything you need to know about var and let [FREE Preview]

  • Lecture 6: Priority comparison: variable name, function name and argument name

  • Lecture 9, 10: Higher-order function and currying

  • Lecture 11, 12: Closure and its real-life application [FREE Preview]

  • Lecture 68, 69, 70, 71: The JavaScript prototype chain

  • Lecture 85: two-way data binding

  • Lecture 103: Data structure: Queue, Stack and Heap  [FREE Preview]

  • Lecture 104: Thread and Process, sync and async, blocking and non-blocking

  • Lecture 105: Recursion and stack overflow

  • Lecture 107: Event loop

  • Lecture 108: Interview challenges: predict the result of the following programs using event loop, marco and micro task queue

  • Lecture 110, 111: tail call optimization

  • Lecture 114, 115, 116, 117: creative inheritance program design

  • Lecture 120, 121: 'Deep' copy and assign objects

  • Lecture 122, 123: JavaScript garbage collection, reference count and the mark-and-sweep algorithm

  • Lecture 124, 125, 126, 127: Basic computing knowledge: bit, byte, memory address, byte addressing, bit width, encoding

  • Lecture 142, 153, 144: Type coercion, wrapper object, explicit and implicit typecasting

  • Lecture 151-163: Bubble sorting

  • Lecture 164, 165: Cocktail sorting

  • Lecture 166, 167: Quick sorting

  • Lecture 168, 169, 170, 171: Counting sorting

  • Lecture 172, 173: Insertion sorting

  • Lecture 174. 175: Bucket sorting

  • Lecture 176, 177: Selection sorting

  • Lecture 178: Time and space complexity and the big O notation

  • Lecture 179, 180: Linear and non-linear data structures: array, linked list, binary search tree, max heap, min heap, etc.

  • Lecture 181, 182, 183, 184: binary heap and heap sorting

  • Lecture 185, 186, 187: the Observer pattern and two-way data binding using the Observer pattern

  • Please Note: This is NOT a beginner course and does not cover JS DOM and jQuery.

    Similar courses

    JavaScript: Understanding the Weird Parts
    • 12 hours
    • 88 lessons
    • Certificate
    Modern JavaScript From The Beginning
    • 22 hours
    • 122 lessons
    • Certificate
    Your 2nd JavaScript Course: Advanced Concepts and Algorithms
    • English language

    • Recommended provider

    • Certificate available