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
In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

The searching technique that takes O (1) time to find a data is    Hashing is used to find a data

Write a program to simulate searching over a hashed file, with different assumptions for the sizeof file pages.Write a program to perform equality search operations on the hashed f

Decision Tree - ID3 algorithm: Imagine you only ever do one of the following four things for any weekend:   go shopping   watch a movie   play tennis   just

Explain an efficient way of storing a sparse matrix in memory.   A matrix in which number of zero entries are much higher than the number of non zero entries is called sparse mat

Q. Write down an algorithm to sort a given list by making use of Quick sort method. Describe the behaviour of Quick sort when input given to us is already sorted.

A graph with n vertices will absolutely have a parallel edge or self loop if the total number of edges is greater than n-1

QUESTION Explain the following data structures: (a) List (b) Stack (c) Queues Note : your explanation should consist of the definition, operations and examples.

An adjacency matrix representation of a graph cannot having information of : Parallel edges

Write an algorithm to count number of nodes in the circular linked list.                            Ans. Counting No of Nodes in Circular List Let list be a circular h