Abstract of Three Project

 

 

Abstract of Three Project

Online Payroll System

Objectives of the project:

The main aim of this project is have a fully automated pay-roll system. This fully user friendly software will make the whole pay-roll system speedier and will guarantee on time salary to employees without any redundancy and delays. Moreover, it will certainly reduce the time, money and effort wasted in manual searching for leaves, deductions, grade allocation and designation allocation.

Existing System:

The Existing system is in fact very slow and highly delays prone. As the data stored is done manually, it takes a lot of time to process any query regarding information of any employee. The financial head has to search for a particular employee grade, leaves, designation and calculate the deductions before issuing him the pay slip. It requires huge man power if the organization is having a good number of employees. Due to manual operations, inconsistency in data management may prevail which can create faulty pay slips.

Proposed system:

The proposed software will remove any kind of redundancies and inconsistencies prevailing in the existing system by providing a fully computerized pay roll management system. The software will hold all the employee’s personal details, along with his grade, designation, leaves and other deductions. The reports and the pay slips can be generated with a single mouse click. The GUI of the software is very user friendly, easy to navigate and can easily be managed by a non tech-savvy person.

System specifications:

Modules:

There are essentially two modules of this software which are further broken into sub-modules;

1.      Registration module: In this module, new entries will be created and modified. It is broken into five sub modules:

·         Employee Master: Here all the details of the employee like address, DOB, Date of joining are stored here. He is allotted grade and designation through this module.

·         Deductions master: Here all the deductions will be calculated. Leave deductions, tax deductions and other deductions are inserted here.

·         Department master: New departments are added here and updations and modifications to existing departments are done here.

·         Designation Master: It enables the admin to create new designation corresponding to a particular department.

·         Grade Master: Here new grades can be created as well as allocated to the existing employees.

 

2.      Reports Module: The reports module is responsible for report generation based on the specified category. The categories are employee wise reports, grade wise reports, department wise reports, grade wise repots and pay-slip report. Pay-slip generation is also responsibility of this module.

Hardware configuration

Processor speed          233 MHz or above

RAM                            128 MB

Monitor                       Standard color Monitor

Hard disk                     20 GB

Floppy drive                1.44 MB

CD drive                      32 Hz

Key board                    108 keys keyboard

Mouse                         Scrollable 3 buttons

 

Software configuration

Operating system       Windows 95/98/NT/2000

Language                    Java (JDK), Servlets (JSDK), JavaMail

GUI                              HTML, CSS, JavaScript

Backend                      Oracle

Web Server                 Java Web Server 2.0

Database Connectivity   JDBC

Web Browser                    Internet Explorer

 

 

Online medical Booking Store

Objective:

The main objective of this system is to take the whole medical store online so that it is reachable to customers 24/7. It also aims at going towards cashless transactions. It will impart a wider visibility to the customers. Thus boosting the business to higher levels. The software will be a web based system with a very user friendly interface which indeed will make the whole management process easy to manage and operate with zero redundancies. Overall online medical booking store will become an efficient, highly responsive and an extremely accurate system.

Existing System:

The existing system is time consuming and requires more man power to function well. Secondly the scope of offline medical store is limited to local area and is available for fixed timing. All the data management involving product availability , searching , billing and other report generation are done manually which indeed are very time consuming.

 

Proposed System:

The proposed system will completely Revolutionize the industry. Searching of products, order placing, billing and product stock can be maintained by a single click. The order placed can be easily tracked At any time. The payment of the order can also be done by credit cards.

 

System Specifications:

This system is essentially divides into six modules:

1.    Administrator module: admin has been granted full access with complete permissions towards the system. He is essentially responsible for creating, deleting and modifying any product into the inventory. He has full authority to delete any user account. He can view and send reply to user’s messages. Report generation can be done by admin by selecting a time frame from calendar.

2.    Visitor module: The visitor will be greeted on the home page. He can view about us page and signup/login page. He can navigate around the products but cannot place order.

