Java incurable diseases One

What are the differences and roles of JDK and JRE?

• JDK (Java development Kit)
  Is the Java SDK, a product of Sun Microsystems for Java developers.
  The JDK contains the JRE, in the JDK installation directory, there is a directory named JRE, there are two folders Bin and Lib, where it can be considered that the bin is the jvm,lib in the JVM is required to work the class library, and the JVM and Lib are called the JRE.
  The JDK is the core of the entire Java, including the Java Runtime Environment JRE (Java Runtime envirnment), a stack of Java tools (JAVAC/JAVA/JDB, etc.), and a Java-based class library (that is, the Java API includes Rt.jar).
  ①se (J2SE), Standard Edition, is a version we typically use, starting with JDK 5.0 and renaming Java SE.
  ②ee (EE), Enterprise Edition, Corporate Edition, uses this JDK to develop the Java EE application, starting with JDK 5.0, and renaming it to the JavaScript.
  ③me (J2ME), Micro Edition, is primarily used for Java applications on mobile devices and embedded devices, starting with JDK 5.0 and renaming Java ME.
  jdk=jre+jvm+ Other running Java programs generally require the user's computer to install the JRE environment (Java Runtime Environment), no Jre,java program can not run, and no Java program, the JRE is useless.

• JRE (Java Runtime Environment)
  Is the Java program's operating environment, for Java program users, not developers.
  The JRE is the set of environments necessary to run a Java program, including the JVM standard implementation and the Java Core Class library. It includes Java virtual machines, Java platform core classes, and supporting files. On the Windows machine, the virtual machine files are

Environmental variables classpath role?

The CLASSPATH environment variable holds the addresses of directories and jar files, which are used for Java programs to search for classes at compile and run time, which is consistent with the path variable, separated by semicolons, and, if it is a jar file, the absolute path of the jar file.

How do I search for a path for a Java program's dynamically specified class?

The Java and Javac commands in the JDK provide a "-CP" or "-classpath" option for the Java program to dynamically specify the class search path, they are very simple to use, only need to put the corresponding file directory or jar file path following the corresponding options, as follows:

javac -cp D:\java\work\log4j.jar HelloWorld.javajava -cp D:\java\work\log4j.jar HelloWorld或者javac -classpath D:\java\work\log4j.jar HelloWorld.javajava -classpath D:\java\work\log4j.jar HelloWorld

Use the command prompt to package Java programs into jars

The jar file is a format file after the Java program is packaged, and it generally holds a class file, a configuration file, and a MAINIFEST.MF file. The main intent of the jar file is to facilitate the release and deployment of the program, and the JDK provides a jar tool command that can be used to package the Java program.

0 M i} {-C 目录} 文件名...eg:jar cf hello.jar HelloWorld.class

where {c T x u} These four parameters must be selected, the file name is also required, {v m e 0 m i} is optional.

• -C: Create a JAR Package
• -T: Displays a list of the contents of the JAR package
• -X: Unpack the jar package
• -U: Add File to Jar package
• -F: Specifies the file name of the jar package
• -V: Generate detailed reports and output to standard devices
• -M: Specify the MAINIFEST.MF file, the MAINIFEST.MF file can make some settings for the jar package and its contents
• -E:
• -0: Do not compress content when generating jar package
• -M: does not generate a manifest file for all files and ignores the-m setting
• -I: Create an index file for the specified jar file
• -C: Means to go to the appropriate directory before executing the jar command

what does the "static" keyword mean? Is it possible to overwrite (override) a private or static method in Java?

The "static" keyword indicates that a member variable or a member method can be accessed without an instance variable of the class to which it belongs. The static method in Java cannot be overridden because method overrides are dynamically bound based on the runtime, while the static method is statically bound at compile time. The static method is not relevant to any instances of the class, so it is conceptually not applicable.

can I access non-static variables in the static environment?

The static variable belongs to the class in Java, and it has the same value in all instances. Static variables are initialized when the class is airborne into Java virtual. If your code tries to access a non-static variable without an instance, the compiler will give an error because the variables have not been created yet and are not associated with any instances.

What are the data types supported by Java? What is auto-unboxing?

The 8 basic data types supported in the Java language are:

• Byte
• Short
• Int
• Long
• Float
• Double
• Boolean
• Char

Auto-Boxing is a conversion of the Java compiler between the base data type and the corresponding object wrapper type. For example: Convert int to integer,double into double, and so on. The reverse is automatic unpacking.

