Course Features

Price

Original price was: ر.س2,506.39.Current price is: ر.س76.68.

Study Method

Online | Self-paced

Course Format

Reading Material - PDF, article

Duration

19 hours, 44 minutes

Qualification

No formal qualification

Certificate

At completion

Additional info

Coming soon

Overview

Over View
Who is this course for
Requirments
Career Path

Who is this course for?

Over View
Who is this course for
Requirments
Career Path

Requirements

Over View
Who is this course for
Requirments
Career Path

Career path

Over View
Who is this course for
Requirments
Career Path

    • Course Introduction & Overview (Watch) 00:10:00
    • Using the Code Editor 00:10:00
    • Big O Notation Introduction 00:10:00
    • Big O Worst Case Analysis 00:10:00
    • Big O Linear Complexity: O(n) 00:10:00
    • Simplifying Big O: Dropping Constants 00:10:00
    • Quadratic Complexity: O(n²) 00:10:00
    • Dropping Non-Dominant Terms in Big O 00:10:00
    • Constant Time Complexity: O(1) 00:10:00
    • Logarithmic Complexity: O(log n) 00:10:00
    • Understanding Input Terms in Big O 00:10:00
    • Big O for Array Lists 00:10:00
    • Big O Notation Summary & Wrap Up 00:10:00
    • Introduction to Classes 00:10:00
    • Understanding Pointers in Java 00:10:00
    • Linked Lists Overview 00:10:00
    • Welcome & Course Roadmap 00:10:00
    • Linked List Big O Complexity 00:10:00
    • How Linked Lists Work Under the Hood 00:10:00
    • Linked List Constructor 00:10:00
    • Coding Exercises: Linked Lists (Important) 00:10:00
    • Printing a Linked List 00:10:00
    • Appending Nodes to a Linked List 00:10:00
    • Removing Last Node: Introduction 00:10:00
    • Removing Last Node: Code Implementation 00:10:00
    • Prepending Nodes to a Linked List 00:10:00
    • Removing First Node 00:10:00
    • Accessing Nodes with Get 00:10:00
    • Setting Node Values 00:10:00
    • Inserting Nodes at Position 00:10:00
    • Removing Nodes at Position 00:10:00
    • Reversing a Linked List 00:10:00
    • Doubly Linked List Constructor 00:10:00
    • Appending Nodes in Doubly Linked Lists 00:10:00
    • Removing Last Node in Doubly Linked Lists 00:10:00
    • Prepending Nodes in Doubly Linked Lists 00:10:00
    • Removing First Node 00:10:00
    • Getting Nodes 00:10:00
    • Setting Node Values 00:10:00
    • Inserting Nodes 00:10:00
    • Removing Nodes 00:19:00
    • Introduction to Stacks 00:10:00
    • Stack Constructor 00:10:00
    • Stack Push Operation 00:10:00
    • Stack Pop Operation 00:10:00
    • Introduction to Queues 00:10:00
    • Queue Constructor 00:10:00
    • Queue Enqueue Operation 00:10:00
    • Queue Dequeue Operation 00:10:00
    • Introduction to Trees and Terminology 00:10:00
    • Binary Search Trees (BST) Example 00:10:00
    • BST Big O Complexity 00:10:00
    • BST Constructor 00:10:00
    • BST Insert – Introduction 00:10:00
    • BST Insert – Code Implementation 00:10:00
    • BST Contains – Introduction 00:10:00
    • BST Contains – Code Implementation 00:10:00
    • Introduction to Hash Tables 00:10:00
    • Handling Collisions in Hash Tables 00:10:00
    • Hash Table Constructor 00:10:00
    • Hash Methods Explained 00:10:00
    • Hash Table Set Operation 00:10:00
    • Retrieving Keys from Hash Tables 00:10:00
    • Understanding Hash Tables – The Get Operation 00:10:00
    • Hash Table Big O Complexity 00:10:00
    • Hash Table Interview Question Practice 00:10:00
    • Introduction to Graphs 00:10:00
    • Graph Representation: Adjacency Matrix 00:10:00
    • Graph Representation: Adjacency List 00:10:00
    • Graph Big O Complexity 00:10:00
    • Adding Vertices to Graph 00:10:00
    • Adding Edges to Graph 00:10:00
    • Removing Edges 00:10:00
    • Removing Vertices 00:10:00
    • Introduction to Recursion 00:10:00
    • Understanding the Call Stack 00:10:00
    • Factorial Example Using Recursion 00:10:00
    • Recursive BST Contains 00:10:00
    • Recursive BST Insert 00:10:00
    • Recursive BST Delete – Introduction 00:10:00
    • Recursive BST Delete Code (Part 1 of 3) 00:10:00
    • Recursive BST Delete Code (Part 2 of 3) 00:10:00
    • Recursive BST Minimum Value Finder 00:10:00
    • Recursive BST Delete Code (Part 3 of 3) 00:10:00
    • Introduction to Bubble Sort 00:10:00
    • Bubble Sort Code Implementation 00:10:00
    • Introduction to Selection Sort 00:10:00
    • Selection Sort Code Implementation 00:10:00
    • Introduction to Insertion Sort 00:10:00
    • Insertion Sort Code Implementation 00:10:00
    • Insertion Sort Big O Complexity 00:10:00
    • Overview of Merge Sort 00:10:00
    • Merge Function Explained 00:10:00
    • Merge Function Code Implementation 00:10:00
    • Merge Sort Algorithm Introduction 00:10:00
    • Merge Sort Code Implementation 00:10:00
    • Merge Sort Big O Complexity 00:10:00
    • Introduction to Quick Sort 00:10:00
    • Pivot Concept in Quick Sort 00:10:00
    • Pivot Code Implementation 00:10:00
    • Quick Sort Algorithm Code 00:10:00
    • Quick Sort Big O Complexity 00:10:00
    • Introduction to Tree Traversal 00:10:00
    • Breadth First Search (BFS) Introduction 00:10:00
    • BFS Code Implementation 00:10:00
    • Depth First Search (DFS) PreOrder – Introduction 00:10:00
    • DFS PreOrder Code Implementation 00:10:00
    • DFS PostOrder – Introduction 00:10:00
    • DFS PostOrder Code Implementation 00:10:00
    • DFS InOrder – Introduction 00:10:00
    • DFS InOrder Code Implementation 00:10:00
    • Exam of Java Data Structures & Algorithms: Mastering Core Concepts and Coding 00:50:00
    • Premium Certificate 00:15:00