3.    User module: when a visitor signups for the website, he becomes the user. Now he can not only search around the products but also can place order and do the payment. Change of password and logout are also displayed in this module.

4.    Payment module: payment can also be done by credit cards. The software is so designed that it will not remember the credit card credentials.

5.    Shopping cart module: This module offers to add, delete and modify the products in the cart. After this shopping cart module will be redirected towards payment module.

6.    Discussion Board module: Here communication follows between users and administrator. A user can send messages or complaints to admin and admin sends replies to users.

Hardware Configuration

Operating System                    windows

Modem                                      33.6 kbps

Hard disk                                   40GB

RAM                                            512 MB (server) and 256 MB(client)

Processor.                                   2.77 GHz Pentium 4

Software requirements

 

Software                                            JDK 1.4 J2EE Enterprise edition

Database                                           Oracle

Web server                                       Web Logic 7.0            

database connectivity.                    JDBC/ODBC

GUI.                                                     HTML/CSS

Programming Language.                  Java

 

LIBRARY SYSTEM

Objective:

The primary objective of this library system is to maintain the records of the books and various documents which are available under the library room and to maintain the database of the students who will take the services of their library campus. There will be different type of users who will use this system in order to perform processing task and other administrative task apart from the students. Students will be provided with two options while accessing this system and these two are: Login and Register. For the very first time users (student), they have to register by using this system and their account will be verified by the librarian.                                                                                                                            Processing wok will be handled by the three layers which are tomcat server layer, application server layer which is jdbc odbc and the third one is database layer. Some of the default settings will be enforced while using the system such as listing of requested records in the ascending order and as per category wise. The primary objective of this enforcement is to make easy access to all information. The listing of books will be provided along with their front images with search and browse options. To display the exact location of books, a virtual mapping system has been implemented to find any book easily.

Existing System:

Previously the system was not able to overcome from the problem of data redundancy which in turn increases the burden of background processing. All working departments were not integrated with each other, by which manual work has to be done to make all task done. Any students who have fined, they need to submit their library card for final billing and provide account pay slip to confirm their due fees. Due to this problem students were not free to take out books from library until they have cleared their dues.

Proposed System:

In this new system, the problem of forgetting password or facing problem while login has been resolved and will automatically handle by the system itself. Students will also able to take print out or download pages of particular book either in pdf or in xml format. One to one and one to many relationship has been implemented to eliminate the process of data redundancy and maintain consistency. An inbuilt function within this system will able to provide the entire day transactions for each end day which will improve the auditing process. The CMS part of the library system can be inserted with video lectures which can be accessed by the system or a private messages can be send to the students to make them inform about new books under the library room.

 

 

Read More

Database Connectivity with C++ - An Introduction

 

Open Database Connectivity (ODBC)

ODBC is a standard or open application programming interface (API) for accessing to database management systems (DBMS). This API is independent of any one programming language, database system or operating system. ODBC is based on the Call Level Interface (CLI) specifications from SQL, X/Open (now part of The Open Group), and the ISO/IEC. ODBC was created by the SQL Access Group and first released in September, 1992.

By using ODBC statements in a C++ program, you can access files in a number of different databases, such as, MS Access, MS SQL, Oracle, DB2 and My SQL. In addition to the ODBC software, a separate module or driver is needed for each database to be accessed.

Setting up ODBC data source

In order to make a connection from 3rd party products using ODBC, an ODBC data source is needed. A data source stores connection information such as user name, password, and location of database.

Steps for setting up a data source:

Step 1:

ODBC Administrator can be started by going to Control Panel and double clicking on 32 bit ODBC or Starting the utility called "32bit ODBC Administrator” if you have the ODBC SDK installed.

Step 2:

Stay at the User Data Source tab and click on Add. This will bring up another window titled "Create New Data Source".

Step 3:

Pick the ODBC driver that to be used. Pick the InterBase driver which is called

"InterBase 5.x driver by Visigenic (*.gdb)" and then click on Finish. This will bring up a new window with the title "InterBase ODBC Configuration".