What does method overrides (overriding) and method overloads (overloading) in Java mean?

Method overloads in Java occur when the same class has two or more methods with the same name but different parameters. In contrast, the method overrides the method that the subclass redefined the parent class. Method overrides must have the same method name, parameter list, and return type. The override may not restrict access to the methods it covers.

in Java, what is a constructor function? What is a constructor overload? What is a copy constructor?

When a new object is created, the constructor is called. Each class has a constructor function. The Java compiler creates a default constructor for this class in cases where the programmer does not provide a constructor for the class.

Constructor overloading and method overloading are similar in Java. You can create multiple constructors for a class. Each constructor must have its own unique argument list.

Java does not support copy constructors like in C + + because Java does not create a default copy constructor if you do not write the constructor yourself.

does Java support multiple inheritance?

Not supported, Java does not support multiple inheritance. Each class can inherit only one class, but it can implement multiple interfaces.

What is the difference between an interface and an abstract class?

• All methods in an interface are implicitly abstract. Abstract classes can contain both abstract and non-abstract methods.
• A class can implement many interfaces, but only one abstract class is inherited
• Class if you want to implement an interface, it must implement all the methods that the interface declares. However, a class can not implement all methods of an abstract class declaration, and of course, in this case, the class must also be declared abstract.
• An abstract class can implement an interface without providing an interface method implementation.
• The variables declared in the Java interface are final by default. An abstract class can contain non-final variables.
• The member functions in the Java interface are public by default. The member functions of an abstract class can be private,protected or public.
• An interface is absolutely abstract and cannot be instantiated. An abstract class can also not be instantiated, but it can be called if it contains the main method.

What is value passing and reference passing?

• An object is passed by value, which means that a copy of the object is passed. Therefore, even if you change the object copy, the value of the source object is not affected.
• object is passed by reference, meaning that it is not the actual object, but the reference to the object. Therefore, changes made externally to the referenced object are reflected on all objects.

What is the difference between a process and a thread?

A process is an application that executes, and a thread is an execution sequence within a process. A process can have multiple threads. Threads are also called lightweight processes.

How many different ways are there to create threads?

There are three ways to create threads:

• Inherit the thread class
• Implementing the Runnable Interface
• Applications can use the executor framework to create a thread pool

Implementing the Runnable interface is more popular because this does not require inheriting the thread class. This requires multiple inheritance (while Java does not support multiple inheritance) in cases where other objects have been inherited in the design of the application, and only interfaces can be implemented. At the same time, the thread pool is very efficient and easy to implement and use.

A summary explanation of the various available states of the thread.

Threads can be in the following States during execution:

• Ready (Runnable): The thread is ready to run, not necessarily immediately start execution.
• Running (Running): The code of the thread that the process is executing.
• Waiting (Waiting): The thread is in a blocked state, waiting for the external processing to end.
• Sleep (sleeping): The thread is forced to sleep.
• I/O blocking (Blocked on I/O): Waits for I/O operation to complete.
• Synchronous blocking (Blocked on synchronization): Waits for a lock to be acquired.
• Death (Dead): The thread completed execution.

What is the difference between a synchronization method and a synchronized code block?

In the Java language, each object has a lock. A thread can use the Synchronized keyword to obtain a lock on an object. The Synchronized keyword can be applied at the method level (coarse-grained locks) or at the code block level (fine-grained locks).

How does thread synchronization work inside the monitor? What level of synchronization should the program do?

Monitors and locks are used in Java virtual machines. The monitor monitors a block of synchronization code to ensure that only one thread executes the synchronized code block at a time. Each monitor is associated with an object reference. The thread does not allow synchronization code to be executed until the lock is acquired.

What is deadlock (deadlock)?

When using multithreading, a very simple way to avoid deadlocks is to specify the order in which locks are acquired and force threads to acquire locks in the order specified. Therefore, if all the threads lock and release the lock in the same order, there will be no deadlock.

. What are the basic interfaces of the Java Collection Class framework?

The Java Collection class provides a set of well-designed interfaces and classes that support the manipulation of a set of objects. The most basic interfaces within the Java Collection class are:

• Collection: Represents a set of objects, each of which is its child element.
• Set: A collection that does not contain duplicate elements.
• List: A sequence of collection, and can contain repeating elements.
• Map: You can map a key (key) to an object with a value, and the key cannot be duplicated.

Why does the collection class not implement the cloneable and serializable interfaces?

The collection class interface specifies a set of objects called elements. Each specific implementation class of the collection class interface can optionally save and sort the elements in its own way. Some collection classes allow duplicate keys, some are not allowed.

