Data Structures Complete Course

Description

This comprehensive course on Data Structures Complete Course will deepen your understanding on this topic.

After successful completion of this course you can acquire the required skills in this sector. This Data Structures Complete Course comes with accredited certification, which will enhance your CV and make you worthy in the job market.

So enrol in this course today to fast track your career ladder.

You may have to take a quiz or a written test online during or after the course. After successfully completing the course, you will be eligible for the certificate.

There is no experience or previous qualifications required for enrolment on this Data Structures Complete Course. It is available to all students, of all academic backgrounds.

Our Data Structures Complete Course is fully compatible with PC's, Mac's, Laptop, Tablet and Smartphone devices. This course has been designed to be fully compatible with tablets and smartphones so you can access your course on Wi-Fi, 3G or 4G.

There is no time limit for completing this course, it can be studied in your own time at your own pace.

Having these various qualifications will increase the value in your CV and open you up to multiple sectors such as Business & Management, Admin, Accountancy & Finance, Secretarial & PA, Teaching & Mentoring etc.

14 sections • 55 lectures • 09:02:00 total length

•Module 01: Promo Video: 00:02:00

•Module 02: Data Structure Introduction: 00:05:00

•Module 03: Computational Complexity Analysis: 00:13:00

•Module 01: Static and Dynamic Arrays: 00:12:00

•Module 02: Dynamic Arrays Source Code: 00:07:00

•Module 01: Singly and Doubly Linked Lists: 00:15:00

•Module 02: Doubly Linked Lists Source Code: 00:10:00

•Module 01: Stack: 00:12:00

•Module 02: Stack Implementation: 00:04:00

•Module 03: Stack Source Code: 00:04:00

•Module 01: Queues (Part-1): 00:06:00

•Module 02: Queues (Part-2): 00:06:00

•Module 03: Queue Source Code: 00:04:00

•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

•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

•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

•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

•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

•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

•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

•Module 01: Indexed Priority Queue (Part-1): 00:25:00

•Module 02: Indexed Priority Queue Source Code: 00:09:00

•Module 01: Sparse Table: 00:26:00

•Module 02: Sparse Table Source Code: 00:07:00