softimage

Browser Statistics

2011-10-24T02:02:00.000+05:30

Browser Statistics Month by Month

2011	Internet Explorer	Firefox	Chrome	Safari	Opera
September	22.9 %	39.7 %	30.5 %	4.0 %	2.2 %
August	22.4 %	40.6 %	30.3 %	3.8 %	2.3 %
July	22.0 %	42.0 %	29.4 %	3.6 %	2.4 %
June	23.2 %	42.2 %	27.9 %	3.7 %	2.4 %
May	24.9 %	42.4 %	25.9 %	4.0 %	2.4 %
April	24.3 %	42.9 %	25.6 %	4.1 %	2.6 %
March	25.8 %	42.2 %	25.0 %	4.0 %	2.5 %
February	26.5 %	42.4 %	24.1 %	4.1 %	2.5 %
January	26.6 %	42.8 %	23.8 %	4.0 %	2.5 %

2010	Internet Explorer	Firefox	Chrome	Safari	Opera
December	27.5 %	43.5 %	22.4 %	3.8 %	2.2 %
November	28.6 %	44.0 %	20.5 %	4.0 %	2.3 %
October	29.7 %	44.1 %	19.2 %	3.9 %	2.2 %
September	31.1 %	45.1 %	17.3 %	3.7 %	2.2 %
August	30.7 %	45.8 %	17.0 %	3.5 %	2.3 %
July	30.4 %	46.4 %	16.7 %	3.4 %	2.3 %
June	31.0 %	46.6 %	15.9 %	3.6 %	2.1 %
May	32.2 %	46.9 %	14.5 %	3.5 %	2.2 %
April	33.4 %	46.4 %	13.6 %	3.7 %	2.2 %
March	34.9 %	46.2 %	12.3 %	3.7 %	2.2 %
February	35.3 %	46.5 %	11.6 %	3.8 %	2.1 %
January	36.2 %	46.3 %	10.8 %	3.7 %	2.2 %

2009	Internet Explorer	Firefox	Chrome	Safari	Opera
December	37.2 %	46.4 %	9.8 %	3.6 %	2.3 %
November	37.7 %	47.0 %	8.5 %	3.8 %	2.3 %
October	37.5 %	47.5 %	8.0 %	3.8 %	2.3 %
September	39.6 %	46.6 %	7.1 %	3.6 %	2.2 %
August	39.3 %	47.4 %	7.0 %	3.3 %	2.1 %
July	39.4 %	47.9 %	6.5 %	3.3 %	2.1 %
June	40.7 %	47.3 %	6.0 %	3.1 %	2.1 %
May	41.0 %	47.7 %	5.5 %	3.0 %	2.2 %
April	42.1 %	47.1 %	4.9 %	3.0 %	2.2 %
March	43.3 %	46.5 %	4.2 %	3.1 %	2.3 %
February	43.6 %	46.4 %	4.0 %	3.0 %	2.2 %
January	44.8 %	45.5 %	3.9 %	3.0 %	2.3 %

2008	Internet Explorer	Firefox	Chrome	Safari	Opera
December	46.0 %	44.4 %	3.6 %	2.7 %	2.4 %
November	47.0 %	44.2 %	3.1 %	2.7 %	2.3 %
October	47.4 %	44.0 %	3.0 %	2.8 %	2.2 %
September	49.0 %	42.6 %	3.1 %	2.7 %	2.0 %
August	51.0 %	43.7 %		2.6 %	2.1 %
July	52.4 %	42.6 %		2.5 %	1.9 %
June	54.2 %	41.0 %		2.6 %	1.7 %
May	54.4 %	39.8 %		2.4 %	1.5 %
April	54.8 %	39.1 %		2.2 %	1.4 %
March	53.9 %	37.0 %		2.1 %	1.4 %
February	54.7 %	36.5 %		2.0 %	1.4 %
January	54.7 %	36.4 %		1.9 %	1.4 %

2007	Internet Explorer	Firefox	Mozilla	Safari	Opera
November	56.0 %	36.3 %	1.2 %	1.8 %	1.6 %
September	57.2 %	35.4 %	1.2 %	1.6 %	1.5 %
July	58.5 %	34.5 %	1.4 %	1.5 %	1.9 %
May	58.9 %	33.7 %	1.3 %	1.5 %	1.7 %
March	58.7 %	31.8 %	1.3 %	1.6 %	1.6 %
January	58.6 %	31.0 %	1.5 %	1.7 %	1.5 %

2006	Internet Explorer	Firefox	Mozilla	Netscape	Opera
November	60.6 %	29.9 %	2.5 %	0.2 %	1.5 %
September	62.1 %	27.3 %	2.3 %	0.4 %	1.6 %
July	62.4 %	25.5 %	2.3 %	0.4 %	1.4 %
May	63.0 %	25.7 %	2.3 %	0.3 %	1.5 %
March	64.7 %	24.5 %	2.4 %	0.5 %	1.5 %
January	66.0 %	25.0 %	3.1 %	0.5 %	1.6 %

2005	Internet Explorer	Firefox	Mozilla	Netscape	Opera
November	68.9 %	23.6 %	2.8 %	0.4 %	1.5 %
September	75.5 %	18.0 %	2.5 %	0.4 %	1.2 %
July	73.8 %	19.8 %	2.6 %	0.5 %	1.2 %
May	71.6 %	21.0 %	3.1 %	0.7 %	1.3 %
March	72.5 %	18.9 %	3.3 %	1.0 %	1.9 %
January	74.5 %	16.6 %	3.4 %	1.1 %	1.9 %

