
Provide a quick note on setting up a PHP project, running scripts from the command line or repl, and using editors like PHPStorm, with web app work deferred.
Explain what an algorithm is, show how to implement a step-by-step linear search in an array, detailing input, iteration, and index return, and that not found returns -1.
explain how O(log n) is logarithmic time and how for n = 1000 the iterations are about 10, noting base two is used for intuition but does not affect notation.
Analyze best case, worst case, and average case of algorithms, with the linear search example illustrating array access, complexity, and Big O notation in PHP.
Explore SplFixedArray in PHP, a fixed-size array with numeric indices that uses less memory and enables faster operations than regular arrays, supports mixed values, and offers iteration with upfront size.
This lecture introduces linked lists, showing how memory is allocated non-sequentially and how pointers link each node to the next, contrasting with fixed-size arrays that require copying.
Insert a node at a given position in a list by updating next pointers, including inserting at the head and traversing to the target position, then display the list.
Delete the last node in a linked list by traversing to the end, updating the previous node's next pointer to null, calling display, handling single-node cases, and decrementing the account.
Learn the base condition for inserting a node into a doubly linked list when the list is empty, setting the head and tail to the new node.
Demonstrates inserting a new node at the front of a doubly linked list in PHP, linking to the old head and updating the previous pointer, with empty-list handling.
Explore inserting a new node at a given position in a doubly linked list using next and previous pointers in PHP. See how to update head, tail, and surrounding nodes.
Learn how to remove duplicates in a sorted linked list with a single scan by comparing each node's data to the next and bypassing duplicates.
Explore the stack data structure, its push and pop operations, and how last-in, first-out behavior governs insertion and removal at the top, with recursion and language runtimes as context.
Implement a stack using an array, with a constructor setting a 20-element limit, push adds to the end when room exists, otherwise throws an overflow, and pop removes last element.
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!!!!