Determine the types of java, Data Structure & Algorithms

Determine the types of JAVA

Java has two parts...

1. Core language -- variables, arrays, objects

o Java Virtual Machine (JVM) runs the core language

o Core language is simple enough to run on small devices -- phones, smart cards, PDAs.

2. Libraries

o Java includes a large collection of standard library classes to provide "off the shelf" code.

(Useful built-in classes which comes with language to perform basic tasks)

o Example of these classes is String, HashMap, ArrayList, StringTokenizer (to break string into substrings), Date ...

Java programmers are more productive in part since they have access to a large set of standard, well documented library classes.


Posted Date: 9/20/2013 2:39:53 AM | Location : United States

Related Discussions:- Determine the types of java, Assignment Help, Ask Question on Determine the types of java, Get Answer, Expert's Help, Determine the types of java Discussions

Write discussion on Determine the types of java
Your posts are moderated
Related Questions
advanatges of dynamic data structure in programming

The ?-Notation (Lower Bound) This notation provides a lower bound for a function to within a constant factor. We write f(n) = ?(g(n)), if there are positive constants n 0 and

Phong Shading Phong shading too is based on interpolation, but instead of interpolating the colour value, it is the normal vector, which is interpolated for each point and a co

I am looking for assignment help on the topic Data Structures. It would be great if anyone help me.

Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Q. Develop a representation for a list where insertions and deletions can be done at either end. Such a structure is known as a Deque (Double ended queue). Write functions for inse

Define the term 'complexity of an algorithm; Complexity of an algorithm is the calculate of analysis of algorithm. Analyzing an algorithm means predicting the resources that th

Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.

The fundamental element of linked list is a "record" structure of at least two fields. The object which holds the data & refers to the next element into the list is called a node .