Home

All courses

Data Structures And Algorithms In PHP

Data Structures

Programming Languages

Development

Data Structures And Algorithms In PHP

Linked list, Stacks, Queues And Interview Problems

3.6

(81)

376 enrolled on this course

Last updated 11/2021

None

₹ 1799.0

₹ 3299.0

Buy Now

30-Day Money-Back Guarantee

Lessons

Quizzes

Duration

13 Hours

Skill level

Beginner

Language

English

Certificate

Yes

Full lifetime access

Yes

Description

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!!!!
Who this course is for:
Beginner PHP developers who want to learn the most important world of computer science

What you'll learn

What are algorithms really is? Basic view on algorithms.

What are time and space complexities in a easily understandable way. Yeah that's true.

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

What are stacks and queues?

Introduction to non-linear data structures

Requirements

You will need a copy of Adobe XD 2019 or above. A free trial can be downloaded from Adobe.
No previous design experience is needed.
No previous Adobe XD skills are needed.

Course Content

27 sections • 95 lectures

Expand All Sections

1-Introduction

1.1-Welcome to the course

1.2-A quick note

1.3-What are data structures?

2-Introduction to algorithms

2.1-1.Introduction

2.2-Characteristics of an algorithm

2.3-Why to analyse an algorithm?

2.4-What is O(1) constant time?

2.5-What is O(n) linear time?

2.6-What is O(log n) logarithmic time?

2.7-What is O(n^2) quadratic time?

2.8-What is O(n^3) cubic time?

2.9-Best case,worst case and average case of an algorithm

2.10-Rate of growth

3-Recursion

3.1-Introduction to recursion

3.2-Recursion example 1- factorial of a given number

4-Arrays

4.1-A breif about PHP arrays

4.2-SplFixedArray in PHP

5-Problems on arrays

5.1-1.Sum of the array - Two pointer approach

5.2-2.Sum of maximum sub array - Naive approach

5.3-3.Sum of maximum sub array - Kadanes algorithm

6-Linked list

6.1-1.Introduction to linked list

6.2-2.Why to use linked list?

6.3-Implementing linked list

6.4-Inserting an element to the linked list

6.5-Inserting at front of the list

6.6-Inserting at given position

6.7-Deleting the head node

6.8-Deleting the last node

6.9-Deleting the given node

7-Doubly linked list

7.1-Introduction to doubly linked list

7.2-Base condition for doubly linked list operations

7.3-Inserting the element at front

7.4-Inserting at given position

7.5-Insert at last

7.6-Deleting the head node

7.7-Deleting the tail node

7.8-Deleting the given node

8-Circular linked list

8.1-Introduction to circular linked list

8.2-Inserting at front of the circular list

8.3-Inserting at last of the circular list

8.4-Inserting at given position in the circular list

8.5-Deleting the first node of the circular list

8.6-Deleting the last node of the circular list

9-Problems on linked list

9.1-1.Printing the elements of the linked list using recursion

9.2-2.Reversing the linked list - Iterative approach

9.3-4.1.Removing duplicates in unsorted linked list

9.4-4.2. Removing duplicates in sorted linked list

9.5-5.Detecting cycle in the linked list - Approach 1

9.6-6.Detecting cycle in the linked list - Approach 2

10-Stacks

10.1-Introduction to Stack

10.2-Implementing stack using array

10.3-Implementing stack using linked list

11-Queues

11.1-Introduction to queue

11.2-Implementing queue using array

11.3-Implementing queue using linked list

12-Problems on stacks and queues

12.1-Expression evaluation

12.2-Implement queue using stack

13-Introduction to non-linear data structures

13.1-Introduction

14-Trees in PHP

14.1-Properties of Tree

14.2-Introduction to binary tree

14.3-Implementing binary tree with PHP

14.4-Tree Traversal and its types

14.5-Preorder traversal

14.6-Inorder traversal

14.7-Postorder traversal

15-Problems in Binary Tree

15.1-Finding maximum element in binary tree

15.2-Finding height of the binary tree

15.3-Finding the size of the binary tree

16-Introduction to Graphs

16.1-What is a Graph DS?

16.2-Properties of Graph

16.3-Adjacency Matrix

16.4-Adjacency List

16.5-Breadth First Search

16.6-6.Implementing Breadth First Search With PHP

16.7-Depth First Search (DFS)

16.8-Implementing Depth First Search (DFS) With PHP

Course Categories

Popular Courses

Data Structures And Algorithms In PHP

Description

What you'll learn

Requirements

Course Content

You May Like