Posts

Showing posts from December 19, 2021

New Post

Algorithms Behind Space Missions ~xRay Pixy

-
Image
Learn different algorithms used in Space Missions. Video Link Video Chapters: Algorithms Behind Space Missions 00:00 Introduction 00:52 Space Missions 04:26 Space Missions Challenges 07:04 Algorithms Used in Space Missions 10:36 Optimization Techniques 11:44 Conclusion  NASA conducts space missions to explore the universe for various scientific, technological, and practical reasons: Understanding Our Place in the Universe Search for Life Beyond Earth Studying Earth from Space Advancing Technology Supporting Human Exploration Resource Utilization Inspiring Humanity Examples of NASA Space Missions Apollo Program: Sent humans to the Moon (1969–1972). Mars Rovers (Spirit, Opportunity, Perseverance): Explored Mars' surface and geology. Voyager Missions: Studied the outer planets and interstellar space. Hubble Space Telescope: Captured breathtaking images of the universe. International Space Station (ISS): Supports research in microgravity and international collaboration. Different ...
Post a Comment
Read more

ALGORITHM DESIGN TECHNIQUES

-
Image
WHAT IS ALGORITHM DESIGN? Algorithm Design is a specific method to create mathematical process in solving various classical problems, real world complex problems. Techniques for designing and implementing algorithm design are design patterns. ALGORITHM DESIGN TECHNIQUES We have 5 base techniques that can be used to design any algorithm.  Divide and Conquer Greedy Method Dynamic Programming Back Tracking Branch and Bound WHAT IS DIVIDE AND CONQUER TECHNIQUE?  In branch and bound technique, we break the main problem into several sub-problems. Sub-problems are similar to original problem but smaller in size. To solve given problem algorithm call themselves to deal with subproblems. Once subproblems are solved recursively then combine these solutions to create a final solution for the original problem. Merge Sort Algorithm follow Divide and Conquer method. Step 01: Divide the main problem into subproblems [n/2]. Step 02: Solve the subproblems recursively.  Step 03: Combine th...
Post a Comment
Read more
More posts