- Course Highlights
Gain the skills and credentials to kickstart a successful career and learn from the experts with this step-by-step training course. This Data Structures : Easy to Advanced has been specially designed to help learners gain a good command of Data Structures : Easy to Advanced, providing them with a solid foundation of knowledge to become a qualified professional.
Through this Data Structures : Easy to Advanced, you will gain both practical and theoretical understanding of Data Structures : Easy to Advanced that will increase your employability in this field, help you stand out from the competition and boost your earning potential in no time.
Not only that, but this training includes up-to-date knowledge and techniques that will ensure you have the most in-demand skills to rise to the top of the industry. This qualification is fully accredited, broken down into several manageable modules, ideal for aspiring professionals.
Course Curriculum
| Unit 01 : Introduction | |||
| Module 01: Promo Video | 00:02:00 | ||
| Module 02: Data Structure Introduction | 00:05:00 | ||
| Module 03: Computational Complexity Analysis | 00:13:00 | ||
| Unit 02 : Arrays | |||
| Module 01: Static and Dynamic Arrays | 00:12:00 | ||
| Module 02: Dynamic Arrays Source Code | 00:07:00 | ||
| Unit 03 : Liked List | |||
| Module 01: Singly and Doubly Linked Lists | 00:15:00 | ||
| Module 02: Doubly Linked Lists Source Code | 00:10:00 | ||
| Unit 04 : Stack | |||
| Module 01: Stack | 00:12:00 | ||
| Module 02: Stack Implementation | 00:04:00 | ||
| Unit 05 : Queues | |||
| Module 01: Queues (Part-1) | 00:06:00 | ||
| Module 02: Queues (Part-2) | 00:06:00 | ||
| Module 03: Queue Source Code | 00:04:00 | ||
| Unit 06 : Priority Queues (PQs) | |||
| Module 01: Priority Queues (PQs) with an interlude on heaps | 00:13:00 | ||
| Module 02: Turning Min PQ into Max PQ | 00:06:00 | ||
| Module 03: Adding Elements to Binary Heap | 00:10:00 | ||
| Module 04: Removing Elements from Binary Heap | 00:14:00 | ||
| Module 05: Priority Queue Binary Heap Source Code | 00:16:00 | ||
| Unit 07 : Union Find | |||
| Module 01: Disjoint Set | 00:06:00 | ||
| Module 02: Kruskal’s Algorithm | 00:06:00 | ||
| Module 03: Union and Find Operations | 00:11:00 | ||
| Module 04: Path Compression Union Find | 00:07:00 | ||
| Module 05: Union Find Source Code | 00:08:00 | ||
| Unit 08 : Binary Search Trees | |||
| Module 01: Binary Trees and Binary Search Trees (BST) | 00:13:00 | ||
| Module 02: Inserting Element into a Binary Search Tree (BST) | 00:06:00 | ||
| Module 03: Removing Element from a Binary Search Tree (BST) | 00:14:00 | ||
| Module 04: Tree Traversals | 00:12:00 | ||
| Module 05: Binary Search Source Code | 00:13:00 | ||
| Unit 09 : Fenwick Tree | |||
| Module 01: Fenwick Tree Construction | 00:06:00 | ||
| Module 02: Point Updates | 00:06:00 | ||
| Module 03: Binary Indexed Tree | 00:14:00 | ||
| Module 04: Fenwick Tree Source Code | 00:06:00 | ||
| Unit 10 : Hash Tables | |||
| Module 01: Hash Table | 00:17:00 | ||
| Module 02: Separate Chaining | 00:08:00 | ||
| Module 03: Separate Chaining Source Code | 00:12:00 | ||
| Module 04: Open Addressing | 00:11:00 | ||
| Module 05: Linear Probing | 00:14:00 | ||
| Module 06: Quadratic Probing | 00:09:00 | ||
| Module 07: Double Hashing | 00:15:00 | ||
| Module 08: Removing Element Open Addressing | 00:08:00 | ||
| Module 09: Open Addressing Code | 00:15:00 | ||
| Unit 11 : Suffix Array | |||
| Module 01: Introduction | 00:03:00 | ||
| Module 02: The Longest Common Prefix (LCP) Array | 00:03:00 | ||
| Module 03: Using SA/LCP Array to Find Unique Substrings | 00:05:00 | ||
| Module 04: Longest Common Substring (LCS) | 00:11:00 | ||
| Module 05: Longest Common Substring (LCS) Full Example | 00:07:00 | ||
| Module 06: Longest Repeated Substring (LRS) | 00:05:00 | ||
| Unit 12 : AVL Trees | |||
| Module 01: Balanced Binary Search Trees (BBSTs) | 00:09:00 | ||
| Module 02: Inserting Elements into an AVL Tree | 00:10:00 | ||
| Module 03: Removing an AVL Tree | 00:09:00 | ||
| Module 04: AVL Tree Source Code | 00:17:00 | ||
| Unit 13 : Indexed Priority Queue | |||
| Module 01: Indexed Priority Queue (Part-1) | 00:25:00 | ||
| Module 02: Indexed Priority Queue Source Code | 00:09:00 | ||
| Unit 14 : Sparse Tables | |||
| Module 01: Sparse Table | 00:26:00 | ||
| Module 02: Sparse Table Source Code | 00:07:00 | ||
Don't just take our word for it
Amazing workshop.
Very informative for the freshers like me. Learned a lot of things about digital marketing. I'm really thankful.
Aarini Sinha 
It was a great experience. The course was jampacked with excellent information. And when I needed help, Skill-up helped me with technical problems instantly. Fast feedback.
Varsha Sivamohan 
I am currently signed on to several courses with skill up. I have just finished my second one. The courses are informative and good for all types of learners. I recommend them.
Judith Taylor 
The support team was FANTASTIC!!! Very quick to respond and even though I was nervous as I am not good at tests, they made me feel comfortable.
I am very grateful for the support
Charlie Anderson 
Completed the Level 3 Mental Health Support Worker course, very good and highly recommend it.
Very good course, enjoyed it thoroughly and important in my line of work as a Support worker.
Parmjit Dosanjh 
I am pleased to have completed my online course in Mental Health First Aid with SkillUp. All the modules were detailed & comprehensive with review questions, which really helped me to grasp the information & prepared me well for the mock test & final exam.
Shan 