Data Structures And Algorithms In PHP

Data Structures And Algorithms In PHP, available at $44.99, has an average rating of 4.05, with 83 lectures, based on 72 reviews, and has 355 subscribers.

You will learn about What are algorithms really is? Basic view on algorithms. What are time and space complexities in a easily understandable way. Yeah thats true. What are linked list and how linked list differs from Arrays? What are stacks and queues? Introduction to non-linear data structures This course is ideal for individuals who are Beginner PHP developers who want to learn the most important world of computer science It is particularly useful for Beginner PHP developers who want to learn the most important world of computer science.

Enroll now: Data Structures And Algorithms In PHP

Summary

Title: Data Structures And Algorithms In PHP

Price: $44.99

Average Rating: 4.05

Number of Lectures: 83

Number of Published Lectures: 76

Number of Curriculum Items: 83

Number of Published Curriculum Objects: 76

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

What are algorithms really is? Basic view on algorithms.

What are time and space complexities in a easily understandable way. Yeah thats true.

What are linked list and how linked list differs from Arrays?

What are stacks and queues?

Introduction to non-linear data structures

Who Should Attend

Beginner PHP developers who want to learn the most important world of computer science

Target Audiences

Beginner PHP developers who want to learn the most important world of computer science

PHP being the most popular server side scripting language powers more than 80% of the web. PHP is beyond WordPress and it deserves more. By the release of? PHP 7, it is also capable of creating an enterprise application. We already know the importance of problem solving and arise in demand for developers especially web developers.? Data structures are the core of computer science and it is the most involved topic on problem solving. Apart from being it is the most important topic asked in interview?data structures helps to solve most of the problems when developing applications. So next time when your are going for a PHP developer interview and the interviewer asks to implement some data structure don’t think of using C , C++ or Java lets implement it with PHP itself!!?

In this series you will learn the most important world of linear data structures linked list, stacks and queues. You will learn how to implement it, how to perform insertion and deletion operations and some problems based on this data structures.

Linked list :-

Do you know PHP array(but trust me it is not the array like other languages) itself implemented with doubly linked list and hash table internally? In this you will learn the importance of linked list and why it is preferred for inserting and deleting the data when compared to array. You will learn

How to create an linked list in PHP

How to insert an element at first position of the list

How to insert an element at the last position of the list

How to insert an element at the given position

How to delete the first element of the list

How to delete the last element of the list

How to delete an element at the given position

You will learn all types of linked list that you definitely need to know.

Stack:-

Do you know the function calls and variable declarations are internally maintained using stack. Yes programming languages itself make use of stack data structure for some of its operations. In this you will learn,

How to implement stack using array

How to implement stack using linked list(I hope you may come across this is interview)

Some problems based on stack

Queue:-

Operating systems processes are rely on this cool data structure. In this you will learn

How to implement queue using array

How to implement queue using linked list

Some problems on queue

Take your next step by enrolling to the course. Developers are on rise. But not everyone get hired those who know how to solve problems are the one getting hired. Apart from learning Laravel,Yii,etc,.. lets learn the core of problem solving.

The reason I made two parts of this course is that next part consist of non-linear data structures which is some what difficult to grasp and more over we are going to develop an real world application based on all the data structures we learned. Yes!!! that’s true. It is not enough to learn only the implementation of these data structures, we must need to know how to implement it at perfect scenario.?

Join the course to see more!!!!

Course Curriculum

Chapter 1: Introduction

Lecture 1: Welcome to the course

Lecture 2: A quick note

Lecture 3: What are data structures?

Chapter 2: Introduction to algorithms

Lecture 1: 1.Introduction

Lecture 2: Characteristics of an algorithm

Lecture 3: Why to analyse an algorithm?

Lecture 4: What is O(1) constant time?

Lecture 5: What is O(n) linear time?

Lecture 6: What is O(log n) logarithmic time?

Lecture 7: What is O(n^2) quadratic time?

