Skip to main content

Important Topics

Important Topics Of Java

Core Java :(*imp)

1.Oops, Concept. *
2.Multi-Threading.
3.Exception Handling.*
4.Collection.*

Advance Java:
1.Jsp.
2.Servlet.
3.Jdbc Connection Setup.

Frameworks:

Spring:

1.Spring Ioc.
2.Spring MVC.
3.Spring & Hibernate Integration file. (spring-servlet.xml)

Hibernate:

1. Hibernate XML file.(config. file).
2.Relationship.
3. Hibernate Annotations.
4. Hibernate  Class And Interface.

Spring Boot:

1.Spring Boot Starter Projects
2.Spring Boot Starter Parent
3.Auto Configuration


Most often questions asked in Java interviews are based on these concepts(in the approximately increasing order of difficulty):

  1. Polymorphism
  2. Dynamic Binding
  3. Abstraction
  4. Data hiding
  5. Inheritance
  6. Method overriding
  7. Exception Handling
  8. Database connection setup(JDBC/ODBC)
  9. Access modifiers
  10. Exception cascading
  11. Immutability
  12. Unit testing and integration testing
  13. Wrapper classes
  14. Object class
  15. Java libraries and packages
  16. Java util class
  17. Java collections
  18. Java generics
  19. Microservices
  20. Object-Oriented Design
  21. Design Patterns(Singleton, Factory, etc)
  22. Frameworks(Play framework, Spring boot, Apache Tomcat, Hibernate)
  23. Java Reflection

Comments

Popular posts from this blog

JDK 25: The new features in Java 25

 Java Development Kit (JDK) 25, scheduled for release in September 2025, is set to introduce several significant enhancements. Here's an overview of the notable features: 1. Stable Values API (Preview): This feature introduces stable values—objects holding immutable data treated as constants by the Java Virtual Machine (JVM). By allowing greater flexibility in initialization timing compared to final fields, stable values aim to improve application startup times. They enable performance optimizations akin to constant-folding, previously exclusive to JDK code, and ensure thread-safe, single-time initialization. This decouples the creation of stable values from their initialization without significant performance penalties.  2. Removal of 32-bit x86 Port: JDK 25 plans to eliminate both the source code and build support for the 32-bit x86 port, which was deprecated in JDK 24. Maintaining this port has become less beneficial, especially with the challenges in keeping it updated wit...

What is Amazon Web Services (AWS)?

 Amazon Web Services Amazon Web Services is a cloud computing platform provided by Amazon. The AWS offers all three service models such as Software as a Service (SaaS), Infrastructure as a Service (IAAS), and Platform as a Service (PaaS). There are more services which comprise the Amazon Web Services including Amazon Elastic Compute Cloud (EC2) which provides virtual servers, Amazon Simple Storage Service (S3) which provides scalable storage for backups, analytics. Then there are other services such as Amazon relational database management system, DynamoDB, AWS Migration hub, and more. AWS provides services in almost every category from mobile development to data analytics. Benefits of using Amazon Web Services: AWS gives access to organizations to use programming models , database and operating system. It provides a cost effective service in which you only have to pay for what you use. Applications can be deployed in multiple regions with just a few clicks. ...

How does a hash map work internally in Java?

Hash map work internally in Java Basically, HashMap is an array of Entry class, a static inner class defined in HashMap is as below: static class Entry implements Map. Entry  { final K key; V value; Entry next; final int hash; //getters and setters } Each element in Hashmap stores in it a key, its value, a reference to next entry in case hash value is the same for two entries, in that case, a linked list will be formed. Default initial capacity of a HashMap is 16 i.e a HashMap is initialized with a default 16 sized array. Now, let us see what happens when we put an element into HashMap. Following is the code for put method in hashmap: public V put(K key, V value) { if (key == null) return putForNullKey(value); int hash = hash(key.hashCode()); int i = indexFor(hash, table.length); for (Entry e = table[i]; e != null; e = e.next) { Object k; if (e.hash == hash && ((k = e.key) == key || key.equals(k))) { V oldValue = e.value; e....