Deny Access of Files,Folders through htaccess – Deny from All

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

.htaccess is a configuration file used by web server (Apache). The fullform of htaccess is Hypertext Access. They are used to override server global configuration for the directory.

Recursion vs Iteration – Difference between Recursion and Iteration

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.

Implementation of Binary Search using Recursion.

htaccess Tutorial

In this htaccess tutorial series, you will learn about htaccess configuration and it’s usage.

htaccess Tutorial

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 – Difference Between MyISAM and InnoDB Storage Engines

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.

Queue Data Structure Implementation Using an Array

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).