Internship at Tap Academy: Arrays and Objects in Java

🚀 Day 5 of My Internship Journey at Tap Academy Continuing my learning journey, today I explored one of the most fundamental data structures in Java — 1D Arrays. Here’s what I learned: 🔹 What is a 1D Array? A one-dimensional array is a collection of elements of the same data type stored in a contiguous memory location. It helps in managing multiple values using a single variable. 🔹 Declaration & Initialization Learned different ways to declare and initialize arrays: • int[] arr = new int[5]; • int[] arr = {1, 2, 3, 4, 5}; 🔹 Accessing Elements Array elements are accessed using index values starting from 0. Example: arr[0], arr[1] 🔹 Traversal of Array Understood how to iterate through arrays using loops like for loop to process each element efficiently. 🔹 Why Arrays are Important? ✔ Store multiple values efficiently ✔ Easy data access using index ✔ Helps in solving complex problems ✔ Foundation for advanced data structures Learning arrays gave me a strong foundation for handling data in Java and solving real-world problems more effectively. Excited to explore more data structures in the upcoming days! #Internship #Java #Arrays #DataStructures #Programming #LearningJourney #TapAcademy TAP Academy

🚀 Day 51 of My Internship Journey at Tap Academy Today’s learning deepened my understanding of how Java data structures work behind the scenes—especially how Linked Lists power core structures like Stacks, Queues, and Deques (Double-ended Queues). 🔹 Understanding the Core Concepts One of the key takeaways was how data access patterns define these structures: - Stack (LIFO) – Last-In, First-Out - Queue (FIFO) – First-In, First-Out - Deque (DQs) – Flexible insertion/removal from both ends This helped me see how choosing the right structure directly impacts performance and design. 🔹 LinkedList as a Foundation Using LinkedList, we implemented: - "push()" and "pop()" → Stack operations - "peek()" → View top element - "poll()" → Retrieve & remove elements (Queue behavior) What stood out is how doubly linked lists enable efficient insertions and deletions without shifting elements—making them powerful for dynamic data handling. 🔹 Memory vs Performance Trade-off While LinkedLists are flexible, they come with extra memory overhead due to node storage (data + pointers). In contrast, ArrayDeque: - Is more memory efficient - Has a default capacity of 16 - Provides faster performance for most stack/queue operations 👉 This comparison made it clear: choosing the right data structure depends on the use case, not just functionality. 🔹 The Bigger Picture Understanding the Java Collections Framework hierarchy is crucial. It’s not just about using methods—it’s about knowing why and when to use each structure. 💡 Key Learning: Consistent hands-on coding and experimenting with real implementations is the best way to master these concepts. Looking forward to applying these learnings in real-world projects! 💻🔥 #Java #DataStructures #LinkedList #Stack #Queue #Deque #JavaCollections #Programming #LearningJourney #InternshipExperience #TapAcademy TAP Academy Sharath R Harshit T Somanna M G

Day 11 of My Internship Journey at Tap Academy Continuing this journey, today I stepped deeper into one of the most important OOP concepts — Encapsulation. This concept truly shows how powerful and secure object-oriented programming can be when applied correctly. “Good code is not just about working — it’s about being secure, organized, and maintainable.” Today’s session helped me understand how data hiding and controlled access play a crucial role in real-world applications. 🔹 What I Worked On • Understanding Encapsulation in Java • Using private variables (data hiding) • Creating public getter and setter methods • Implementing encapsulation using classes 🔹 What I Learned ✔ How to protect data using access modifiers ✔ Why direct access to variables should be restricted ✔ How getters and setters provide controlled access ✔ Writing cleaner and more structured code 🔹 Key Realization Encapsulation is not just a concept — it’s a best practice for writing secure and maintainable code. It ensures that data is accessed only in the right way, reducing errors and improving code quality. This learning is making me think more like a developer rather than just a coder. Excited to explore more OOP concepts and apply them in real-world problems 🚀 #Internship #Java #Encapsulation #OOP #Programming #CodingJourney #LearningJourney #TapAcademy #SoftwareDevelopment TAP Academy

