COLLECTIONS IN JAVA, KPR Institute Engineering and Technology, Autonomous Engineering Institution, Coimbatore, India

All
UG Courses

Offline (Outside the campus)
COLLECTIONS IN JAVA
Expert Talk Dept. Level
DATE
Apr 25, 2024
TIME
09:00 AM to 11:00 AM
DEPARTMENT
Artificial Intelligence and Data Science
TOTAL PARTICIPATES
78
Outcome
  • The fundamental concepts behind each type of collection.

  • How to use collections effectively to solve various programming problems.

  • The performance implications of choosing one collection over another in different scenarios.

  • Common operations and their time complexities for each type of collection.

  • Iterating through collections using different methods such as iterators, enhanced for loops, or streams.

  • How to manipulate collections using methods provided by the Java Collections Framework, such as add, remove, contains, etc.

  • The importance of understanding generics and how they are used in collections to ensure type safety.

Summary

The event started with Welcome Address by Dr Sankar Ganesh S. He introduced the guest to the audience.

In Java, collections are data structures used to store and manipulate groups of objects. The following classes were explained by the Resource Person.:

  1. ArrayList: An ordered collection that allows duplicate elements. It dynamically resizes itself when elements are added or removed.

  2. LinkedList: Similar to ArrayList but implemented as a doubly linked list. It provides more efficient insertion and deletion operations at the cost of slower access times.

  3. HashSet: An unordered collection that does not allow duplicate elements. It uses hashing to store elements, providing constant-time performance for basic operations like add, remove, and contains.

  4. TreeSet: A sorted set implemented using a red-black tree. It stores elements in sorted order and does not allow duplicates.

  5. HashMap: A hash table-based implementation of the Map interface. It stores key-value pairs and provides constant-time performance for basic operations like get and put.

  6. TreeMap: A sorted map implemented using a red-black tree. It stores key-value pairs in sorted order based on the natural ordering of the keys or a custom comparator.

    Finally the event ended with vote of thanks.


***END***


Still wondering where to begin?
Apply Now

21st Century Engineering College in Coimbatore

World is transforming everyday. In the rapidly evolving engineering landscape, we have an Increased responsibility to transform the engineering education from traditional curriculum to meet the 21st century skills like Creativity, Critical Thinking, Collaboration and Communication. Through our unique and strategic approach we enable our students to learn beyond and prepare them for life long success.

21st Century Engineering College