Lecture 8: What is O(n^3) cubic time?

Lecture 9: Best case,worst case and average case of an algorithm

Lecture 10: Rate of growth

Chapter 3: Recursion

Lecture 1: Introduction to recursion

Lecture 2: Recursion example 1- factorial of a given number

Chapter 4: Arrays

Lecture 1: A breif about PHP arrays

Lecture 2: SplFixedArray in PHP

Chapter 5: Problems on arrays

Lecture 1: 1.Sum of the array – Two pointer approach

Lecture 2: 2.Sum of maximum sub array – Naive approach

Lecture 3: 3.Sum of maximum sub array – Kadanes algorithm

Chapter 6: Linked list

Lecture 1: 1.Introduction to linked list

Lecture 2: 2.Why to use linked list?

Lecture 3: Implementing linked list

Lecture 4: Inserting an element to the linked list

Lecture 5: Inserting at front of the list

Lecture 6: Inserting at given position

Lecture 7: Deleting the head node

Lecture 8: Deleting the last node

Lecture 9: Deleting the given node

Chapter 7: Doubly linked list

Lecture 1: Introduction to doubly linked list

Lecture 2: Base condition for doubly linked list operations

Lecture 3: Inserting the element at front

Lecture 4: Inserting at given position

Lecture 5: Insert at last

Lecture 6: Deleting the head node

Lecture 7: Deleting the tail node

Lecture 8: Deleting the given node

Chapter 8: Circular linked list

Lecture 1: Introduction to circular linked list

Lecture 2: Inserting at front of the circular list

Lecture 3: Inserting at last of the circular list

Lecture 4: Inserting at given position in the circular list

Lecture 5: Deleting the first node of the circular list

Lecture 6: Deleting the last node of the circular list

Chapter 9: Problems on linked list

Lecture 1: 1.Printing the elements of the linked list using recursion

Lecture 2: 2.Reversing the linked list – Iterative approach

Lecture 3: 4.1.Removing duplicates in unsorted linked list

Lecture 4: 4.2. Removing duplicates in sorted linked list

Lecture 5: 5.Detecting cycle in the linked list – Approach 1

Lecture 6: 6.Detecting cycle in the linked list – Approach 2

Chapter 10: Stacks

Lecture 1: Introduction to Stack

Lecture 2: Implementing stack using array

Lecture 3: Implementing stack using linked list

Chapter 11: Queues

Lecture 1: Introduction to queue

Lecture 2: Implementing queue using array

Lecture 3: Implementing queue using linked list

Chapter 12: Problems on stacks and queues

Lecture 1: Expression evaluation

Lecture 2: Implement queue using stack

Chapter 13: Introduction to non-linear data structures

Lecture 1: Introduction

Chapter 14: Trees in PHP

Lecture 1: Properties of Tree

Lecture 2: Introduction to binary tree

Lecture 3: Implementing binary tree with PHP

Lecture 4: Tree Traversal and its types

Lecture 5: Preorder traversal

Lecture 6: Inorder traversal

Lecture 7: Postorder traversal

Chapter 15: Problems in Binary Tree

Lecture 1: Finding maximum element in binary tree

Lecture 2: Finding height of the binary tree

Lecture 3: Finding the size of the binary tree

Chapter 16: Introduction to Graphs

Lecture 1: What is a Graph DS?

Lecture 2: Properties of Graph

Lecture 3: Adjacency Matrix

Lecture 4: Adjacency List

Lecture 5: Breadth First Search

Lecture 6: 6.Implementing Breadth First Search With PHP

Lecture 7: Depth First Search (DFS)

Lecture 8: Implementing Depth First Search (DFS) With PHP

Instructors

Joshua Melvin Benhar
Professional Web Developer

Rating Distribution

1 stars: 10 votes

2 stars: 4 votes

3 stars: 15 votes

4 stars: 20 votes

5 stars: 23 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!