How to restrict direct access of files and folders through htaccess. In this tutorial i’ll show some htaccess directives (Deny from All) through you can disallow direct access of files and folders.
What is htaccess File
Recursion vs Iteration. What’s the difference between recursion and iteration. Recursion and Iteration both are two different programming approaches. In some cases recursion is best suited and in some other cases iterative way of programming is good.
In programming, repeated set of instructions can be handled either by using recursive or iterative approach in your code. So which approach you choose and why. Let’s talk about recursion vs iteration.
PHP Composer is a dependency manager that allows you to update,download the package dependency. It will pull the required library and dependencies and manage them in one place. The concept of composer is similar to npm in node.js and gem in Ruby.
In this htaccess tutorial series, you will learn about htaccess configuration and it’s usage.
htaccess refers to Hypertext Access. It is a directory level configuration file, used by Apache Web Server. htaccess file contains set of directives, which is read by Apache web server and apply to the directory on which this file is placed.
MyISAM vs InnoDB. What’s the difference between MyISAM and InnoDB storage engine. No doubt, MySql is one of the most used databases worldwide. The great thing about MySql is the flexibility to choose storage engines.
In MySql, every storage engine is designed for a specific purpose to address/solve application problems. The two popular storage engines of MySql (MyISAM and InnoDB) are widely used worldwide. So let’s check what’s the difference between MyISAM and InnoDB storage engines.
How to create a Foreign key in MySql. What’s the use of Foreign key constraint in a MySql. In this tutorial, You’ll learn about Foreign key constraint and it’s advantages.
Write a program to implement queue data structure using an array. In my previous posts, I have explained Stack and Linked List data structure. In this post, We’ll learn about queue data structure and their implementation.
Queue Data Structure
In Queue data structure, An element is inserted at one end called rear and deleted at other end called front. As compared to stack in which insertion and deletion are allowed only at one end. It is also called FIFO (First In First out).