Unlock Knowledge for Less! Get 10% off on all online courses with code GH7D7Z !
• 0

### What you'll get

• Job Credibility
• Certification Valid for Life
• On-demand video*
• E-Book
• Self-Paced Learning
• Certificate of Completion

### Exam details

• Mode of Exam : Online
• Duration : 1 Hour
• Multiple Choice Questions are asked
• No. of Questions are asked : 50
• Passing Marks : 25 (50%)
• There is no negative marking

Learn Data Structures in JavaScript and Get Certified with us. What you going to learn in this course is the basic of data structures and JavaScript Programming Language. For in-depth information of the course and its topics, you can navigate below to see complete syllabus of the course. you will be taught each and every topic mentioned in the syllabus.

If you want to learn data structures with algorithms, then You can also see course like C# Data Structures and algorithms

### Who Can take this course?

Everyone who is keen to learn programming, can take this or this type of course, and can enhance his/her skill with govt approved certification.

### Course Content

Total: 47 lectures
• Course Outline
• Arrays vs Lists
• Common Array Iterations
• Pairwise Array Comparisons
• Array Functions
• Searching Arrays
• Two Dimensional (2D) Arrays
• Iterating Over Two Dimensional Arrays
• Lists Out of Arrays
• Implementing List Push and Grow Functions
• Implementing List Remove
• Implement List Insert
• List Get and Set
• Introduction to Big O
• Big O of N-Squared
• Timing Big O of One Versus N Versus N-Squared
• No Constants- N Big O Notation
• Get at Index
• Remove at Index
• Introduction to Stacks
• Stack Implementations
• Stack Out of Linked List
• Stack Out of Array
• Introduction to Queues
• Implementing a Queue
• Native JavaScript (JS) Arrays Stacks and Queues
• Introduction to Recursion
• Recursive Fibonacci
• The Palindrome Challenge
• Palindrome Hints
• The Palindrome Solution
• Introduction to Trees
• Iterating Over Trees
• Binary Search Trees
• Unbalanced Binary Search Trees
• Introduction to Hash Maps
• Handling Collisions with Linear Probing
• Handling Collisions by Chaining Linked Lists
• Introduction to Graphs
• Coding a Graph Class
• Breadth First and Depth First Traversals