Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Problem Solving Strategies: General Overview

Description

This lecture introduces methods for problem-solving, focusing on 'Divide and Conquer', recursion, and dynamic programming. It explains how to design algorithms to solve given problems, emphasizing the importance of analyzing similarities with known problems and different problem-solving approaches.

Official source

Related concepts (32)

Recursion (computer science)

In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own code. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science. The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement.

Recursion

Recursion occurs when the definition of a concept or process depends on a simpler version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references can occur.

Problem solving

Problem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from simple personal tasks (e.g. how to turn on an appliance) to complex issues in business and technical fields. The former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles.

Course-of-values recursion

In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n) is computed from the sequence . The fact that such definitions can be converted into definitions using a simpler form of recursion is often used to prove that functions defined by course-of-values recursion are primitive recursive.

Dynamic loading

Dynamic loading is a mechanism by which a computer program can, at run time, load a library (or other ) into memory, retrieve the addresses of functions and variables contained in the library, execute those functions or access those variables, and unload the library from memory. It is one of the 3 mechanisms by which a computer program can use some other software; the other two are static linking and dynamic linking.

Related lectures (24)

Algorithm Design: Divide and Conquer

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Problem-solving Strategies 2: Recursion

Explores problem-solving strategies like recursion and divide and conquer methods, with examples such as the Towers of Hanoi.

Introduction to Algorithms: Course Overview and Basics

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Dynamic Programming: Binomial Coefficients

Explores dynamic programming through binomial coefficients calculation, emphasizing efficiency and memoization in problem-solving.

Recursive Algorithms: Divide and Conquer