Step 4:

Fill in the blank fields in this window

Data Source Name: Make up a name for your data source.

Description: This is the description of the data source. It's not required.

Network Protocol: Choose the protocol from the drop down list.

Database: Fill in the physical full path to the database including the database name to server.

Server: Fill in the server name. If you choose the protocol "local", this will default to the local server.

Username: Fill in the database user name.

Password: Fill in the password corresponding to the above user name. Go to the Advanced tab and fill in the CharacterSet and Roles.

Step 5: Clicking the OK button will bring back to the main form. You should see the newly added user data source there.

Note: A user data source is a data source visible to the user whereas a system data source is visible to the system.

 Connecting from Delphi or C++ Builder using the ODBC data source

ODBC connection from Delphi is very similar to connecting using Borland Development Environment from Delphi. Here is an example of connecting using the Tquery component. This example will also display the results of a sql statement.

Step 1:

Drop a Tquery, a Tdatasource, and a Tdbgrid component on a Delphi form.

Step 2:

Set the following properties for the Tquery component: DatabaseName: Pick from the list the data source name you just created in ODBC Administrator.

SQL: Input the SQL statement to be executed. For example: "select * from table1".

Active: Set to True to connect. And supply user name and password on connection.

Step 3:

Set the following properties for the Tdatasource component:

Data Set: Set to the name of the Tquery component, or "query1" in this case.

Step 4:

Set the following properties for the TDBGrid component:

Data Source: Set to the name of the Tdatasource component, or "data source1" in this Case

Step 5:

Now you can see the returned results from select statement in the dbgrid area.

3.4 Connecting MS Visual C++ 5.0 to Databases

Now we have to create an ODBC data-source, which points to your database.

Step 1: Start up ODBC Administrator.

Double click the "32bit ODBC" icon in Control Panel to start the ODBC administrator.

Step 2: Click the "Add" button to create a new data-source, select the driver you wish to use (if your database is say, MS SQL select the "Microsoft SQL Driver" and so on) and click the "finish" button.

Step 3:

Enter a name for the data source in the "Data Source Name" field. "Description" field is optional.

Step 4: Click on the "Select" button from the "Database" field. A browser box appears where you select the location of your MS SQL database file. When done click the "OK" button to return back to the previous screen and "OK" again to complete the creation of the data source. Now click the "OK" button to quit the ODBC administrator.

Step 5: Now, we can start writing a C++ program that will open a connection to the database and perform an SQL query. The SQL query can be any SQL statement to search, insert, update or delete data in the database. This program will not do any validation of whether or not a record with the same value already exists in the database table and  the SQL string is a legal SQL statement. A set of C/C++ functions are supplied with ODBC and are found in the two header files sql.h and sqlext.h. We would need to include both the header files in the program using the "#include" operation. 

Code to Connect C/C++ to the ODBC data source

The code for connecting C/C++ to OBDC data source (“ABC”) and performing SQL query is given below . The code does not include error handling considered desirable when modifying the table or establishing and closing the connection to the database. You will need to change the name of the data source if you wish to use this code. The database may also require a user ID and password.

// ODBC data source is called "ABC". It then executes a SQL statement “SELECT

Model

// FROM Makes WHERE Make = ' Suzuki';" should pull out all models made by Suzuki

stored in the database

#include <sqlext.h>

#include <stdio.h>

#include <iostream.h>

void main()