2004	Internet Explorer		Mozilla	Netscape	Opera
November	76.2 %		16.5 %	1.7 %	1.6 %
September	79.0 %		13.7 %	2.0 %	1.7 %
July	80.4 %		12.6 %	2.2 %	1.6 %
May	81.9 %		9.5 %	2.4 %	1.6 %
March	82.8 %		7.9 %	2.8 %	1.4 %
January	84.7 %		5.5 %	2.4 %	1.5 %

2003	Internet Explorer		Mozilla	Netscape	Opera
November	84.9 %		7.2 %	2.6 %	1.9 %
September	86.6 %		6.2 %	2.7 %	1.8 %
July	87.2 %		5.7 %	2.7 %	1.7 %
May	87.7 %		4.6 %	3.3 %	1.4 %
March	88.0 %		4.2 %	3.4 %	1.2 %
January	84.6 %		4.0 %	4.0 %

2002	Internet Explorer	AOL		Netscape
November	83.4 %	5.2 %		8.0 %
September	83.5 %	4.5 %		8.0 %
July	84.5 %	3.5 %		7.3 %
May	86.7 %	2.8 %		7.3 %
March	86.1 %	3.0 %		7.7 %
January	85.8 %	2.8 %		7.9 %

Internet Explorer	Microsoft Internet Explorer
Firefox	Mozilla Firefox (identified as Mozilla before 2005)
Chrome	Google Chrome
Mozilla	The Mozilla Suite (Gecko, Netscape)
Safari	Safari (and Konqueror. Both identified as Mozilla before 2007)
Opera	Opera (as of 2011, Opera Mini is included here)
Netscape	Netscape Navigator (identified as Mozilla after 2006)
AOL	America Online (based on both Internet Explorer and Mozilla)

6 useful Windows tricks

2011-07-30T02:31:00.000+05:30

You know that feeling you get when your friends or family see you do something on your computer that they've never seen before? If you’ve had this experience, you know that “world's coolest power-user” feeling. But if you haven’t, start here. Knowledge is power!

Read these six tips for Windows 7, Windows Vista, and Windows XP that will keep you schoolin' your friends and family.

1. Don't just maximize your windows—go full screen

When you need a really big window for viewing photos and videos, don't just maximize it: go full screen! This tip works great for viewing photos and videos at maximum size in Windows Explorer or Windows Media Player, utilizing screen space usually occupied by the header at the top of the screen and the taskbar at the bottom. Here’s how:
Open any photo in Windows Explorer, or open a photo or video clip in Windows Media Player. Do one of the following:

In Windows 7 and Windows XP, click the F11 key at the top of your keyboard.

The photo or video image enlarges to its maximum size and the title bar and taskbar are hidden.

Viewing a photo in Windows Explorer standard view

To undue full-screen mode and restore the window to its normal view, press the Esc (Escape) key at the top of your keyboard

2. Customize the Navigation pane

You can use the navigation pane (the left pane) to find files and folders and display links to frequently used folders and other items. You can also move or copy items to a destination in the navigation pane.
If you don't see the navigation pane on the left side of an open folder window, click Organize, point to Layout, and then click Navigation pane to display it.

To customize the navigation pane in Windows 7

In an open folder or library window, click Organize, and then click Folder and search options.
In the Folder Options dialog box, click the General tab, and then do one or both of the following:
- To show all the folders on your computer in the navigation pane, including your personal folder, select the Show all folders check box, click Apply to see the change, and then click OK.
- To automatically expand the navigation pane to the folder that's selected in the folder window, select the Automatically expand to current folder check box, and then click OK.

Customizing the navigation pane in Windows 7

More ways to customize your favorites in Windows 7

To add a folder, a saved search, a library, or even a drive as a favorite, drag it to the Favorites section in the navigation pane. Note: You can’t add individual file to Favorites, but you can add them to any folder in Favorites.
To change the order of favorites, drag a favorite to a new position in the list.
To restore the default favorites in the navigation pane, right-click Favorites, and then click Restore Favorite Links.
To view the folder where your favorites are stored, click Favorites in the navigation pane. Favorites are stored as shortcuts.
To remove a favorite, right-click the favorite, and then click Remove. This removes the favorite from the navigation pane—it doesn't delete the files or folders that the shortcut points to.

The Favorites area of the navigation pane in Windows 7

Add folders and files in Windows Vista

In Windows Vista, you can add folders to Favorite Links in the navigation pane so that you can open them from any folder window at any time. To do this, first open the folder that contains the subfolder you want to add. Then simply drag its icon from the original folder to where you want it in the navigation pane. You can also click Folders at the bottom of the pane and drag a folder from the folder list up into the Favorite Links section of the pane. Note: You can’t add individual files to Favorite Links, but you can add them to any folder in Favorite Links.

Pictures folder in Windows

3. Pin a program or items to the Windows 7 taskbar

You know what would make a great taskbar? One where you could pin your favorite applications or files so that you could open them quickly from any window at any time. Guess what? You can.
In Windows 7, you can also pin shortcuts for favorite or frequently used files, folders, and websites to the Jump Lists for each of those programs to the taskbar. Learn more about Jump Lists.
Pin a program to the taskbar
To pin a program shortcut to the taskbar, do one of the following:

If the program is already running, right-click the program's button on the taskbar (or drag the button toward the desktop) to open the program’s Jump List, and then click Pin this program to taskbar.
Or if the program isn't running, click Start, find the program’s icon, right-click the icon, and then click Pin to Taskbar.
You can also pin a program by dragging the program's shortcut from the desktop or Start menu to the taskbar.

Pinning a program to the taskbar

Using Jump Lists in Windows 7

Jump Lists on the taskbar give you quick access to the things you use most often. You can drag a file, folder, or website icon or a shortcut from the Start menu or the desktop to the taskbar. This pins the item to the Jump List and also pins the associated program to the taskbar. If you drag the shortcut to the taskbar and the associated program isn't already pinned there, then that program is pinned to the taskbar and the item is pinned to the program’s Jump List.

Pinning an item to a Jump List on the taskbar

To view the Jump List for a program, right-click the program's button on the taskbar. To open an item from a Jump List, open the program's Jump List, and then click the item.

4. Customize the Quick Launch Bar in Windows XP

In Windows XP, the customizable Quick Launch Bar also gives you convenient shortcuts to your favorite programs, folders, and files. The Quick Launch Bar remains accessible from most windows, so it’s a handy way to open the applications and files you use frequently.
If the Quick Launch Bar isn’t already visible to the right of the Start button , you’ll need to turn it on. To do that, right-click an open area of the taskbar. Hover your mouse pointer over Toolbars, then click Quick Launch. The Quick Launch Bar appears on your taskbar.

The Quick Launch Bar on the Windows XP taskbar

To add a program shortcut to the Quick Launch Bar, click the Start button, click All Programs, then click and drag the application you want to the Quick Launch Bar. Release the mouse button and the application’s icon appears in the Quick Launch Bar.
To add a folder or file shortcut to the Quick Launch Bar, open Windows Explorer, navigate to the folder, subfolder, or individual file you want, click and drag the folder or file you want to the Quick Launch Bar. Release the mouse button and the icon for the folder or file appears in the Quick Launch Bar.
To remove a shortcut from the Quick Launch Bar, right-click on the icon in the Quick Launch Bar of the application, folder, or file you want to remove and right-click it, click Delete, and then click Yes when asked if you’re sure you want to delete the shortcut. Note: Although the shortcut is removed from the Quick Launch Bar, the actual application, folder, or file has not been deleted from your computer.

5. Arrange windows on your desktop

In Windows, you can arrange windows side by side, which can be especially helpful when comparing two documents or when moving files from one place to another. Note: If you’re using a nonstandard setup (such as dual monitors), the tricks below may not work as expected.

Windows 7

Drag the title bar of a window to the left or right side of the screen until an outline of the expanded window appears.
Release the mouse to expand the window.
Repeat steps 1 and 2 with another window to arrange the windows side by side.

To return a window to its original size click the Maximize button in the window’s title bar and the window expands to full size.

The Maximize button

How to create a compressed folder(it's work as locker)

2011-05-14T03:01:00.001+05:30

How to create a compressed folder

If you want to create a compressed folder within another folder, go to method 1. If you want to create a compressed folder on your desktop, go to method 2.

Method 1: Use My Computer to create the compressed folder

Follow these steps to use My Computer to create a compressed folder:

On your desktop, double-click My Computer, and then open the folder in which you want to create the compressed folder. For example, if you want to make a compressed folder in the root folder of drive C, double-click My Computer, and then double-click drive C to open the root folder.

Note If you do not see a My Computer icon on your desktop, click Start, and then click My Computer.
On the File menu, point to New, and then click Compressed (zipped) Folder.
Type a name for the new compressed folder, and then press ENTER. Your new compressed folder is displayed as a folder icon with a zipper. Depending on which folder options that you have set, a .zip file name extension may also appear.

Method 2: Create the compressed folder on the desktop or in a folder

Right-click a blank area on the desktop or in an open folder, point to New, and then click Compressed (zipped) Folder.
Type a name for the new compressed folder, and then press ENTER. Your new compressed folder is displayed as a folder icon with a zipper. Depending on your preferences, a .zip file name extension may also appear.

How to move files and folders to and from a compressed folder

You move files and folders to or from compressed folders exactly as you move them to or from uncompressed folders. For example, you can drag files or folders to the compressed folder. When you move a file or a folder to a compressed folder, that file is automatically compressed. A file that is moved from a compressed folder is automatically uncompressed.

How to extract files from a compressed folder

Getting files or folders out of a compressed folder is known as extracting them. You can extract one file or folder at a time, or you can extract multiple files or folders. To extract a single file or folder, follow these steps:

Double-click the compressed folder to open it.
Then, drag the file or folder from the compressed folder to a new location.

Note The original, compressed files remain in the compressed folder.

To extract all the files and folders from a compressed folder, use the Extraction Wizard. To use the Extraction Wizard, follow these steps:

Double-click the compressed folder to open it. The Extract all files command appears in the Folder Tasks list.
Click Extract all files to start the Extraction Wizard, and then click Next to start the extraction process.
When you are prompted to select a location to put the extracted files, select a location, and then click Next. By default, Show extracted files is selected.
Click Finish to view the extracted files.

Note The original, compressed files still remain in the compressed folder after you run the Extraction Wizard.

How to protect a compressed folder by requiring a password

You can restrict access to files and folders in compressed folders by requiring a password.

Important The password for a protected, compressed file is not recoverable. If you lose the password, you will be unable to access that file.

Note You cannot protect an empty compressed folder with a password.

To protect the contents of a compressed folder, follow these steps:

Double-click the compressed folder that you want to protect.
On the File menu, click Add a Password.
In the Password box, type the password that you want to use. Type the same password in the Confirm Password box, and then click OK.

Note When you try to move or open a file that is protected with a password, a Password Needed dialog box is displayed. Type the correct password in the Password box, and then click OK.

The DatagramSocket Class

2011-04-24T00:29:00.001+05:30

The DatagramSocket Class

To send or receive a DatagramPacket, you need to open a datagram socket. In Java, a datagram socket is created and accessed through the DatagramSocket class:

public class DatagramSocket extends Object

All datagram sockets are bound to a local port, on which they listen for incoming data and which they place in the header of outgoing datagrams. If you're writing a client, you don't care what the local port is, so you call a constructor that lets the system assign an unused port (an anonymous port). This port number is placed in any outgoing datagrams and will be used by the server to address any response datagrams. If you're writing a server, clients need to know on which port the server is listening for incoming datagrams; therefore, when a server constructs a DatagramSocket, it must specify the local port on which it will listen. However, the sockets used by clients and servers are otherwise identical: they differ only in whether they use an anonymous (system-assigned) or a well-known port. There's no distinction between client sockets and server sockets, as there is with TCP; there is no such thing as a DatagramServerSocket.

The Constructors

The DatagramSocket class has three constructors that are used in different situations, much like the DatagramPacket class. The first constructor opens a datagram socket on an anonymous local port. The second constructor opens a datagram socket on a well-known local port that listens to all local network interfaces. The third constructor opens a datagram socket on a well-known local port on a specific network interface. All three constructors deal only with the local address and port. The remote address and port are stored in the DatagramPacket, not the DatagramSocket. Indeed, one DatagramSocket can send and receive datagrams from multiple remote hosts and ports.

public DatagramSocket( ) throws SocketException

This constructor creates a socket that is bound to an anonymous port. For example:

try {

DatagramSocket client = new DatagramSocket( );

// send packets...

}

catch (SocketException e) {

System.err.println(e);

}

You would use this constructor in a client that initiates a conversation with a server. In this scenario, you don't care what port you are using, because the server will send its response to the port from which the datagram originated. Letting the system assign a port means that you don't have to worry about finding an unused port. If for some reason you need to know the local port, you can find out with the getLocalPort( ) method described later in this chapter.

The same socket may be used to receive the datagrams that a server sends back to it. A SocketException is thrown if the socket can't be created. It's unusual for this constructor to throw an exception; it's hard to imagine situations in which the socket could not be opened, since the system gets to choose the local port.

public DatagramSocket(int port) throws SocketException

This constructor creates a socket that listens for incoming datagrams on a specific port, specified by the port argument. You would use this constructor to write a server that has to listen on a well-known port; if servers listened on anonymous ports, clients would not be able to contact them. A SocketException is thrown if the socket can't be created. There are two common reasons for the constructor to fail: the specified port is already occupied, or you are trying to connect to a port below 1,024 and you don't have sufficient privileges (i.e., you are not root on a Unix system; for better or worse, other platforms allow anyone to connect to low-numbered ports). TCP ports and UDP ports are not related. Two unrelated servers or clients can use the same port number if one uses UDP and the other uses TCP. Example 13.2 is a port scanner that looks for UDP ports in use on the local host. It decides that the port is in use if the DatagramSocket constructor throws an exception. As written, it looks at ports from 1,024 up to avoid Unix's requirement that it run as root to bind to ports below 1,024. You can easily extend it to check ports below 1,024, however, if you have root access or are running it on Windows or a Mac.

The speed at which UDPPortScanner runs depends strongly on the speed of your

machine and its UDP implementation. I've clocked Example 13.2 at as little as two

minutes on a moderately powered SPARCstation and as long as an hour on a

PowerBook 5300. Here are the results from one SPARCstation: The high-numbered UDP ports in the 30,000 range are Remote Procedure Call (RPC) services. Aside from RPC, some common protocols that use UDP are NFS, TFTP, and FSP. It's much harder to scan UDP ports on a remote system than to scan for remote TCP ports. Whereas there's always some indication that your TCP packet has been received by a listening port regardless of application layer protocol, UDP provides no such guarantees. To determine that a UDP server is listening, you have to send it a packet it will recognize and respond to.

public DatagramSocket(int port, InetAddress address) throws SocketException

This constructor is primarily used on multihomed hosts; it creates a socket that listens for incoming datagrams on a specific port and network interface. The port argumentis the port on which this socket listens for datagrams. As with TCP sockets, you need to be root on a Unix system to create a DatagramSocket on a port below 1,024. The address argument is an InetAddress object matching one of the host's network addresses. A SocketException is thrown if the socket can't be created. There are three common reasons for this constructor to fail: the specified port is already occupied, you are trying to connect to a port below 1,024 and you don't have sufficient privileges (i.e., you are not root on a Unix system), or address is not the address of one of the system's network interfaces.

Sending and Receiving Datagrams

The primary task of the DatagramSocket class is to send and receive UDP datagrams. One socket can both send and receive. Indeed, it can send and receive to and from multiple hosts at the same time.

public void send(DatagramPacket dp) throws IOException

Once a DatagramPacket is created and a DatagramSocket is constructed, you send the packet by passing it to the socket's send( ) method. For example, if theSocket is a DatagramSocket object and theOutput is a DatagramPacket object, you send theOutput using theSocket like this:

theSocket.send(theOutput);

If there's a problem sending the data, an IOException may be thrown. However, this is less common with DatagramSocket than Socket or ServerSocket, since the unreliable nature of UDP means you won't get an exception just because the packet doesn't arrive at its destination. You may get an IOException if you're trying to send a larger datagram than your host's native networking software supports, but then again you may not. This depends heavily on the native UDP software in the OS and the native code that interfaces between this and Java's DatagramSocketImpl class. This method may also throw a SecurityException if the SecurityManager won't let you communicate with the host to which the packet is addressed. This is primarily a problem for applets.

public void receive(DatagramPacket dp) throws IOException

This method receives a single UDP datagram from the network and stores it in the pre-existing DatagramPacket object dp. Like the accept( ) method in the ServerSocket class, this method blocks the calling thread until a datagram arrives. If your program does anything besides wait for datagrams, you should call receive( ) in a separate thread. The datagram's buffer should be large enough to hold the data received. If not, receive( ) places as much data in the buffer as it can hold; the rest is lost. It may be useful to remember that the maximum size of the data portion of a UDP datagram is 65,507 bytes. (That's the 65,536-byte maximum size of an IP datagram minus the 20- byte size of the IP header and the 8-byte size of the UDP header.) Some application protocols that use UDP further restrict the maximum number of bytes in a packet; for instance, NFS uses a maximum packet size of 8,192 bytes. If there's a problem receiving the data, an IOException may be thrown. In practice, this is rare. Unlike send( ), this method does not throw a SecurityException if an applet receives a datagram from other than the applet host. However, it will silently discard all such packets. (This behavior prevents a denial-of-service attack against applets that receive UDP datagrams.)

public void close( )

Calling a DatagramSocket object's close( ) method frees the port occupied by that socket. For example:

try {

DatagramSocket theServer = new DatagramSocket( );

theServer.close( );

}

catch (SocketException e) {

System.err.println(e);

}

It's never a bad idea to close a DatagramSocket when you're through with it; it's particularly important to close an unneeded socket if your program will continue to run for a significant amount of time. For example, the close( ) method was essential in Example 13.2, UDPPortScanner: if this program did not close the sockets it opened, it would tie up every UDP port on the system for a significant amount of time. On the other hand, if the program ends as soon as you're through with the DatagramSocket, you don't need to close the socket explicitly; the socket is automatically closed on garbage collection. However, Java won't run the garbage collector just because you've run out of ports or sockets, unless by lucky happenstance you run out of memory at the same time. On the gripping hand, closing unneeded sockets never hurts and is good programming practice.

public int getLocalPort( )

A DatagramSocket's getLocalPort( ) method returns an int that represents the local port on which the socket is listening. You would use this method if you created a DatagramSocket with an anonymous port and want to find out what port you have been assigned. For example:

try {

DatagramSocket ds = new DatagramSocket( );

System.out.println("The socket is using port " +

ds.getLocalPort( ));

}

catch (SocketException e) {

}

Managing Connections

Unlike TCP sockets, datagram sockets aren't very picky about whom they'll talk to. In fact, by default they'll talk to anyone. But this is often not what you want. For instance, applets are only allowed to send datagrams to and receive datagrams from the applet host. An NFS or FSP client should accept packets only from the server it's talking to. A networked game should listen to datagrams only from the people playing the game. In Java 1.1, programs must manually check the source addresses and ports of the hosts sending them data to make sure they're who they should be. However, Java 1.2 adds four methods that let you choose which host you can send datagrams to and receive datagrams from, while rejecting all others' packets.

public void connect(InetAddress host, int port) // Java 1.2

The connect( ) method doesn't really establish a connection in the TCP sense. However, it does specify that the DatagramSocket will send packets to and receive packets from only the specified remote host on the specified remote port. Attempts to send packets to a different host or port will throw an IllegalArgumentException. Packets received from a different host or a different port will be discarded without an exception or other notification. A security check is made when the connect( ) method is invoked. If the VM is allowed to send data to that host and port, then the check passes silently. Otherwise, a SecurityException is thrown. However, once the connection has been made, send( ) and receive( ) on that DatagramSocket no longer make the security checks they'd normally make.

public void disconnect()

The disconnect( ) method breaks the "connection" of a connected DatagramSocket so that it can once again send packets to and receive packets from any host and port.

public int getPort( )

If and only if a DatagramSocket is connected, the getPort( ) method returns the remote port to which it is connected. Otherwise, it returns -1.

public InetAddress getInetAddress( )

If and only if a DatagramSocket is connected, the getInetAddress( ) method returns the address of the remote host to which it is connected. Otherwise, it returns null.

SERVLET

2011-04-23T12:06:00.001+05:30

SERVLET

INTRODUCTION TO SERVELT:

A Servlet is a server-side component, written in java that dynamically extends the functionality of a server. Similar to the manner in which applets run inside a Java-enabled Web browser on the client, servlets execute on a Java-enabled user.

Servlets similar to CGI allows two-way interaction between the client and server. Servlets offer advantages over CGI in the areas of performance, portability, and security.

Basic Servlet Structure:

All servlets that perform some useful function have two things in common.

· First, they all extend one of two servlet classes- GenericServlet or HttpServlet. Extending these classes provides a framework for creating a servlet as well as significant default functionality.

· Second, all servlets override at least one method wherein custom functionality is implemented.

public class SkeletonServlet extends HttpServlet

{

public void init()

{

//initialization code goes here

}

public void service()

{

//meaningful work happens here

}

public void destroy()

{

//free resources here

}

init() :

It is called a single time when the servlet is first loaded. It is similar to class constructor in that it provides a method wherein initialization code is guaranteed to be run.

destroy() :

It is executed when the servlet is unloaded. It is used to free any resources held by the servlet.

service() :

The server calls this method wherever a servlet request is received. For Http servlets, this method should usually not be overridden.

The three important packages that are to be imported by the Java servlet program are:

· javax.servlet

· javax.servlet.http

· java.io

The service() method makes use of two important methods:

· doget()

· dopost()

These methods have two arguments to request and to respond. The servlet program throws two exceptions namely, ServletException and IOException. It is important to set the content type which may be text/html or text/css. It corresponds to the program to which we implement. The inputs can be requested by using the getParameter() method.

The client side program is a HTML program which is used to execute the program. The URL (where the server program is located) is to be mentioned in the FORM tag. By connecting the client program to the server program and by running the client program the required output is obtained.

c program for STUDENT MARKLIST.

2011-04-17T01:13:00.001+05:30

c program for STUDENT MARKLIST.

#include<stdio.h>
#include<conio.h>
int k=0;
struct stud
{
int rn;
char name[30];
int m1,m2,m3,total;
float avg;
char grade,result;
}s[30];
void main()
{
int no,roll=101,i;
clrscr();
printf("Enter NO of Students:");
scanf("%d",&no);
for(i=0;i<no;i++)
{
clrscr();
s[k].rn=roll;
printf("\nEnter the Student Roll Number: %d ",s[k].rn);
printf("\nEnter the Student Name:");
fflush(stdin);
gets(s[k].name);
printf("\nEnter the Three Marks");
scanf("%d",&s[k].m1);
scanf("%d",&s[k].m2);
scanf("%d",&s[k].m3);
if(s[k].m1>=35 && s[k].m2>=35 && s[k].m3>=35)
{
s[k].result='P';
}
else
{
s[k].result = 'F';
}
s[k].total = s[k].m1+s[k].m2+s[k].m3;
printf("The Total is : %d",s[k].total);
s[k].avg=s[k].total/3;
if(s[k].avg>=60)
{
if(s[k].result == 'P')
{
s[k].grade = 'A';
}
else
{
s[k].grade = 'N';
}
}
else if(s[k].avg>=50)
{
if(s[k].result == 'P')
{
s[k].grade = 'B';
}
else
{
s[k].grade = 'N';
}
}
else if(s[k].avg>=35)
{
if(s[k].result == 'P')
{
s[k].grade = 'C';
}
else
{
s[k].grade = 'N';
}
}
getch();
k++;
roll++;
}
printf("\n*******************************************************");
printf("\n STUDENT MARKLIST ");
printf("\n*******************************************************");
printf("\nROLL \tNAME MARK1 MARK2 MARK3 TOTAL RESULT Average GRADE");
for(i=0;i<no;i++)
{
printf("\n%d\t%s %d %d %d %d %c %0.1f %c",s[i].rn,s[i].name,s[i].m1,s[i].m2,s[i].m3,s[i].total,s[i].result,s[i].avg,s[i].grade);
}
getch();
}

C Program for Library Operation.

2011-04-17T00:58:00.002+05:30

C Program for Library Operation.

#include<stdio.h>
#include<conio.h>
int i=0;
void add();
void search();
void sort();
void sorta();
struct book
{
char bookname[50];
char author[50];
double price;
int nocopy;
}book[50];
void main()
{
int ch;
while(1)
{
clrscr();
printf("********************");
printf("\nLIBRARY MANAGEMENT");
printf("\n******************");
printf("\n1-ADD TO LIBRARY");
printf("\n2-SEARCH A BOOK");
printf("\n3-SORT BY BOOK NAME");
printf("\n4-SORT BY AUTHOR NAME");
printf("\n5-EXIT");
printf("\nEnter your choice:");
scanf("%d",&ch);
switch(ch)
{
case 1: add();
break;
case 2: search();
break;
case 3: sort();
break;
case 4: sorta();
break;
case 5: exit(0);
default: puts("Please enter 1-5 only");
getch();
}
}
}
void add()
{
printf("\n\nADD TO LIBRARY");
printf("\nEnter the Bookname: ");
fflush(stdin);
gets(book[i].bookname);
printf("\nEnter the Author name: ");
fflush(stdin);
gets(book[i].author);
printf("\nEnter the Price of the Book: ");
scanf("%ld",&book[i].price);
printf("\nEnter no of copies : ");
scanf("%d",&book[i].nocopy);
printf("STORED");
printf("\nBOOK NAME: %s",book[i].bookname);
printf("\nAUTHOR : %s",book[i].author);
printf("\nPRICE : %d",book[i].price);
printf("\nNO OF COPIES: %d",book[i].nocopy);
i++;
getch();
}
void search()
{
int f=0,y,j,x;
char bookn[50],authorname[50];
printf("\n Enter the Book Name: ");
fflush(stdin);
gets(bookn);
printf("\n Enter the Author Name: ");
fflush(stdin);
gets(authorname);
printf("\nThe Given Search");
printf("\nThe Book Name is: %s",bookn);
printf("\nThe Author Name is : %s",authorname);
for(j=0;j<i;j++)
{
x= strcmp(book[j].bookname,bookn);
y=strcmp(book[j].author,authorname);
if(x==0&&y==0)
{
printf("\nBOOK IS FOUND");
getch();
f=1;
}
}
if(f==0)
{
printf("\nBOOK NOT FOUND");
getch();
}
getch();
}
void sort()
{
int j,k,x;
char t[50];
for(j=0;j<i;j++)
{
for(k=0;k<j;k++)
{
x = (strcmp(book[k].bookname,book[k+1].bookname));
if(x>0)
{
strcpy(t,book[k].bookname);
strcpy(book[k].bookname ,book[k+1].bookname);
strcpy(book[k+1].bookname, t);
}
}
}
printf("\nSORTED BY BOOK NAME");
for(j=0;j<i;j++)
{
printf("\nThe BookName is:%s - %s",book[j].bookname,book[j].author);
}
getch();
}
void sorta()
{
int j,k,x;
char t[50];
for(j=0;j<i;j++)
{
for(k=0;k<j;k++)
{
x = (strcmp(book[k].author,book[k+1].author));
if(x>0)
{
strcpy(t,book[k].author);
strcpy(book[k].author ,book[k+1].author);
strcpy(book[k+1].author, t);
}
}
}
printf("\nSORTED BY AUTHOR NAME");
for(j=0;j<i;j++)
{
printf("\nThe AUTHOR NAME is:%s - %s",book[j].author,book[j].bookname);
}
getch();
}

C PROGRAM FOR PASCAL TRIANGLE.

2011-04-17T00:57:00.003+05:30

C PROGRAM FOR PASCAL TRIANGLE.

#include<stdio.h>
#include<conio.h>
void main()
{
int i=1,j,num,x=1;
clrscr();
printf("Please Enter the Number :");
scanf("%d",&num);
printf("\n\n");
printf("OUTPUT:\n");
printf("------");
printf("\n\n");
printf("The Pascal triangle is\n");
printf("**********************\n");
for(i=1;i<=num;i++)
{
for(j=1;j<=i;j++)
{
if(j==1)
{
x=1;
printf("%d",x);
}
else
{
x=(x*(i-j+1)/(j-1));
printf("%d",x);
}
}
printf("\n");
}
getch();
}

C Program For REPLACE OF STRING.

2011-04-17T00:57:00.001+05:30

C Program For REPLACE OF STRING.

#include<stdio.h>
#include<conio.h>
void main()
{
char a[100],b[100],c[100],d[100];
int i,j,k,l1,l2,l3,m,count=-1;
clrscr();
printf("\t\t\t REPLACE OF STRING ");
printf("\n\t\t\t ********************");
printf("\n\n\tINPUT");
printf("\n\t*******");
printf("\n\nEnter the first String:");
scanf("%[a-z ]s",a);
printf("\nEnter the substring:");
scanf("%s",b);
printf("\nEnter the replace string:");
scanf("%s",c);
printf("\n\n\tOUTPUT");
printf("\n\t*******");
for(i=0;a[i]!='\0';i++)
l1=i;
for(i=0;b[i]!='\0';i++)
l2=i;
for(i=0;c[i]!='\0';i++)
l3=i;
for(i=0;a[i]!='\0';i++)
d[i]=a[i];
d[i]='\0';
if(l1>=l2)
{
do
{
for(i=0,j=0;a[i]!='\0' && b[j]!='\0';i++ )
{
if(a[i]==b[j])
{
count++;
j++;
}
else
{
count=-1;
if(j>0)
i--;
j=0;
}
}
m=i;
if(count==l2)
{
i=i-j;
for(k=0;c[k]!='\0';i++,k++)
a[i]=c[k];
if(l2!=l3)
{
for( ;d[m]!='\0';m++,i++)
{
a[i]=d[m];
}
}
//a[i]='\0';
//printf("\nReplaced string:%s",a);
}
else
break;
//printf("\nThe substring is not there");
}while(a[i]!='\0');
printf("\nReplaced string:%s",a);
}
getch();
}

C Program for String Length.

2011-04-17T00:56:00.001+05:30

C Program for String Length.
#include<stdio.h>
#include<conio.h>
void main()
{
int i,c=0;
char a[50];
clrscr();
printf("OUTPUT\n");
printf("------");
printf("\n\n");
printf("Please Enter a String:\n");
printf("*********************");
scanf("%s",a);
for(i=0;a[i]!='\0';i++)
{
c=c+1;
}
printf("\n\n");
printf("Length Of The Given String is=%d\n",c);
printf("*****************************");
getch();
}

C Program for factorial using recursion.

2011-04-17T00:55:00.002+05:30

C Program for factorial using recursion.

#include<stdio.h>
#include<conio.h>
int fact(int);
void main()
{
int a,b=0,c;
clrscr();
printf("Enter the N value:");
scanf("%d",&a);
while(a<0)
{printf("\n\Enter only positive number.\n");
printf("Enter N value:");
scanf("%d",&a);
}
b=fact(a);
printf("%d",b);
getch();
}
int fact(int x)
{
if(x==0)
{
return(1);
}
else
{
return((x)*(fact(x-1)));
}
}

C Program for Exponential value.

2011-04-17T00:55:00.000+05:30

C Program for Exponential value.

#include<stdio.h>
#include<conio.h>
void main()
{
double term=1,expo=1;
float x;
int i;
clrscr();
printf("Enter the exp value of x: ");
scanf("%f",&x);
for(i=1;term>=0.00001;i++)
{
term *= x/i;
expo+=term;
}
printf("\Our Exp = %f %f\n",x,expo);
getch();
}

C Program For String Reverse.

2011-04-17T00:54:00.000+05:30

C Program For String Reverse.

#include<stdio.h>
#include<conio.h>
void main()
{
char n[50],j,i=0;
clrscr();
printf("OUTPUT\n");
printf("------");
printf("Enter String:\n");
printf("The Reverse Of The Given String is\n");
printf("**********************************");
while((n[i]=getchar())!='\n')i++;
for(j=i-1;j>=0;j--)
{
printf("%c",n[j]);
}
getch();
}

C Program for salesman problem.

2011-04-17T00:38:00.001+05:30

C Program for salesman problem.

#include<stdio.h>
#include<conio.h>
void main()
{
int ss[50][50]={0};
int x,y,sale,i,a,b,t=0;
clrscr();
printf("\nEnter the How many sales man:");
scanf("%d",&sale);
printf("\nEnter the How many Items:");
scanf("%d",&i);
for(a=0;a<sale;a++)
{
for(b=0;b<i;b++)
{
printf("Sales man [%d] item [%d]:",a+1,b+1);
scanf("%d",&ss[a][b]);
}
}
clrscr();
printf("\n**********************************************************");
printf("\n*********************SALES REPORT*************************");
printf("\n**********************************************************\n");
printf("\n\t\t");
for(b=0;b<i;b++)
{
printf("item[%d] ",b+1);
}
printf(" Total");
for(a=0;a<sale;a++)
{
printf("\nSales man [%d]",a+1);
for(b=0;b<i;b++)
{
printf(" %d\t",ss[a][b]);
t+=ss[a][b];
}
printf(" %d",t);
t=0;
}
printf("\n********************************************************\n");
printf("TOTAL :");
printf("\t\t");
x=0,y=0;
for(a=0;a<i;a++)
{
for(b=0;b<sale;b++)
{
x=x+ss[b][a];
}
y=y+x;
printf(" %d\t",x);
x=0;
}
printf(" %d\t",y);
printf("\n********************************************************");
getch();
}

C Program for BANK OPERATION

2011-04-17T00:27:00.001+05:30

C Program for BANK OPERATION.

#include<stdio.h>
#include<conio.h>
void creation();
void deposit();
void withdraw();
void bal();
int a=0,i = 101;
struct bank
{
int no;
char name[20];
float bal;
float dep;
}s[20];
void main()
{
int ch;
while(1)
{
clrscr();
printf("\n*********************");
printf("\n BANKING ");
printf("\n*********************");
printf("\n1-Creation");
printf("\n2-Deposit");
printf("\n3-Withdraw");
printf("\n4-Balance Enquiry");
printf("\n5-Exit");
printf("\nEnter your choice");
scanf("%d",&ch);
switch(ch)
{
case 1: creation();
break;
case 2: deposit();
break;
case 3: withdraw();
break;
case 4: bal();
break;
case 5: exit(0);
defalut: printf("Enter 1-5 only");
getch();
}
}
}
void creation()
{
printf("\n*************************************");
printf("\n ACCOUNT CREATION ");
printf("\n*************************************");
printf("\nYour Account Number is :%d",i);
s[a].no = i;
printf("\nEnter your Name:");
scanf("%s",s[a].name);
printf("\nYour Deposit is Minimum Rs.500");
s[a].dep=500;
a++;
i++;
getch();
}
void deposit()
{
int no,b=0,m=0;
float aa;
printf("\n*************************************");
printf("\n DEPOSIT ");
printf("\n*************************************");
printf("\nEnter your Account Number");
scanf("%d",&no);
for(b=0;b<i;b++)
{
if(s[b].no == no)
m = b;
}
if(s[m].no == no)
{
printf("\n Account Number : %d",s[m].no);
printf("\n Name : %s",s[m].name);
printf("\n Deposit : %f",s[m].dep);
printf("\n How Much Deposited Now:");
scanf("%f",&aa);
s[m].dep+=aa;
printf("\nDeposit Amount is :%f",s[m].dep);
getch();
}
else
{
printf("\nACCOUNT NUMBER IS INVALID");
getch();
}
}
void withdraw()
{
int no,b=0,m=0;
float aa;
printf("\n*************************************");
printf("\n WITHDRAW ");
printf("\n*************************************");
printf("\nEnter your Account Number");
scanf("%d",&no);
for(b=0;b<i;b++)
{
if(s[b].no == no)
m = b;
}
if(s[m].no == no)
{
printf("\n Account Number : %d",s[m].no);
printf("\n Name : %s",s[m].name);
printf("\n Deposit : %f",s[m].dep);
printf("\n How Much Withdraw Now:");
scanf("%f",&aa);
if(s[m].dep<aa+500)
{
printf("\nCANNOT WITHDRAW YOUR ACCOUNT HAS MINIMUM BALANCE");
getch();
}
else
{
s[m].dep-=aa;
printf("\nThe Balance Amount is:%f",s[m].dep);
}
}
else
{
printf("INVALID");
getch();
}
getch();
}
void bal()
{ int no,b=0,m=0;
float aa;
printf("\n*************************************");
printf("\n BALANCE ENQUIRY ");
printf("\n*************************************");
printf("\nEnter your Account Number");
scanf("%d",&no);
for(b=0;b<i;b++)
{
if(s[b].no == no)
m = b;
}
if(s[m].no==no)
{
printf("\n Account Number : %d",s[m].no);
printf("\n Name : %s",s[m].name);
printf("\n Deposit : %f",s[m].dep);
getch();
}
else
{
printf("INVALID");
getch();
}
}

C Program for finding COS THETA Value

2011-04-17T00:25:00.000+05:30

C Program for finding COS THETA Value

#include<stdio.h>
#include<conio.h>
#include<math.h>
#define ACC 0.0001
#define PI 3.14
void main()
{
int x,i;
float x1,x2,cosz=0,term;
clrscr();
printf("Enter the X value:");
scanf("%d",&x);
x1=(x*PI)/180;
// printf("%f",cos(x1));
x2=x1*x1;
term=1;
cosz=term;
for(i=2;fabs(term)>ACC;i=i+2)
{
term = (x2*(-term))/(i*(i-1));
cosz = cosz+term;
}
printf("\nNew Value%f",cosz);
getch();
}

C Program for Prime Number Generation.

2011-04-16T23:55:00.000+05:30

C Program for Prime Number Generation.

#include<stdio.h>
#include<conio.h>
void main()
{
int n,j,a=0,i;
clrscr();
printf(" Please Enter a number :");
scanf("%d",&n);
printf("\n\n");
printf("OUTPUT:\n");
printf("------");
printf("\n\n");
printf("The Prime Number series is\n");
printf("**************************");
for(j=1;j<=n;j++)
{
for(i=2;i<j;i++)
{
if(j%i==0)
{
a=1;
goto x;
}
}
if((a==0)&&(j!=1))
{
printf("\n%d",j);
}
x:
a=0;
}
getch();
}