What primitive Java types? Howmany are they and what are
their names?

Answers were Sorted based on User's Feedback



What primitive Java types? Howmany are they and what are their names?..

Answer / ramesh

primitive type is predefined in java.
byte , int ,short ,long , float , double,boolean and char
are the primitive data types used in java.

Is This Answer Correct ?    7 Yes 0 No

What primitive Java types? Howmany are they and what are their names?..

Answer / prasanna

They are implicitly defined in Java.There are 8 of them and
they are:
boolean,char,byte,short,int,long,float,double

Is This Answer Correct ?    7 Yes 0 No

What primitive Java types? Howmany are they and what are their names?..

Answer / ravikiran(aptech mumbai)

primitive datatypes are the one which will allocate some
memory in the stack.And there are 8 primitive data types
1).byte
2).short
3).int
4).long
5).float
6).double
7).char
8).boolean

Is This Answer Correct ?    3 Yes 0 No

Post New Answer

More Core Java Interview Questions

How do you find the maximum number from an array without comparing and sorting?

0 Answers   BlackRock,


What about anonymous inner classes in java?

0 Answers  


What are the latest versions in JAVA related areas?

3 Answers   Netcraft,


What is the use of default method in interface in java? Explain

0 Answers  


What is the difference between array and array list in java?

0 Answers  






where lives in jvm

5 Answers  


Can we override the main method?

4 Answers  


What is the static keyword?

0 Answers  


What do you understand by abstract classes?

0 Answers   HCL,


Is void a keyword in java?

0 Answers  


Which keyword specify that a variable is effectively final ?

0 Answers  


Write an algorithm program in java for the following question.. In a VLSI design techniques,they used rectangles to design circuits. EVery rectangle is to be placed according to x,y coordinates. Check whether or not two rectangles overlap each other. Here overlapping of rectangles is acceptable, if 1) one rectangle intersect with other. 2) one rectangle fully covers other. The time of algorithm should not exceed o(n logn).

0 Answers  


Categories