certificate-new

No Reviews found for this course.

Yes, our premium certificate and transcript are widely recognized and accepted by embassies worldwide, particularly by the UK embassy. This adds credibility to your qualification and enhances its value for professional and academic purposes.

Yes, this course is designed for learners of all levels, including beginners. The content is structured to provide step-by-step guidance, ensuring that even those with no prior experience can follow along and gain valuable knowledge.

Yes, professionals will also benefit from this course. It covers advanced concepts, practical applications, and industry insights that can help enhance existing skills and knowledge. Whether you are looking to refine your expertise or expand your qualifications, this course provides valuable learning.

No, you have lifetime access to the course. Once enrolled, you can revisit the materials at any time as long as the course remains available. Additionally, we regularly update our content to ensure it stays relevant and up to date.

I trust you’re in good health. Your free certificate can be located in the Achievement section. The option to purchase a CPD certificate is available but entirely optional, and you may choose to skip it. Please be aware that it’s crucial to click the “Complete” button to ensure the certificate is generated, as this process is entirely automated.

Yes, the course includes both assessments and assignments. Your final marks will be determined by a combination of 20% from assignments and 80% from assessments. These evaluations are designed to test your understanding and ensure you have grasped the key concepts effectively.

We are a recognized course provider with CPD, UKRLP, and AOHT membership. The logos of these accreditation bodies will be featured on your premium certificate and transcript, ensuring credibility and professional recognition.

Yes, you will receive a free digital certificate automatically once you complete the course. If you would like a premium CPD-accredited certificate, either in digital or physical format, you can upgrade for a small fee.

Course Features

Price

Original price was: ر.س2,506.39.Current price is: ر.س76.68.

Study Method

Online | Self-paced

Course Format

Reading Material - PDF, article

Duration

19 hours, 44 minutes

Qualification

No formal qualification

Certificate

At completion

Additional info

Coming soon

Share This Course