What is an iterator (Iterator)?

The iterator interface provides many ways to iterate over a collection element. Each collection class contains an iterative method that can return an iterator instance. Iterators can delete elements of the underlying collection during the iteration.

What is the difference between iterator and listiterator?

Their differences are listed below:

• The iterator can be used to traverse the set and list collection, but Listiterator can only traverse the list.
• Iterator to a collection can only be forward traversal, listiterator can be either forward or back.
• Listiterator implements the iterator interface and includes other functions such as adding elements, replacing elements, getting the index of the previous and subsequent elements, and so on.

What is the difference between fast failure (fail-fast) and security failure (fail-safe)?

Iterator's security failure is based on a copy of the underlying collection, so it is not affected by modifications on the source collection. All of the collection classes below the Java.util package are fast failures, and all classes under the Java.util.concurrent package fail safely. A fast-failing iterator throws an concurrentmodificationexception exception, and a security-failed iterator never throws such an exception.

How does the HashMap in Java work?

HashMap in Java is a key-value pair (Key-value) that stores elements. HashMap requires a hash function that uses the hashcode () and Equals () methods to add and retrieve elements to the collection/collection. When the put () method is called, HashMap calculates the hash value of the key and stores the key-value pair on the appropriate index in the collection. If the key already exists, value is updated to the new value. Some of the important features of HashMap are its capacity (capacity), load factor (payload factor) and expansion limit (threshold resizing).

Where does the importance of the hashcode () and Equals () methods manifest?

HashMap in Java uses the hashcode () and Equals () methods to determine the index of key-value pairs, which are used when the values are obtained by key. If these two methods are not implemented correctly, two different keys may have the same hash value, and therefore may be considered equal by the collection. Moreover, these two methods are also used to discover duplicate elements. So the realization of these two methods is very important to the accuracy and correctness of hashmap.

What's the difference between HashMap and Hashtable?

HashMap and Hashtable both implement the map interface, so many features are very similar. However, they have the following different points:

• HashMap allows keys and values to be null, while Hashtable does not allow keys or values to be null.
• The Hashtable is synchronous, while HashMap is not. Therefore, HashMap is more suitable for single-threaded environments, while Hashtable is suitable for multithreaded environments.
• HashMap provides a collection of keys that can be used for iteration, so HashMap is a quick failure. On the other hand, Hashtable provides an enumeration of keys (enumeration).
• Hashtable is generally considered to be a legacy class.

What is the difference between an array and a list (ArrayList)? When should I use array instead of ArrayList?

The different points of the array and ArrayList are listed below:

• An array can contain primitive types and object types, and ArrayList can only contain object types.
• The array size is fixed, and the size of the ArrayList is dynamically changing.
• ArrayList provides more methods and features, such as AddAll (), RemoveAll (), iterator (), and so on.
• For basic type data, the collection uses automatic boxing to reduce the coding effort. However, this approach is relatively slow when dealing with fixed-size base data types.

What's the difference between ArrayList and LinkedList?

ArrayList and LinkedList all implement the list interface, they have the following different points:

• ArrayList is an index-based data interface, and its underlying is an array. It can randomly access elements with an O (1) time complexity. In contrast, LinkedList stores its data as a list of elements, with each element linked to its previous and subsequent elements, in which case the time complexity of finding an element is O (n).
• It is faster to insert, add, and delete than Arraylist,linkedlist, because when an element is added anywhere in the collection, it is not necessary to recalculate the size as an array or to update the index.
• LinkedList accounts for more memory than ArrayList because LinkedList stores two references for each node, one to the previous element, and one to the next.

what do the comparable and comparator interfaces do? List the differences between them.

Java provides a comparable interface that contains only one CompareTo () method. This method can be used to sort two objects in a single order. Specifically, it returns a negative number, 0, a positive number to indicate that the input object is less than, equal to, greater than the already existing object. Java provides a comparator interface that contains two methods of compare () and Equals (). The Compare () method is used to sort two input parameters, return a negative number, 0, and a positive number indicates that the first parameter is less than, equal to, greater than the second argument. The Equals () method requires an object as a parameter that determines whether the input parameters are equal to comparator. This method returns true only if the input parameter is also a comparator and the input parameter is the same as the current comparator's ordering result.

What is the Java priority queue?