🚀 Day 41 of My Full Stack Developer Internship @ Tap Academy 💻✨ I’m excited to continue sharing my journey as a Full Stack Developer Intern! Every day is helping me strengthen my understanding of core Java concepts and data structures. 📘 Today’s Topic: HashSet in Java (Java Collections Framework) In today’s session, I explored the powerful HashSet class and how it efficiently stores and manages data. 🔹 Key Concepts I Learned: ✔️ No Duplicate Elements – HashSet automatically removes duplicate values ✔️ Unordered Collection – Does not maintain insertion order ✔️ Allows Null Values – Only one null element is permitted ✔️ Internal Working – Uses hashing mechanism (hash function & hash table) ✔️ Default Capacity & Load Factor – Initial capacity = 16, Load factor = 0.75 ✔️ Fast Operations – Insertion, deletion, and search in O(1) time complexity ✔️ Heterogeneous Data – Can store different types of objects 🔹 When to Use HashSet? 👉 When you need unique elements only 👉 When order is not important 👉 When you want fast performance 📊 I also explored how hash functions work internally, how elements are stored in buckets, and how load factor affects resizing of the HashSet. 📸 Sharing my handwritten notes from today’s learning session! 💡 Every concept I learn brings me one step closer to becoming a better developer. Consistency is key! 🔥 🔗 #FullStackDeveloper #Java #JavaCollections #HashSet #LearningJourney #Internship #TapAcademy #CodingLife #DeveloperJourney #100DaysOfCode #TechLearning #Programming #FutureDeveloper 🚀💻

🚀 **Day 4 of My Internship Journey at Tap Academy** Continuing my learning journey, today I explored one of the most important concepts in Java that helps in writing clean, reusable, and structured code — **Methods**. Here’s what I learned: 🔹 **What are Methods?** Methods are blocks of code designed to perform a specific task. They help in improving code reusability and reducing redundancy. 🔹 **Types of Methods in Java** • **Predefined Methods** – Built-in methods provided by Java (e.g., `println()`, `sqrt()`). • **User-defined Methods** – Methods created by programmers to perform custom operations. 🔹 **Based on Parameters and Return Type** • **Method with no parameters & no return value** • **Method with parameters & no return value** • **Method with no parameters & return value** • **Method with parameters & return value** 🔹 **Why Methods are Important?** ✔ Promote code reusability ✔ Improve readability ✔ Make debugging easier ✔ Help in modular programming Understanding methods gave me a clearer perspective on how large programs are structured and managed efficiently. Excited to apply these concepts in real coding problems and continue growing every day! #Internship #Java #Methods #Programming #LearningJourney #SoftwareDevelopment #TapAcademy  TAP Academy

My Internship Journey at Tap Academy Today, I stepped into one of the most important concepts in Java — Collections Framework 🚀 This session completely changed how I look at handling data in real-world applications. It’s not just about storing data anymore, but about doing it efficiently and smartly. 🔹 What I Explored • What is a Collection & why it is important • Difference between Data Structures vs Collections • Role of Collections in real-world applications • Introduction to List, Set, and Map interfaces • Deep dive into ArrayList • How Collections reduce manual coding effort 🔹 Key Learnings ✔ Collections are an inbuilt alternative to Data Structures ✔ No need to manually implement logic like traversal, resizing, etc. ✔ Everything is available as ready-made classes & methods ✔ ArrayList uses a dynamic (resizable) array internally ✔ Default capacity of ArrayList= 10 ✔ Supports heterogeneous data, duplicates, and null values ✔ Maintains insertion order ✔ Automatically resizes when capacity is exceeded 🔹 Real Understanding In DSA → we write logic manually In Collections → Java gives optimized logic already built-in So instead of writing 20 lines of code… we can solve the same problem in just a few lines using Collections. 🔹 Important Insight Learning Collections is not about “how it works internally” — it’s about when and where to use which class and method. Excited to explore more classes like LinkedList, Set, Map and master this powerful framework #Internship #Java #Collections #ArrayList #DSA #Programming #CodingJourney #LearningJourney #TapAcademy TAP Academy

