Notes

Core Java Core Java String Concepts HashCode & Equal Methods Immutability OOPS Concepts Abstraction Encapsulation Polymorphism Inheritance String Concepts A String is a sequence of characters. How to create a String object? String literal String s1="Welcome"; String s2="Welcome";//It doesn't create a new instance New keyword String s=new String("Welcome"); //creates object and reference variable Examples:- String s1 = "Hello"; char ch[] = {'H', 'e', 'l', 'l', 'o'}; String s2 = new String(ch); String s3 = "Hello"; String s4 = new String("Hello"); String s5 = new String("Hello"); System.out.println(s1 == s2); // false System.out.println(s1 == s3); // true System.out.println(s4 == s5); // false HashCode & Equal Methods Default implementations of equals() and hashcode() methods: ...

Kafka - Distributed Stream Processing System Kafka is an open-source distributed streaming platform. In simpler terms, it’s a system that excels at handling large amounts of data that is constantly being generated. This data, often called streaming data, comes from various sources and needs to be processed quickly and efficiently. Push Poll Model Kafka Components Kafka Broker Default port 9092 Producer: Producer produces content Consumer: Consumer consumes the content The producer/Consumer creates a TCP connection to the broker, which is bi-directional. That means both producer and broker can send and receive data from each other. ...

AWS Certified Developer - Associate showcases knowledge and understanding of core AWS services, uses, and basic AWS architecture best practices, and proficiency in developing, deploying, and debugging cloud-based applications by using AWS. Preparing for and attaining this certification gives certified individuals more confidence and credibility. Organizations with AWS Certified developers have the assurance of having the right talent to give them a competitive advantage and ensure stakeholder and customer satisfaction. ...

Undirected Graphs Some problems Path Shortest path Cycle Ehler tour: A cycle that uses each edge excatly once. Hamilton tour: A cycle that uses each vertex exactly once classical NP-complete problem. Connectivity MST: Biconnectivity: A vertex whose removal disconnects the graph Planarity Graph isomorphism: Are two graphs identical? No one knows so far. A lonstanding open problem Representations Real-world graphs tend to be sparse (huge number of vertices, small average vertex degree). ...