{

HENV hEnv = NULL; // Handle from SQLAllocEnv()

HDBC hDBC = NULL; // Handle for Connection

HSTMT hStmt = NULL; // Statement handle

UCHAR szDSN[SQL_MAX_DSN_LENGTH] = "ABC"; // Data Source Name

UCHAR* szUID = NULL; // User ID buffer

UCHAR* szPasswd = NULL; // Password buffer

UCHAR szModel[128]; // Model buffer

SDWORD cbModel; // Model buffer bytes received

UCHAR szSqlStr[] = "Select Model From Makes Where Make=''Suzuki";

// SQL string

RETCODE retcode; // Return code

// allocate memory for ODBC Environment handle

SQLAllocEnv (&hEnv); // Allocate memory for the connection handle

SQLAllocConnect (hEnv, &hDBC);

// connect to the data source "ABC" using userid and password.

retcode = SQLConnect (hDBC, szDSN, SQL_NTS, szUID, SQL_NTS, szPasswd,

SQL_NTS);

if (retcode == SQL_SUCCESS || retcode == SQL_SUCCESS_WITH_INFO)

{

// allocate memory for the statement handle

retcode = SQLAllocStmt (hDBC, &hStmt);

// prepare the SQL statement by assigning it to the statement handle

retcode = SQLPrepare (hStmt, szSqlStr, sizeof (szSqlStr));

// execute SQL statement handle

retcode = SQLExecute (hStmt);

// Project only column 1 which is the models

SQLBindCol (hStmt, 1, SQL_C_CHAR, szModel, sizeof(szModel), &cbModel);

// Get row of data from the result set defined above in the statement

retcode = SQLFetch (hStmt);

while (retcode == SQL_SUCCESS || retcode == SQL_SUCCESS_WITH_INFO)

{

cout ("\t%s\n", szModel); // Print row (model)

retcode = SQLFetch (hStmt); // Fetch next row from result set

}

// Free the allocated statement handle

SQLFreeStmt (hStmt, SQL_DROP);

// Disconnect from datasource

SQLDisconnect (hDBC);

// Free the allocated connection handle

SQLFreeConnect (hDBC);

// Free the allocated ODBC environment handle

SQLFreeEnv (hEnv);

}

Read More

Fibonacci Numbers : An Introduction

 

Fibonacci Numbers

Fibonacci numbers denote a sequence of numbers that go under the name of Italian mathematician Leonardo Fibonacci.1 More precisely, these numbers are known as Fibonacci sequence, and the numbers that belong to this are called Fibonacci numbers. The sequence actually has quite a simple definition, namely:

F(1) = 1,

F(2) = 1,

F(n) = F(n − 1) + F(n − 2) (for n > 2).

In concrete terms, the sequence can be enumerated as 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . . .. The Fibonacci sequence F(n) is known to attract widespread interest for frequently appearing as a numerical model when we try to build models representing natural phenomena, such as the arrangement of seeds in sunflowers, the number of rabbit siblings, and others. Let us deepen our understanding of recursive calls using this sequence. At the same time, let us discover the limitations of recursive calls and introduce further refinements.

2.2.1 Computing Fibonacci Numbers F(n) Arising from

Recursive Calls

There is one particular aspect that must be considered carefully when working with recursive calls.We have seen that, in recursive calls, the algorithm capable of solving its own partial problem is reused. It is worth noting to what extent this “partial problem” is necessary. In the Tower of Hanoi problem, we reused the algorithm for solving the partial problem of size n − 1 to solve a problem of size n. Considering the definition of Fibonacci numbers F(n), the values of both F(n − 1) and F(n − 2) are required. From this fact, we learn that it does not suffice to show a clear solution for the small partial problem in n = 1, but the solutions for n = 1 and n = 2 are 1  also needed. If we construct the algorithm according to its definition while paying attention to this point, we obtain the algorithm below. Using this algorithm, the n-th Fibonacci number F(n) can be obtained by calling Fibr(n), which produces the returned value as its output.

Algorithm 13: recursive algorithm Fibr(n) to compute the n-th Fibonacci number

F(n)

Input : n

Output: the n-th Fibonacci number F(n)

1 if n = 1 then return 1;

2 if n = 2 then return 1;

3 return Fibr(n − 1) + Fibr(n − 2);

Exercise 20 Implement and execute the algorithm above. How will the

program behave when n is made slightly larger (by a few tens)?

2.2.2 Execution Time of Fibr Based on Recursive Calls

When we implement and execute Fibr(n), execution clearly slows down for values around n = 40 and above. Why does this occur? Let us consider an execution time tF (n). When considering execution times, examining the recursive equation is inevitable. In concrete terms, we have:

• For n = 1: a constant time tF (1) = c1

• For n = 2: a constant time tF (2) = c2

• For n > 2: for a given constant c3, tF (n) = tF (n − 1) + tF (n − 2) + c3

Here, the value of the constant itself has no meaning, and therefore, we can simply

denote them as c. By adding c to both sides of the equation, for n > 2 we can write:

tF (n) + c = (tF (n − 1) + c) + (tF (n − 2) + c)

which is exactly equivalent to the definition of Fibonacci numbers. In other words,

the execution time tF (n) of Fibr(n) can be considered proportional to the value of

Fibonacci numbers.  it is known that Fibonacci numbers F(n) will be F(n) ∼ _(1.618n). In other words, Fibonacci numbers constitute an exponential function. Therefore, if we compute Fibonacci numbers according to their definition, the computation time tends to increase exponentially, that is, if n becomes larger, the computation time of a naïve implementation is excessively large.

2.2.3 Fast Method for Computing Fibonacci Numbers

We learnt that, according to the definition, the time required to compute Fibonacci numbers increases exponentially. However, some readers may feel intrigued by that. For instance, to compute F(9), only F(8) to F(1) suffice. First, let us solve the question why  the time required for computing Fibonacci numbers increases exponentially. For example, F(9) can be computed if F(8) and F(7) are available. Computing F(8) only requires knowing F(7) and F(6), and computing F(7) only requires F(6) and F(5), and so forth. This calling mechanism is illustrated in image

 

What we need to note here is “who is callingwho.” For instance, if we pay attention to F(7), this value is called twice, that is, upon the computation of both F(9) and F(8). That is, F(7) is nested twice to compute F(9). Likewise, F(6) is called from F(8) and F(7), and F(7) is called twice. This structure becomes more evident as we approach the leaves of the tree structure. F(2) and F(3) appear in Figure remarkably often. Thus, the Fibr(n) algorithm based on recursive calls computes the same value over and over again in a wasteful fashion.

Algorithm 14: Algorithm Fiba(n) to compute the n-th Fibonacci number F(n)

using array Fa[]

Input : n

Output: n-th Fibonacci number F(n)

1 Fa[1] ←1;

2 Fa[2] ←1;

3 for i ← 3, 4, . . . , n do

4 Fa[i] ← Fa[i − 1] + Fa[i − 2];

5 end

6 output Fa[n];

 

First, F(1) and F(2) are directly computed when i = 1, 2. Then, for i > 2 it is quite clear that for computing Fa[i ] we already have the correct values of Fa[i − 1] and Fa[i − 2]. These two observations indicate to us that Fibonacci numbers can be correctly computed by this algorithm. Therefore, the computation time of the Fiba(n) algorithm is linear, that is, proportional to n, which means it is extremely fast. Let us stop for a while to think ahead. For i > 2, what is necessary for computing F(i ) is F(i − 1) and F(i − 2), and elements further behind are not needed. In other words, provided that we keep in mind the last two elements, the array itself is unnecessary. With that perception in mind, we can write an even more efficient algorithm (from the viewpoint of memory space).

Algorithm 15: Algorithm Fib2(n) to compute the n-th Fibonacci number F(n)

without using arrays

Input : n

Output: n-th Fibonacci number F(n)

1 if n < 3 then

2 output “1”;

3 else

4 Fa1 ← 1 ; /* Memorize F(1) */

5 Fa2 ← 1 ; /* Memorize F(2) */

6 for i ← 3, 4, . . . , n do

7 Fa ← Fa2 + Fa1 ; /* Compute/memorize F(i ) = F(i − 1) + F(i − 2) */

8 Fa1 ← Fa2 ; /* Update F(i − 2) with F(i − 1) */

9 Fa2 ← Fa ; /* Update F(i − 1) with F(i ) */

10 end

11 output Fa;

12 end

 

Read More