The Complete Data Structures & Algorithms Course in C & Java

The Complete Data Structures & Algorithms Course in C & Java, available at $59.99, has an average rating of 3.8, with 250 lectures, based on 37 reviews, and has 363 subscribers.

You will learn about Master coding interviews given by some of the top tech companies Learn, implement, and use different Data Structures Become a better developer by mastering tricky Data Structures and Algorithms Learn, implement and use different Algorithms Become more confident and prepared for your next coding interview Professionally handle offers and negotiate raises This course is ideal for individuals who are Self-taught programmers or Computer science student or anyone preparing for coding interviews It is particularly useful for Self-taught programmers or Computer science student or anyone preparing for coding interviews.

Enroll now: The Complete Data Structures & Algorithms Course in C & Java

Summary

Title: The Complete Data Structures & Algorithms Course in C & Java

Price: $59.99

Average Rating: 3.8

Number of Lectures: 250

Number of Published Lectures: 250

Number of Curriculum Items: 250

Number of Published Curriculum Objects: 250

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

Master coding interviews given by some of the top tech companies
Learn, implement, and use different Data Structures
Become a better developer by mastering tricky Data Structures and Algorithms
Learn, implement and use different Algorithms
Become more confident and prepared for your next coding interview
Professionally handle offers and negotiate raises

Who Should Attend

Self-taught programmers
Computer science student
anyone preparing for coding interviews

Target Audiences

Self-taught programmers
Computer science student
anyone preparing for coding interviews

Want to land a job at a great tech company like Google, Microsoft, Facebook, Netflix, Amazon, or other companies but you are intimidated by the interview process and the coding questions? Do you find yourself feeling like you get “stuck” every time you get asked a coding question? This course is your answer. Using the strategies, lessons, and exercises in this course, you will learn how to land offers from all sorts of companies.

Many developers who are “self taught”, feel that one of the main disadvantages they face compared to college educated graduates in computer science is the fact that they don’t have knowledge about algorithms, data structures and the notorious Big-O Notation. Get on the same level as someone with computer science degree by learning the fundamental building blocks of computer science which will give you a big boost during interviews. You will also get access to our private online chat community with thousands of developers online to help you get through the course.

Here is what you will learn in this course:

1. Big O notation
2. Data structures:
* Arrays
* Hash Tables
* Singly Linked Lists
* Doubly Linked Lists
* Queues
* Stacks
* Trees (BST, AVL Trees, Binary Heaps)
* Tries
* Graphs

3. Algorithms:

* Recursion
* Sorting
* Searching
* Tree Traversal
* Breadth First Search
* Depth First Search
* Dynamic Programming

Unlike most instructors, I am not a marketer or a salesperson. I am a senior developer and programmer who has worked and managed teams of engineers and have been in these interviews both as an interviewee as well as the interviewer.

My job as an instructor will be successful if I am able to help you become better at interviewing and land more jobs. This one skill can really change the course of your career and I hope you sign up today to see what it can do for your career!

Taught by:

Abbass Masri is the instructor of the highest rated Android App Development course on Udemy as well as one of the fastest growing.His graduates have moved on to work for some of the biggest tech companies around the world like Apple, Google, JP Morgan, IBM, etc…

Also, he is running a successful app on playstore that teaches around 1,000,000 users coding in many languages like: Android, Java, C++, Python, Arduino, and more.. Please check it here on playstore: “Master Coding App”

Abbass promises you that there are no other courses out there as comprehensive and as well explained. He believes that in order to learn anything of value, you need to start with the foundation and develop the roots of the tree. Only from there will you be able to learn concepts and specific skills(leaves) that connect to the foundation. Learning becomes exponential when structured in this way.

Course Curriculum

Chapter 1: Introduction to DSA

Lecture 1: Data Types

Lecture 2: Algorithms

Lecture 3: Data Structure

Lecture 4: Types of Data Structures

Lecture 5: Analysis of Algorithms

Lecture 6: Rate of Growth

Lecture 7: Types of Algorithms Analysis

Chapter 2: Big O Notation

Lecture 1: What is Big O ?

Lecture 2: Big O Visualization

Lecture 3: Exercise 1- Find the Upper Bound

Lecture 4: Omega Notation

Lecture 5: Theta Notation

Lecture 6: Time Complexity [Part 1]

Lecture 7: Time Complexity [Part 2]

Lecture 8: Complexity Guidelines

Lecture 9: Space Complexity

Lecture 10: Exercise 2 – Space Complexity

Lecture 11: Exercise 3 – Time Complexity

