|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/javascript-boost/
课程评论：没有评论
课程名称：第二个JavaScript课程 课程概述：本课程旨在帮助初级JavaScript开发者更深入和更广泛地理解JavaScript。通过本课程，学员将学习ES6的新特性，包括解构赋值、async/await、reflect、proxy、symbol、iterator、generator等。课程详细讲解JavaScript的对象系统和原型继承，涵盖Object构造函数的所有方法。此外，学员将深入了解JavaScript的运行机制，包括线程、进程、栈、队列、堆、任务队列、事件循环、递归、深浅拷贝等高级话题。为了进一步提升编码能力，课程还讲解了八种排序算法：冒泡排序、鸡尾酒排序、快速排序、计数排序、插入排序、桶排序、选择排序和堆排序，此外，学员将掌握线性和非线性数据结构的知识，包括数组、链表、二叉搜索树、最大堆和最小堆等。 课程成果：完成本课程后，学员将具备扎实的JavaScript知识，并深刻理解JavaScript的底层工作原理。这些知识将帮助学员编写更高效的程序，并在求职面试中取得成功。如果学习JavaScript框架如Vue、React和Angular，扎实的JavaScript基础将大大加速学习过程。课程还将教授学员如何回答常见的面试问题。 课程内容亮点： - 讲座1、2：关于var和let的所有知识（免费预览） - 讲座6：变量名、函数名和参数名的优先级比较 - 讲座9、10：高阶函数与柯里化 - 讲座11、12：闭包及其实际应用（免费预览） - 讲座68-71：JavaScript原型链 - 讲座85：双向数据绑定 - 讲座103：数据结构：队列、栈和堆（免费预览） - 讲座104：线程与进程、同步与异步、阻塞与非阻塞 - 讲座105：递归与栈溢出 - 讲座107：事件循环 - 讲座108：面试挑战：使用事件循环、宏任务和微任务队列预测程序结果 - 讲座110、111：尾调用优化 - 讲座114-117：创意继承程序设计 - 讲座120-123：深拷贝与对象赋值、JavaScript垃圾回收、引用计数与标记-清扫算法 - 讲座124-127：基本计算知识：比特、字节、内存地址等 - 讲座142、153、144：类型强制转换、包装对象、显式与隐式类型转换 - 讲座151-163：冒泡排序 - 讲座164、165：鸡尾酒排序 - 讲座166、167：快速排序 - 讲座168-171：计数排序 - 讲座172、173：插入排序 - 讲座174、175：桶排序 - 讲座176、177：选择排序 - 讲座178：时间与空间复杂度及大O表示法 - 讲座179-184：线性与非线性数据结构：数组、链表、二叉搜索树、最大堆、最小堆等 - 讲座185-187：观察者模式与基于观察者模式的双向数据绑定 请注意：本课程不是初学者课程，不涉及JS DOM和jQuery。
This is the course that scratches the itch!This is a JavaScript enhancement course, designed to help junior JavaScript developers gain a wider and deeper understanding of JavaScript. 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 method 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. This knowledge can help you create more efficient programs and succeed in job interviews. If you need to learn JS frameworks like Vue, React, and 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 nameLecture 9, 10: Higher-order function and curryingLecture 11, 12: Closure and its real-life application [FREE Preview]Lecture 68, 69, 70, 71: The JavaScript prototype chainLecture 85: two-way data bindingLecture 103: Data structure: Queue, Stack, and Heap [FREE Preview]Lecture 104: Thread and Process, sync and async, blocking and non-blockingLecture 105: Recursion and stack overflowLecture 107: Event loopLecture 108: Interview challenges: predict the result of the following programs using event loop, macro and micro task queueLecture 110, 111: tail call optimizationLecture 114, 115, 116, 117: creative inheritance program designLecture 120, 121: 'Deep' copy and assign objectsLecture 122, 123: JavaScript garbage collection, reference count, and the mark-and-sweep algorithmLecture 124, 125, 126, 127: Basic computing knowledge: bit, byte, memory address, byte addressing, bit width, encodingLecture 142, 153, 144: Type coercion, wrapper object, explicit and implicit typecasting Lecture 151-163: Bubble sortingLecture 164, 165: Cocktail sortingLecture 166, 167: Quick sortingLecture 168, 169, 170, 171: Counting sortingLecture 172, 173: Insertion sortingLecture 174. 175: Bucket sortingLecture 176, 177: Selection sortingLecture 178: Time and space complexity and the big O notationLecture 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 sortingLecture 185, 186, 187: the Observer pattern and two-way data binding using the Observer patternPlease Note: This is NOT a beginner course and does not cover JS DOM and jQuery.
