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
Q. A Binary tree comprises 9 nodes. The preorder and inorder traversals of the tree yield the given sequence of nodes: Inorder :          E     A    C    K    F     H    D

Define container in terms of  object-oriented terms A Container is a broad category whose instances are all more specific things; there is never anything which is just a Contai

Q.  In the given figure find the shortest path from A to Z using Dijkstra's Algorithm.    Ans: 1.  P=φ;  T={A,B,C,D,E,F,G,H,I,J,K,L,M,Z} Let L(A)

One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi

#question bubble sort..

Q. Sort the sequence written below of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55                                                                      Ans:

What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.

Define neotaxonomy. Discuss how electron microscopy can help in solving a zoological problem faced by taxonomist.

Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.