This project report describes a railway reservation system created in 2015-16. It includes frames for checking train schedules, seat availability, booking tickets, checking tickets, and canceling tickets. It also provides instructions on how to create a SQL file of a database from the command prompt and how to use a SQL file from the command prompt on another PC to import the database.
This is a presantation on railway reservation system project in php. project report and source code will be available soon . you can find it at www.avhishekblog.wordpress.com . hope this is useful to you
This is a project documentation titled: Online Railway Reservation System.
This documentation was submitted by me as my assignment in my 6th sem (2013) in APIIT SD INDIA, Panipat along with a full-fledged working system i.e., a website built using ASP.NET & SQL SERVER 2008
This is a presantation on railway reservation system project in php. project report and source code will be available soon . you can find it at www.avhishekblog.wordpress.com . hope this is useful to you
This is a project documentation titled: Online Railway Reservation System.
This documentation was submitted by me as my assignment in my 6th sem (2013) in APIIT SD INDIA, Panipat along with a full-fledged working system i.e., a website built using ASP.NET & SQL SERVER 2008
A train ticket is a ticket issued by a railway operator that enables the bearer to travel on the operator's network or a partner's network. Tickets can authorize the bearer to travel a set itinerary at a specific time (common for long-distance railroads), a set itinerary at any time (common for commuter railroads), a set itinerary at multiple times, or an arbitrary itinerary at specific times. The last two categories are often called passes: the former is often sold as a discounted block of trips for commuters; the latter is often sold to vacationers, such as European Eurail passes.
In some countries, like Italy, and some local railways in Germany, conductors are not used. Instead passengers are expected to validate tickets in a special stamping machine before entering the train. A system of coupons that are validated with a special machine exists on the Mumbai Suburban Railway where combinations of coupons of different denominations are used to get the corresponding ticket value.[1] There may or may not be a conductor later on double-checking that correct tickets are actually held. Yet further systems are possible, for example in Japan, the London Underground and in local traffic in Stockholm, the platforms are physically blocked, forcing the acquisition of a ticket before entering the platform.
Some train tickets are available with an option to add bus travel at either end of the train ticketed journey, as part of a wider transport network. For instance, the PLUSBUS scheme in the United Kingdom offers bus travel on an integrated ticket for an additional fee.[2] In Germany, most long distance train tickets include a "city ticket" valid on the public transit system of origin and destination. This is automatically included at no extra charge in all tickets purchased by Bahn Card holders and is indicated on the ticket.[3]train ticket reservation in c.i hope it will be helpful. Railway Reservation System is a complex online distributed transaction application based on client server architecture. The salient features of the software include allowing user from anywhere to do a booking for a journey in any train in any class from anywhere to anywhere; handling reservation, modifications cancellation/refunds.
Railway management system, database mini projectshashank reddy
The Railway Reservation System facilitates the passengers to enquire about the trains available on the basis of source and destination, Booking and Cancellation of tickets, enquire about the status of the booked ticket, etc. The aim of case study is to design and develop a database maintaining the records of different trains, train status, and passengers.
This project is about ' ONLINE RAILWAY RESERVATION SYSTEM ' that automates the process of generating tickets to the passengers. This System allows passengers to view Trains and Available seats(options like Berth availability , class are also included) , view , book & cancel the tickets online.
A train ticket is a ticket issued by a railway operator that enables the bearer to travel on the operator's network or a partner's network. Tickets can authorize the bearer to travel a set itinerary at a specific time (common for long-distance railroads), a set itinerary at any time (common for commuter railroads), a set itinerary at multiple times, or an arbitrary itinerary at specific times. The last two categories are often called passes: the former is often sold as a discounted block of trips for commuters; the latter is often sold to vacationers, such as European Eurail passes.
In some countries, like Italy, and some local railways in Germany, conductors are not used. Instead passengers are expected to validate tickets in a special stamping machine before entering the train. A system of coupons that are validated with a special machine exists on the Mumbai Suburban Railway where combinations of coupons of different denominations are used to get the corresponding ticket value.[1] There may or may not be a conductor later on double-checking that correct tickets are actually held. Yet further systems are possible, for example in Japan, the London Underground and in local traffic in Stockholm, the platforms are physically blocked, forcing the acquisition of a ticket before entering the platform.
Some train tickets are available with an option to add bus travel at either end of the train ticketed journey, as part of a wider transport network. For instance, the PLUSBUS scheme in the United Kingdom offers bus travel on an integrated ticket for an additional fee.[2] In Germany, most long distance train tickets include a "city ticket" valid on the public transit system of origin and destination. This is automatically included at no extra charge in all tickets purchased by Bahn Card holders and is indicated on the ticket.[3]train ticket reservation in c.i hope it will be helpful. Railway Reservation System is a complex online distributed transaction application based on client server architecture. The salient features of the software include allowing user from anywhere to do a booking for a journey in any train in any class from anywhere to anywhere; handling reservation, modifications cancellation/refunds.
Railway management system, database mini projectshashank reddy
The Railway Reservation System facilitates the passengers to enquire about the trains available on the basis of source and destination, Booking and Cancellation of tickets, enquire about the status of the booked ticket, etc. The aim of case study is to design and develop a database maintaining the records of different trains, train status, and passengers.
This project is about ' ONLINE RAILWAY RESERVATION SYSTEM ' that automates the process of generating tickets to the passengers. This System allows passengers to view Trains and Available seats(options like Berth availability , class are also included) , view , book & cancel the tickets online.
The software solution implements a Railway Ticket Issuing System (RTIS) for the Sri Lanka Railways Department (SLRD). The solution allows to overcome the extreme human intervention to the current ticket issuance process. The proposed system will be an automated system so that SLRD will be able to manage their ticketing transaction efficiently.
Team Members:
Rashmika Nawaratne
Malinga Perera
Rumal Perera
Chaamini Mangaleswaran
Dilaj Perera
The railway ticket service c++ project class 12Sandeep Chandel
This is the railway ticket service program in c++ for class 12 students for their investigatory projects. this is c++ project which will help students to get good marks in their practical examination and be happy.this is very easy and good project that to be submitted as investigatory project.
import java-util--- import java-io--- class Vertex { -- Constructo.docxBlake0FxCampbelld
import java.util.*;
import java.io.*;
class Vertex {
// Constructor: set name, chargingStation and index according to given values,
// initilaize incidentRoads as empty array
public Vertex(String placeName, boolean chargingStationAvailable, int idx) {
name = placeName;
incidentRoads = new ArrayList<Edge>();
index = idx;
chargingStation = chargingStationAvailable;
}
public Vertex(String placeName, boolean hasChargingStataion) {
}
public String getName() {
return name;
}
public boolean hasChargingStation() {
return chargingStation;
}
public ArrayList<Edge> getIncidentRoads() {
return incidentRoads;
}
// Add a road to the array incidentRoads
public void addIncidentRoad(Edge road) {
incidentRoads.add(road);
}
public int getIndex() {
return index;
}
private String name; // Name of the place
ArrayList<Edge> incidentRoads; // Incident edges
private boolean chargingStation; // Availability of charging station
private int index; // Index of this vertex in the vertex array of the map
public void setVisited(boolean b) {
}
public Edge[] getAdjacentEdges() {
return null;
}
public boolean isVisited() {
return false;
}
public boolean isChargingStationAvailable() {
return false;
}
}
class Edge {
public Edge(int roadLength, Vertex firstPlace, Vertex secondPlace) {
length = roadLength;
incidentPlaces = new Vertex[] { firstPlace, secondPlace };
}
public Edge(Vertex vtx1, Vertex vtx2, int length2) {
}
public Vertex getFirstVertex() {
return incidentPlaces[0];
}
public Vertex getSecondVertex() {
return incidentPlaces[1];
}
public int getLength() {
return length;
}
private int length;
private Vertex[] incidentPlaces;
public Vertex getEnd() {
return null;
}
}
//A class that represents a sparse matrix
public class RoadMap {
// Default constructor
public RoadMap() {
places = new ArrayList<Vertex>();
roads = new ArrayList<Edge>();
}
// Auxiliary function that prints out the command syntax
public static void printCommandError() {
System.err.println("ERROR: use one of the following commands");
System.err.println(" - Load a map and print information:");
System.err.println(" java RoadMap -i <MapFile>");
System.err.println(" - Load a map and determine if two places are connnected by a path with charging stations:");
System.err.println(" java RoadMap -c <MapFile> <StartVertexIndex> <EndVertexIndex>");
System.err.println(" - Load a map and determine the mininmum number of assistance cars required:");
System.err.println(" java RoadMap -a <MapFile>");
}
public static void main(String[] args) throws Exception {
if (args.length == 2 && args[0].equals("-i")) {
RoadMap map = new RoadMap();
try {
map.loadMap(args[1]);
} catch (Exception e) {
System.err.println("Error in reading map file");
System.exit(-1);
}
System.out.println();
System.out.println("Read road map from " + args[1] + ":");
map.printMap();
System.out.println();
}
else if (args.length == 2 && args[0].equals("-a")) {
RoadMap map = new RoadMap();
try {
map.loadMap(args[1]);
} catch (Exception e) {
System.err.println("Err.
Create a JAVA program that performs file IO and database interaction.pdfmalavshah9013
Create a JAVA program that performs file IO and database interaction via SQL. The program
needs to read data from the provided file: \"Project.csv\" and insert the data into a database. Then
the program needs to create a report from the database sorted by price descending. The report
should be in the format demonstrated below.
id (primary key - generated by the database)
cpuname
performance
price
Project.csv contents:CPU NamePerformancePrice (USD)Intel Core i7-3770K @
3.50GHz9,556$560.50Intel Core i7-3770 @ 3.40GHz9,327$335.55Intel Core i7-3820 @
3.60GHz8,990$404.38AMD FX-8350 Eight-Core8,940$149.99Intel Core i7-2600K @
3.40GHz8,501$379.97Intel Core i7-2600 @ 3.40GHz8,242$214.99Intel Core i7-4720HQ @
2.60GHz8,046NAAMD FX-8320 Eight-Core8,008$145.99Intel Core i7-6700HQ @
2.60GHz7,997$1509Intel Core i7-4710HQ @ 2.50GHz7,826NAIntel Core i5-6600K @
3.50GHz7,762$239.99Intel Core i7-4700HQ @ 2.40GHz7,754$383.00Intel Core i7-4700MQ
@ 2.40GHz7,736$467.40Intel Core i5-4690K @ 3.50GHz7,690$239.99AMD FX-8150 Eight-
Core7,619$165.99Intel Core i7-3630QM @ 2.40GHz7,604$304.49Intel Core i5-4670K @
3.40GHz7,598$249.99Intel Core i5-4690 @ 3.50GHz7,542$224.99Intel Core i7-3610QM @
2.30GHz7,460$399.99Intel Core i5-4670 @ 3.40GHz7,342$226.99Intel Core i5-4590 @
3.30GHz7,174$199.99Intel Core i7-4702MQ @ 2.20GHz7,146NAIntel Core i5-3570K @
3.40GHz7,130$477.23
Solution
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.Arrays;
public class Main
{
/**
* This the main function that runs at the start
* param args - input arguments from the command line
*/
static public void main(String[] args)
{
CPUList cpuList = new CPUList(); //The CPUList used to retrieve data from the
fiile and store in the db
CPUList cpuListRetrieved = new CPUList(); //The CPUList used to retrieve data from the
database
CpuDb cpuDb = new CpuDb(); //The database object used to move data to and
from the CPU Lists
try
{
//Read in the file and store each line into the CPU objects in a list
Files.lines(Paths.get(\"Project04Data.csv\"))
.map(line -> line.split(\"\ \ \")) // Stream
.flatMap(Arrays::stream) // Stream
.forEach(line -> cpuList.AddCpu(line));
//Clear the list table for the new listing
cpuDb.Clear();
//Insert the Cpu List into the database
cpuDb.SetCpuList(cpuList);
//Retrieve the Cpu List into a different CPU List object from the database
cpuDb.GetCpuList(cpuListRetrieved);
//Show the report from the new list that was retrieved from the database
cpuListRetrieved.ShowReport();
} catch (IOException e)
{
e.printStackTrace();
}
}
}
CPUList.java
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
public class CPUList
{
ArrayList theList = new ArrayList<>();
/**
* Default constructor for the CPU
*/
public void CPUList()
{
}
/**
* param strInputLine Input line to be used in creating the CPU object
*/
public void AddCpu(String strInputLine)
{
theList.add(new CPU(strInputLine));
}
/**
* param tempCPU - A CPU object to.
Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdfkostikjaylonshaewe47
Implement a queue using a linkedlist (java)
Solution
LinkedQueueImplement.java
import java.util.*;
class Node
{
protected int data;
protected Node link;
public Node()
{
link = null;
data = 0;
}
public Node(int d,Node n)
{
data = d;
link = n;
}
public void setLink(Node n)
{
link = n;
}
public void setData(int d)
{
data = d;
}
public Node getLink()
{
return link;
}
public int getData()
{
return data;
}
}
class linkedQueue
{
protected Node front, rear;
public int size;
public linkedQueue()
{
front = null;
rear = null;
size = 0;
}
public boolean isEmpty()
{
return front == null;
}
public int getSize()
{
return size;
}
/* Function to insert an element to the queue */
public void insert(int data)
{
Node nptr = new Node(data, null);
if (rear == null)
{
front = nptr;
rear = nptr;
}
else
{
rear.setLink(nptr);
rear = rear.getLink();
}
size++ ;
}
/* Function to remove front element from the queue */
public int remove()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
Node ptr = front;
front = ptr.getLink();
if (front == null)
rear = null;
size-- ;
return ptr.getData();
}
/* Function to check the front element of the queue */
public int peek()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
return front.getData();
}
/* Function to display the status of the queue */
public void display()
{
System.out.print(\"\ Queue = \");
if (size == 0)
{
System.out.print(\"Empty\ \");
return ;
}
Node ptr = front;
while (ptr != rear.getLink() )
{
System.out.print(ptr.getData()+\" \");
ptr = ptr.getLink();
}
System.out.println();
}
}
/* Class LinkedQueueImplement */
public class LinkedQueueImplement
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
/* Creating object of class linkedQueue */
linkedQueue lq = new linkedQueue();
/* Perform Queue Operations */
System.out.println(\"Linked Queue Test\ \");
char ch;
do
{
System.out.println(\"\ Queue Operations\");
System.out.println(\"1. insert\");
System.out.println(\"2. remove\");
System.out.println(\"3. peek\");
System.out.println(\"4. check empty\");
System.out.println(\"5. size\");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println(\"Enter integer element to insert\");
lq.insert( scan.nextInt() );
break;
case 2 :
try
{
System.out.println(\"Removed Element = \"+ lq.remove());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 3 :
try
{
System.out.println(\"Peek Element = \"+ lq.peek());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 4 :
System.out.println(\"Empty status = \"+ lq.isEmpty());
break;
case 5 :
System.out.println(\"Size = \"+ lq.getSize());
break;
default :
System.out.println(\"Wrong Entry \ \");
break;
}
/* display queue */
lq.display();
System.out.println(\"\ Do you want to continue (Type y or n) \ \");
ch = scan.next().charAt(0);
} while (ch == \'Y\'|| ch == \'y\');
}
}
Output :
Linked Queue Test
Queue Operations
1. inse.
2019-10-05 - Untangled - Voxxed days ticinoArnaud Bos
Concurrent programming borrows a lot of terms from weaving and twists our minds with intertwined concepts: fibers, threads, lightweight-threads, green threads, loom...
Maybe you've heard about coroutines? Don't worry, everything is linked.
During this talk, we'll get weaving, show code samples and talk about project Loom, whose goal is to bring "lightweight concurrency" mechanisms to the JVM, along with APIs to embroider the story.
We will talk about project Loom's inception and recent prototypes. You will also see its mesh goes far beyond "simple" primitives to revolutionize the JVM.
Using NetBeansImplement a queue named QueueLL using a Linked List .pdfsiennatimbok52331
Using NetBeans
Implement a queue named QueueLL using a Linked List (same as we did for the stack). This
implementation must be used in all the following problems.
Implement a queue QueueST using a stack (use StackLL).
Test your implementations in the main with examples.
Solution
Answer:-
import java.util.*;
/* Class Node */
class Node
{
protected int data;
protected Node link;
/* Constructor */
public Node()
{
link = null;
data = 0;
}
/* Constructor */
public Node(int d,Node n)
{
data = d;
link = n;
}
/* Function to set link to next Node */
public void setLink(Node n)
{
link = n;
}
/* Function to set data to current Node */
public void setData(int d)
{
data = d;
}
/* Function to get link to next node */
public Node getLink()
{
return link;
}
/* Function to get data from current Node */
public int getData()
{
return data;
}
}
/* Class linkedQueue */
class linkedQueue
{
protected Node front, rear;
public int size;
/* Constructor */
public linkedQueue()
{
front = null;
rear = null;
size = 0;
}
/* Function to check if queue is empty */
public boolean isEmpty()
{
return front == null;
}
/* Function to get the size of the queue */
public int getSize()
{
return size;
}
/* Function to insert an element to the queue */
public void insert(int data)
{
Node nptr = new Node(data, null);
if (rear == null)
{
front = nptr;
rear = nptr;
}
else
{
rear.setLink(nptr);
rear = rear.getLink();
}
size++ ;
}
/* Function to remove front element from the queue */
public int remove()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
Node ptr = front;
front = ptr.getLink();
if (front == null)
rear = null;
size-- ;
return ptr.getData();
}
/* Function to check the front element of the queue */
public int peek()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
return front.getData();
}
/* Function to display the status of the queue */
public void display()
{
System.out.print(\"\ Queue = \");
if (size == 0)
{
System.out.print(\"Empty\ \");
return ;
}
Node ptr = front;
while (ptr != rear.getLink() )
{
System.out.print(ptr.getData()+\" \");
ptr = ptr.getLink();
}
System.out.println();
}
}
/* Class LinkedQueueImplement */
public class LinkedQueueImplement
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
/* Creating object of class linkedQueue */
linkedQueue lq = new linkedQueue();
/* Perform Queue Operations */
System.out.println(\"Linked Queue Test\ \");
char ch;
do
{
System.out.println(\"\ Queue Operations\");
System.out.println(\"1. insert\");
System.out.println(\"2. remove\");
System.out.println(\"3. peek\");
System.out.println(\"4. check empty\");
System.out.println(\"5. size\");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println(\"Enter integer element to insert\");
lq.insert( scan.nextInt() );
break;
case 2 :
try
{
System.out.println(\"Removed Element = \"+ lq.remove());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 3 .
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
2. TABLE OF CONTENTS
S.No Topic Page No.
1. Main Frame 3
2. Check Train
Schedule Frame
5
3. Check Seat
Availability
Frame
8
4. Book Ticket
Frame
11
5. Check Ticket
Frame
15
6. Cancel Ticket
Frame
17
7. How to create a
SQL file
19
8. How to use a SQL
file
20
3. MAIN FRAME
CODE:
//code for radio button check train schedule
Trainbtwstations a=new Trainbtwstations();
a.setVisible(true);
//code for radio button book ticket
Book d=new Book();
d.setVisible(true);
//code for radio button check availiability
Checkavailability e=new Checkavailability();
e.setVisible(true);
//code for radio button check your ticket
CheckTicket a=new CheckTicket();
a.setVisible(true);
4. //code for radio button cancel your ticket
Cancel b=new Cancel();
b.setVisible(true);
//code for exit button
System.exit(0);
18. //String query="delete from book where pnr='"+a+"' and name='"+name+"';";
int r=stmt.executeUpdate("delete from book where pnr='"+a+"';");
if(r!=0){
ResultSet rs1=stmt.executeQuery("select "+cla+" from avail where TrainNo="+tno);
int no_seat=0;
while(rs1.next()){
no_seat=rs1.getInt(1);
}
no_seat++;
int r1=stmt.executeUpdate("update avail set "+cla+"="+no_seat+" where
TrainNo="+tno);
d3.setVisible(true);
}
else
{
d2.setVisible(true);
}
}
catch(ClassNotFoundException e)
{
JOptionPane.showMessageDialog(rootPane, "ERROR");
} catch (SQLException e) {
JOptionPane.showMessageDialog(rootPane, "ERROR");
}
CODE FOR HOME BUTTON
OnlineReservation b=new OnlineReservation();
b.setVisible(true);
19. HOW TO CREATA A SQL FILE OF A
DATABASE FROM COMMAND PROMPT
This is the procedure to create a sql file from a database in mysql:
1. Open command prompt in admin mode.
2.Now change directory to the bin directory of the mysql.
3.Now type the below command in the command prompt and then enter the password of your
mysql.
4.Press enter and now you can find your database sql file in the bin folder of mysql.
20. HOW TO USE A SQL FILE FROM COMMAND
PROMPT IN ANOTHER PC
Procedure:
1.Open mysql and create database (give any name);
2.Now type command use “databasename”;
3.Now paste the .sql file in your bin folder of mysql.
4.Now open command prompt and change the directory to the bin directory of mysql.
5. now type the command as shown below
