Non-majors catching up with majors - Data Structures (with JavaScript)

What do computer science majors learn differently?
Even non-major developers can learn with the lectures 😎

If you've ever had these concerns, pay attention!

Is computer science knowledge only for those who majored in it?
Anyone, even non-majors, can learn it!

Algorithms are really emphasized a lot because of coding tests! Data structures are a prerequisite subject that you must know when studying algorithms. Various structures used in algorithms such as stacks, queues, trees, and graphs are called data structures. If you know efficient data structures, the algorithms that use them are bound to be efficient!

Non-majors who have not studied computer science often think that majors already know something great. However , if they study step by step, non-majors can acquire specialized knowledge just as much as computer science majors . I will teach you only the core knowledge necessary for practical work.

If you can't answer 'yes' to any of the three questions below, then join this course!

• ✅ Can you implement stacks, queues, heaps, trees, and graphs directly in JavaScript?
• ✅ Do you know how to quickly calculate time complexity?
• ✅ Do you know which data structure is the most effective when inserting, modifying, deleting, and retrieving data?

I recommend this to these people 🙆‍♀️

_{Job seekers studying algorithms for coding tests}

_{People who are hesitant to learn data structures in a language other than JavaScript}

_{People who want to know only the data structures frequently used in practice among the major subjects}

Four key strengths unique to this course!

We provide lecture notes

We are releasing a lecture summary through GitHub . If you don't understand something or want to review it, please refer to the lecture notes!

Lectures conducted using JavaScript

Are you uncomfortable with the data structure/algorithm lectures being in different languages each time? The class is conducted in JavaScript. The code is also included in the textbook.

Active learning through questions and answers

The advantage of my lecture is Q&A. If you have a question, I will answer it within 48 hours. Feel free to ask questions about the lecture and study. It will help you understand the content more!

We are revising our classes or updating and supplementing them through news to answer frequently asked questions from our students.

Less burden, faster understanding

We will focus on data structures so that you can skip the math and quickly move on to algorithms. Save time by learning the essential content effectively!

Learn things like this 📚

_{Time/Space Complexity Analysis Method}

_{Principles and implementation of stack, queue, tree, graph, and hash table data structures}

_{Analysis and comparison of pros and cons and features of each data structure}

_{Simple algorithms like recursion, heap sort, DFS, BFS, traversal, etc.}

Q&A 💬