Day 20 of My Internship Journey at Tap Academy Today’s session was all about Exception Handling in Java — understanding not just what errors occur, but how to handle them properly without breaking the application flow. “Writing code is one thing… making it reliable is another.” 🔹 What I Worked On • Difference between Error and Exception • Understanding Arithmetic Exception (divide by zero) • Real-time example using application flow (like ticket booking systems) • Internal flow of exception handling (JVM, Runtime System, Default Handler) • try-catch blocks (user-defined exception handling) • Handling multiple types of exceptions 🔹 What I Learned ✔ Exceptions mainly occur due to invalid or unexpected inputs ✔ If not handled, they lead to abrupt termination + data loss ✔ JVM creates an exception object and passes it to the Runtime System ✔ If no handler is found → Default Exception Handler stops the program ✔ Using try-catch prevents crashes and ensures smooth execution ✔ One generic catch is not always enough — different exceptions need proper handling 🔹 Key Understanding Handling exceptions is not just about avoiding crashes — it’s about maintaining user experience and application stability. A real-world example made it clear: Even if something goes wrong (like wrong UPI PIN), the system should not crash — it should handle it and allow retry. That’s where proper exception handling becomes critical. Moving forward to learn how to handle multiple exceptions effectively and write more robust programs 🚀 #Internship #Java #ExceptionHandling #Programming #CodingJourney #LearningJourney #TapAcademy TAP Academy

🚀 Internship Learning Series – Day 2 Today was all about logic, conditions, and writing smarter code. 💡 Key learnings: 🔹 printf for precise output formatting 🔹 Modulus (%) to extract last digits 🔹 if-else for decision making 🔹 Logical operators (&&, ||) to combine conditions 🔹 Efficiency matters — not just correct code 👉 Biggest takeaway: Think before you code. Building strong fundamentals step by step 💻 #Java #Programming #Internship #Coding #LearningJourney #SoftwareDevelopment

🚀 Day 40 of My Full Stack Developer Internship @ Tap Academy 💻✨ I’m excited to share another milestone in my learning journey as a Full Stack Developer Intern! Each day is helping me build stronger fundamentals and practical understanding. 📘 Today’s Topic: TreeSet in Java (Java Collections Framework) In today’s session, I explored the powerful TreeSet class and its role in handling sorted data efficiently. Here’s a quick summary of what I learned: 🔹 Key Concepts I Learned: ✔️ TreeSet stores elements in sorted (ascending) order by default ✔️ It is based on a Binary Search Tree (BST) ✔️ No duplicate elements are allowed ✔️ Does not allow null values ✔️ Provides efficient operations with O(log n) time complexity ✔️ Useful for maintaining unique and sorted data 🔹 Important Methods: ➡️ add() – Adds elements ➡️ first() / last() – Retrieves first & last elements ➡️ headSet() / tailSet() / subSet() – Range operations ➡️ ceiling() / floor() / higher() / lower() – Navigation methods ➡️ pollFirst() / pollLast() – Removes elements 🔹 When to Use TreeSet? ✔️ When data needs to be automatically sorted ✔️ When duplicates are not allowed ✔️ When performing range-based operations ✔️ When fast searching and ordering is required 🔹 Hierarchy Insight: Collection → Set → SortedSet → NavigableSet → TreeSet 💡 This session helped me understand how TreeSet is different from other collections and when to use it effectively in real-world applications. I’m looking forward to applying these concepts in projects and continuing to grow step by step! 🚀 #FullStackDeveloper #Java #TreeSet #JavaCollections #LearningJourney #CodingLife #DeveloperJourney #TapAcademy #100DaysOfCode #SoftwareDevelopment #Programming #InternshipExperience

🚀 Day 52 of My Internship Journey at Tap Academy Today’s learning was all about diving deeper into the Java Collections Framework, specifically comparing LinkedList and ArrayDeque—two powerful data structures often used for stacks and queues. 🔍 Key Takeaways: 👉 LinkedList - Built on a doubly linked list structure - Each element (node) stores data + two address references (prev & next) - Offers flexibility in insertion and deletion - ⚠️ However, it comes with higher memory overhead due to extra pointer storage 👉 ArrayDeque - Implemented using a resizable array - More memory-efficient since it avoids node-based overhead - Faster for stack and queue operations in most scenarios - Default initial capacity = 16 - ❌ Does not allow null values - ❌ No index-based access or ListIterator support 💡 Conclusion: While LinkedList is versatile, ArrayDeque is often the better choice for stack and queue implementations due to its superior performance and lower memory consumption. 🌱 Bonus Learning: Got introduced to TreeSet, which automatically sorts elements—great for maintaining ordered data efficiently. 🔥 My Insight: Understanding internal data structures isn’t just theoretical—it directly impacts how efficiently our applications run. Choosing the right structure can make a huge difference in performance and scalability. 📌 Consistency is key—one concept at a time, getting stronger every day! #Java #DataStructures #JavaCollections #LearningJourney #Internship #Programming #DeveloperGrowth #ArrayDeque #LinkedList #TreeSet TAP Academy Sharath R Harshit T Somanna M G