Skip to main content

Ticket booking in asp.net c#

Before doing this first to learn how to register and login into the site because without login you can not book your ticket. This code is used for in any project (Online movie ticketing, railway reservation, airline reservation, etc), which you want to design it. I will take simple method for design this. First to design database table for this type of application. I have a table, which query is mentioned bellow:

I method


Ticket booking in asp.net c#

CREATE TABLE [dbo].[Booking] (
[BookingId] INT IDENTITY (1, 1) NOT NULL,
[seatno] NVARCHAR (MAX) NULL,
[userId] INT NULL,
[date] NVARCHAR (MAX) NULL,
[movie_id] INT NULL,
PRIMARY KEY CLUSTERED ([BookingId] ASC)
);

After design the database table you can insert seat_no in it with some specific data, such as userId, date, movie_id. Before inserting data into table, first to check whether the seat_no is already reserved ot not. check this mentioned bellow code for this:


private bool checkseat()
{
string seats=seattxt.Text; 
string[] seatres=seats .Split(','); 
cmd.CommandText = "select * from [Booking]"; 
cmd.Connection = con;
SqlDataReader rd = cmd.ExecuteReader();
while (rd.Read()) 
{
string alrbook = rd["seatno"].ToString(); 
string[] reseat = alrbook.Split(','); 
foreach (string item in seatres)
{
foreach (string item2 in reseat) 
{
if (item==item2) 
{

flag =false;

break;
}
}

}
}
rd.Dispose();
cmd.Parameters.Clear();
if(flag ==false)
return true;
else
return false;

}

Suppose your entered seat_no is not matched with already reserved seat_no then you can book new ticked, which is enter in TextBox. Otherwise you are not permitted.


if (checkseat() == false)

{
cmd.CommandText = "insert into [Booking](seatno,userId,date,movie_id)values(@seatno1,@userid1,@date1,@movieid1)";
cmd.Connection = con;

seat_amount = seat_amount * count;
cmd.Parameters.AddWithValue("@seatno1", s);
cmd.Parameters.AddWithValue("@userid1", 1);
cmd.Parameters.AddWithValue("@date1", mdatelbl.Text);
cmd.Parameters.AddWithValue("@movieid1", 1);

amounttxt.Text = seat_amount.ToString();

cmd.ExecuteNonQuery();
}
else
{
Response .Write ("Change seat no");

}
already reserved seat_no

II method to reserve the ticket

In the second method you can save your ticket separately in different rows.

you can save your ticket separately in different rows

    In this method first to check Seat_availability, which is mentioned above. Only single statement should change in above mentioned code that is:

private bool checkseat()
 {
 string seats=seattxt.Text;
 string[] seatres=seats .Split(',');
 cmd.CommandText = "select * from [Booking]";
 cmd.Connection = con;
 SqlDataReader rd = cmd.ExecuteReader();
 while (rd.Read())
 {
 string alrbook = rd["seatno"].ToString();
 
 foreach (string item in seatres)
 {
 
 if (item==alrbook)
 {

 flag =false;
 
 break;
 }
 
 
 }


 }
 rd.Dispose();
 cmd.Parameters.Clear();
 if(flag ==false)
 return true;
 else
 return false;
 
 }

Now, you can book your ticket , if seat is available. Create the parameter inside the foreach loop and save the value one by one


foreach (string item in s1)
 {
 
 cmd.CommandText = "insert into [Booking](seatno,userId,date,movie_id)values(@seatno"+c1+",@userid"+c1+",@date"+c1+",@movieid"+c1+")";


 seat_amount = seat_amount * count;
 cmd.Parameters.AddWithValue("@seatno"+c1, item);
 cmd.Parameters.AddWithValue("@userid"+c1, 1);
 cmd.Parameters.AddWithValue("@date"+c1, mdatelbl.Text);
 cmd.Parameters.AddWithValue("@movieid"+c1, 1);
 cmd.ExecuteNonQuery();
 c1++;
 
 }

In the next example, i will show you, how to cancel the ticket easily. Only those ticket will be removed, which is reserved by the user.

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …