Skip to main content

How to Work with Basic Controls in NetBeans: Java Programming

After talking about many elementary concepts and features of GUI in Java, we have reached a point where we can design our first application. But prior to that we shall learn to work with some most common controls. And after that we shall design our very first GUI application.

There are many graphical controls that are used in java GUI programming. Here’re the list of common GUI controls used:

  • TextField is a basic field that allows the user to type some textual information. It allows at most one line of input. To input some more lines, programmer have to use TextArea discussed below.
  • Label is another basic control that lets you display uneditable text. It is the basic unit that is used almost in every jFrame in Java GUI Application. Label is used to indicating about to do something like in entry form it indicates about where to enter name, address etc.
  • Button displays common GUI button and performs an action when the users clicks on it or presses Enter key after choosing it. Used when programmer wants to do something on the Frame window.
  • TextArea is a component that is used to input multiple lines of text. It optionally allows the user to edit the text. Programmer can also disable the editing option for the user.

After working a lot in NetBeans IDE, programmer have to save the overall work for further use. Programmer can save the work by clicking File → Save or File → Save As commands. Toolbar have also an icon to do the same task i.e. Save.

In further articles we will do some creativity to learn more about these controls as well as working of these controls in NetBeans IDE.


Popular posts from this blog

difference between structure and union in C Language

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

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video

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

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

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

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

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

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

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

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