Step by step blog creation tutorials using PHP & MySQL: Part-1


Primary discuss of a PHP blog

Everyone wants to create personal blog using PHP, though you can use WordPress for personal blog. It is not possible to be a PHP professional without completing any PHP projects. To be an advanced web developers you need to complete more projects such as PHP shopping cart, PHP online exam etc. Here I give you step by step tutorials on personal blog. 

This tutorial developed only for advanced users. If you think that you are not an advanced PHP developers just skip this tutorial and try to learn our PHP basic tutorials.



Before tending to continue our discussion at first we need to analyze the  primary requirement of a blog. Requirement analysis is very important for future decision. I divide the requirement analysis into two parts. 
  • Functional analysis and 
  • Database analysis or Entity analysis

Functional Analysis for Personal blog

Functional analysis means what function do a blog. Such functions are login, registration, blog post, category, comments, user maintenance etc. Here are some lists of functional analysis that is essential for a blog. 

Posts: Where you can create post, edit your post etc. 

Comments: Comments is very essential for a blog. Fro this section you can make comments and admin also be able to moderate comments. 

Category: In that section you can select category for specific post. 

Registration: From this section a user easily be able to create account for this blog. 

Admin Panel: This is back-end part and a normal user cannot enter this part. Only admin can enter this part and can be able to edit, delete posts or users and also can moderate comments. 

User login and logout is another important part for a PHP blog. I also include those parts though you are already familiar about this.

I will cover all the section throughout my whole PHP blog creation tutorials. In next tutorial I will discuss Database or Entity analysis. I hope you will enjoy every tutorials. If you face any problem from my tutorial....... please make sure your comments. I try my best to solve your problem. Thanks.

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more