Skip to main content

What are Naming Conventions in NetBeans: Java Programming

Object Naming Conventions, the process of giving a name to the control, basically used to access a control in coding part of programming language. Java NetBeans IDE have its own rules, described in the article, to name a control while programming.

A control's name is one of its most important attributes because you literally refer to a control by its name whenever you want it to do something. Names are so important that every time you put a control on your form, NetBeans IDE automatically gives a name to it. If programmer add a jButton, NetBeans IDE names it jButton1; if you add a jTextField, it automatically named jTextField1.

However, naming controls like this, may be confusing. While naming controls, you need to take care of these things.
  • Must begin with a letter.
  • Must contain only letters, numbers, and the underscore character (_); punctuation characters and spaces are not allowed.
  • Omit the initial letter "J" in object names and you may add its type at the end of it, like ReCalculateCheckBox for an object of class JCheckBox (not ReCalculateCheckBox!). It is just a recommendation, not a rule laid out by Java.

Friendly Names

When naming is a control, the first letter of the friendly name is generally uppercase. This make it easier to read the control’s name, because you can easily differentiate between the friendly name and the control’s abbreviation e.g. ReadonlyCheckBox.  

Name a control

To name a control in NetBeans, double click the control to be named in the Inspector window and type a new name.

What are Naming Conventions in NetBeans: Java Programming

Alternatively, you can right-click on the control’s name in Inspector window or the control itself in design space and select Change Variable Name………. command. The same process can be done through properties pane. Before you actually start working with controls, you should also know how to setup properties for a control and also about event and listeners. Later articles will describe these with examples.

Change name using Properties Window


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 …