Google

PART 1: ALGORITHMIC PROBLEM - MINIMUM COST PATH BASE PROBLEM You are given a graph representing cities connected by roads. Each road has an associated travel cost (a positive integer). You are given a 'source' city and a 'destination' city. Task: Find the path from the source to the destination that results in the minimum total travel cost. FOLLOW-UP 1 What if the edge weights (travel costs) can be negative? Task: Explain how the presence of negative edge weights affects standard algorithms. How would you modify your approach or what alternative algorithm would you use to find the shortest path, and how do you handle negative weight cycles? PART 2: AI DISCUSSION & TERMINOLOGY Practical Application: How do you currently use AI tools in your daily workflow, studies, or personal life? General Knowledge: What is your basic understanding of Artificial Intelligence and how it works under the hood? Basic Terminologies (Briefly explain the following concepts): Hallucination: In an AI context, this refers to a model confidently generating false, fabricated, or nonsensical information. Training an AI model: The foundational process of feeding large datasets into an algorithm so it can learn patterns, adjust its parameters, and make future predictions. GPT: Stands for Generative Pre-trained Transformer, the underlying neural network architecture for models like ChatGPT.