ST5008CEM Programming for Developers-CourseWork скачать в хорошем качестве

ST5008CEM Programming for Developers-CourseWork

This video is part of my Programming for Developers (STW5008CEM) coursework where I implement and explain several Data Structures and Algorithms problems using Java. The project demonstrates how different algorithms can be applied to solve real-world inspired problems, including graph analysis, optimization, and emergency logistics scenarios. Topics Covered in This Series Question 1 – Algorithm Problem Implementation and explanation of the algorithm solution, including the logic and step-by-step working of the program. Question 2 – Graph / Algorithm Analysis Analysis of the algorithm approach and explanation of the design decisions used in the solution. Question 3 – Algorithm Implementation Java implementation of the required algorithm with explanation of the logic and output. Question 4 – Problem Solving with Algorithms Using efficient algorithms and data structures to solve computational problems. Question 5 – GUI Based Optimization System Development of a Tourist Spot Optimizer GUI application that generates the best travel itinerary based on: Budget Available time Interest tags Location The program uses algorithmic logic such as filtering, greedy planning, and route optimization. Question 6(a) – Safest Path Algorithm In an earthquake emergency scenario, roads have safety probabilities. A modified Dijkstra Algorithm is used to determine the safest route for emergency supplies. Key ideas: Probability transformation using w'(e) = -log(p(e)) Converting probability multiplication into additive weights Computing the safest paths from Kathmandu (KTM) to other locations. Question 6(b) – Maximum Flow (Edmonds–Karp Algorithm) The road network is modeled as a flow network where each road has a capacity representing trucks per hour. Using the Edmonds–Karp algorithm, the program calculates: Maximum supply throughput from KTM (source) to Bhaktapur Shelter (BS). Augmenting paths Bottleneck capacities Residual graph updates Verification of the Max-Flow Min-Cut theorem Technologies Used Java Graph Algorithms Dijkstra Algorithm Edmonds–Karp Maximum Flow IntelliJ IDEA Purpose of This Project This coursework demonstrates how algorithmic techniques can be applied to real-world problems, including: Route safety optimization Resource flow optimization Graph modeling and analysis