Lecture 12: Exercise 4 – Time Complexity

Lecture 13: Exercise 5 – Time Complexity

Lecture 14: Exercise 6 – Time Complexity

Lecture 15: Exercise 7 – Time Complexity

Lecture 16: Exercise 8 – Time Complexity

Lecture 17: Exercise 9 – Time Complexity

Lecture 18: Exercise 10 – Time Complexity

Lecture 19: Exercise 11 – Time Complexity

Lecture 20: Exercise 12 – Time Complexity

Lecture 21: Exercise 13 – Time Complexity

Lecture 22: Exercise 14 – Time Complexity

Lecture 23: Exercise 15 – Time Complexity

Lecture 24: Exercise 16 – Time Complexity

Lecture 25: Exercise 17 – Time Complexity

Lecture 26: Exercise 18 – Time Complexity

Lecture 27: Exercise 19 – Time Complexity

Lecture 28: Exercise 20 – Time Complexity

Lecture 29: Exercise 21 – Time Complexity

Chapter 3: Recursion

Lecture 1: Problem Solving FlowChart

Lecture 2: Recursion

Lecture 3: Recursion vs Iterative

Lecture 4: Exercise 22- Factorial Recursion

Lecture 5: Exercise 23- Fibonacci Series in Recursion

Lecture 6: Exercise 24- Recursive Methods

Lecture 7: Exercise 25- Explain the Functionality of Recursive Methods

Lecture 8: Exercise 26- From Decimal to Binary [Recursion]

Lecture 9: Exercise 27- Guess the Sequence

Lecture 10: Exercise 28- Recursive Power Functions

Chapter 4: Arrays

Lecture 1: Creating Arrays

Lecture 2: Accessing Arrays

Lecture 3: Inserting Element in Array at Specific Position

Lecture 4: Searching for Element in Array

Lecture 5: Don't Miss to Download Source Codes

Lecture 6: Remove Specific Element from Array

Lecture 7: Rotate Array by k Positions

Lecture 8: Remove Duplicates from Array

Chapter 5: Matrix

Lecture 1: Multidimentional Arrays – Matrix

Lecture 2: Printing 2D Array Elements

Lecture 3: 3D Arrays

Lecture 4: Adding Elements to Matrix

Lecture 5: Updating Elements in Matrix

Lecture 6: Searching a Matrix

Lecture 7: Deleting Element from Matrix

Lecture 8: Time & Space Complexity of Matrix

Lecture 9: Time & Space Complexity of Array

Lecture 10: Exercise 29- Average of Array

Lecture 11: Exercise 30- Searching an array for an element

Lecture 12: Exercise 31- Delete Elements from Array

Lecture 13: Exercise 32- Find Max & Min in Array

Lecture 14: Exercise 33- Reverse an Array

Lecture 15: Exercise 34- Find Duplicates in Array

Lecture 16: Exercise 35- Find Common between 2 Arrays

Lecture 17: Exercise 36- Adding Two Matrices

Lecture 18: Exercise 37- Rotating an Array

Lecture 19: Exercise 38- Shuffling an Array

Chapter 6: Linked Lists

Lecture 1: Creating Linked Lists

Lecture 2: Printing Linked List Nodes

Lecture 3: Printing Linked List Reversely

Lecture 4: Inserting Nodes at Beginning

Lecture 5: Inserting Nodes at End

Lecture 6: Inserting Nodes After a Node

Lecture 7: Deleting Nodes from Linked List

Lecture 8: Searching Linked Lists

Lecture 9: Get nth Node of Linked List

Lecture 10: Get Length of Linked List

Lecture 11: Get Middle Node of Linked List

Lecture 12: Detect a Loop in Linked List

Lecture 13: Exercise 39- Reverse a Linked List

Lecture 14: Exercise 40- Implementing Linked List in Java

Lecture 15: Exercise 41- Printing Linked List

Lecture 16: Exercise 42- Pushing Node at the Beginning

Lecture 17: Exercise 43- Adding a New Node After a Node

Lecture 18: Exercise 44- Appending a new Node

Lecture 19: Exercise 45- Deleting a Node with Specific Key

Lecture 20: Exercise 46- Delete a Node at specific position

Lecture 21: Exercise 47- Get Nodes Count Recursively and Iteratively

Instructors

Abbass Masri – Doc. Ali Alaeddine
Android App Developer & Computer Guru

Rating Distribution

1 stars: 0 votes
2 stars: 5 votes
3 stars: 4 votes
4 stars: 7 votes
5 stars: 22 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu