Skip to main content

Object properties and Methods in Java Script

These objects all have particular properties and methods that are associated with their respective objects and they can be accessed and manipulated. A property of an object is a predefined variable that you can assign a value to with simple dot notation syntax like this:

objectNamePropertyName = value

For instance, if you want to change background color of document object to yellow, you would access the bgColor property and assign the String “yellow” to it like this:


A Method of an Object is just a predefined function that has already been assigned to an Object by Netscape. You invoke a Method on an Object with same dot notation like this.

objectName.methodName( )

Window Object is the parent object of all other objects In a page, which means it’s at the top of the hierarchy of all page content, including those that have FRAMESETs and FRAMEs. All other objects are its descendants or child objects. Some of the child objects like the document object are also parent or container objects for other objects that are lower down in the hierarchy. All child objects are said to be properties of their respective parent objects and such they can be manipulated and referenced with java script.
Suppose you want to give focus to window at some point in script. You do that by referencing the window object and calling the focus( ) method like this

Window.focus( );

Window object is always the parent object, Netscape allows you to omit it from expression that invoke other objects, since it is always assumed to be there.


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 …