Priorityqueue is an unbounded queue based on a priority heap whose elements are sorted in natural order (natural orders). At the time of creation, we can provide it with a comparator that is responsible for ordering the elements. Priorityqueue do not allow null values because they do not have a natural order, or they do not have any associated comparators. Finally, Priorityqueue is not thread-safe, and the time complexity of the queue and the queue is O (log (n)).

do you know the big O symbol (big-o notation)? Can you give examples of different data structures?

The large O symbol describes how well the size of the algorithm or performance is in the worst scenario when the elements in the data structure increase. The large o symbol can also be used to describe other behaviors, such as memory consumption. Because the collection class is actually a data structure, we generally use the large O notation to choose the best implementation based on time, memory, and performance. The large o symbol provides a good indication of the performance of a large amount of data.

How do I weigh the use of unordered arrays or ordered arrays?

The greatest benefit of an ordered array is that the time complexity of the lookup is O (log n), and the unordered array is O (n). The disadvantage of an ordered array is that the time complexity of the insert operation is O (n), because elements with large values need to be moved backward to make the new element space. Instead, the insertion time complexity of an unordered array is constant O (1).

What are the best practices for the Java Collection Class framework?

It is important for performance to correctly select the type of collection to use according to the needs of the application, such as: if the size of the element is fixed and can be known beforehand, we should use array instead of ArrayList.

• Some collection classes allow you to specify the initial capacity. Therefore, if we can estimate the number of elements stored, we can set the initial capacity to avoid recalculation of hash values or expansion.
• For type safety, the reason for readability and robustness is always to use generics. Also, using generics avoids classcastexception at run time.
• Using the invariant class provided by the JDK (immutable Class) as the key to the map avoids the Hash-code () and Equals () methods for our own classes.
• The interface is better than the implementation when programming.
• The underlying collection is actually empty, the return length is a collection of 0 or an array, do not return null.

What are the differences between the enumeration interface and the iterator interface?

The enumeration is twice times faster than iterator and consumes less memory at the same time. However, iterator is far more secure than enumeration because other threads are not able to modify objects in the collection that is being traversed by iterator. At the same time, iterator allows the caller to delete elements from the underlying collection, which is not possible for enumeration.

What's the difference between HashSet and TreeSet?

• HashSet is implemented by a hash table, so its elements are unordered. The time complexity of the add (), remove (), contains () method is O (1).
• On the other hand, TreeSet is implemented by a tree-shaped structure in which the elements are ordered. Therefore, the time complexity of the add (), remove (), contains () method is O (Logn).

What is the purpose of garbage collection in Java? When does garbage collection take place?

The purpose of garbage collection is to identify and discard objects that the app is no longer using to free and reuse resources.

what will System.GC () and RUNTIME.GC () do?

These two methods are used to prompt the JVM for garbage collection. However, starting or delaying a garbage collection immediately depends on the JVM.

when is the Finalize () method called? What is the purpose of the destructor (finalization)?

The garbage collector calls the object's Finalize () method before releasing the memory occupied by the object. It is generally recommended that the resources held by the object be disposed of in this method.

if the object's reference is set to NULL, will the garbage collector immediately release the memory occupied by the object?

No, in the next garbage collection cycle, this object will be recoverable.

What is the structure of the Java heap like? What is the permanent generation in the heap (Perm Gen space)?

The JVM's heap is the run-time data area, and all instances and arrays of classes are allocated memory on the heap. It is created when the JVM is started. The heap memory that the object occupies is reclaimed by the automatic memory management system, which is the garbage collector.

Heap memory is made up of surviving and dying objects. The surviving objects are accessible to the app and are not garbage collected. The object of death is the object that the app is inaccessible and has not been reclaimed by the garbage collector. Until the garbage collector reclaims these objects, they will occupy the heap memory space.

What is the difference between a serial (serial) collector and a throughput (throughput) collector?

The throughput collector uses a parallel version of the new generation garbage collector, which is used for medium-sized and large-scale data applications. The serial collector is sufficient for most small applications, which require about 100M of memory on modern processors.

in Java, when can objects be garbage collected?

This object can be recycled when the object becomes inaccessible to applications that currently use the object.

will garbage collection occur in the JVM's permanent generation?

Garbage collection does not occur in a permanent generation, and if it is permanently full or exceeds the threshold, a full GC is triggered. If you look closely at the output of the garbage collector, you will find that the permanent generation is also recycled. This is why the correct permanent generation size is very important for avoiding full GC.

Some of the content reference from the link [http://www.importnew.com/10980.html] part of the content if there is similar please inform: [[email protected]]

Java incurable diseases One