❗The content presented here is sourced directly from Udemy platform. For comprehensive course details, including enrollment information, simply click on the 'Go to class' link on our website.

Updated in [August 18th, 2023]

Skills and Knowledge:
By taking this course, you will acquire skills and knowledge in analyzing algorithms such as sorting, searching, and graph algorithms, as well as reducing code complexity from one Big-O level to another. You will also learn different types of data structures and how to find Big-O for each data structure, as well as how to apply the correct data structure to a problem in Java. Additionally, you will learn how to analyze problems using dynamic programming and discuss code complexity in different algorithms such as sorting algorithms, searching algorithms, and graph algorithms. Finally, you will gain an understanding of data structures such as dynamic arrays, linked lists, stacks, queues, and hash tables.
Professional Growth:
This course provides an opportunity for professional growth by teaching the fundamentals of data structures and algorithms. It covers topics such as sorting, searching, graph algorithms, code complexity, dynamic programming, and data structures such as dynamic arrays, linked lists, stacks, queues, and hash tables. By the end of the course, students will have the knowledge and skills to write code that runs faster and uses less memory, as well as the ability to analyze problems using dynamic programming. This course also provides real interview questions to help students prepare for software engineering interviews.
Further Education:
This course is suitable for preparing further education as it covers a wide range of topics related to data structures and algorithms. It provides an in-depth look at sorting, searching, and graph algorithms, as well as data structures such as dynamic arrays, linked lists, stacks, queues, and hash tables. Additionally, the course covers code complexity in different algorithms and provides real interview questions to help students prepare for software engineering interviews.

Course Syllabus

Introduction and Settings

Code Complexity

Data Structure: Arrays

Data Structure: LinkedList

Data Structure: Hash Table

Data Structure: Stack

Data Structure: Queue

Data Structure: Heap

Data Struture: Trie

Recursion

Collections In Java

Searching Algorithms

Sorting Algorithms

Tree Theory (Binary Tree, Binary Search Tree, and Red-Black Tree)

Graph Theory (DFS, BFS)

Short Path in Graph Theory

Dynamic Programming

NP Complete problems