Scribd
Upload
4 views

? Important topics - Algorithmic Thinking with Python - Franklin's lectures

The document outlines a curriculum focused on problem-solving strategies, including definitions, characteristics, and applications of various methods such as trial and error, algorithms, and heuristics. It emphasizes the problem-solving process through six steps and includes modules on algorithms, flowcharts, Python programming fundamentals, and computational approaches. Practical exercises are encouraged throughout to reinforce learning and application of concepts.

Uploaded by

shihankv807
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

? Important topics - Algorithmic Thinking with Python - Franklin's lectures

The document outlines a curriculum focused on problem-solving strategies, including definitions, characteristics, and applications of various methods such as trial and error, algorithms, and heuristics. It emphasizes the problem-solving process through six steps and includes modules on algorithms, flowcharts, Python programming fundamentals, and computational approaches. Practical exercises are encouraged throughout to reinforce learning and application of concepts.

Uploaded by

shihankv807
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

IMPORTANT TOPICS

MODULE 1
PROBLEM-SOLVING STRATEGIES,
THEIR DEFINITION CHARACTERISTICS

HOW TO APPLY THEM (TRIAL AND ERROR,


ALGORITHMIC, HEURISTICS,
MEANS-ENDS ANALYSIS, AND BACKTRACKING)

THE PROBLEM-SOLVING PROCESS

(UNDERSTANDING THE PROBLEM, FORMULATING


A MODEL, DEVELOPING AN ALGORITHM,
WRITING THE PROGRAM, TESTING THE PROGRAM,
ANDEVALUATINGTHE SOLUTION)

LEARN THE ABOVE SIX STEPS, THEIR


DEFINITION AND HOW TO APPLY THEM TO A
PROBLEM (PRACTICE PROBLEMS)
MODULE 2
ALGORITHM, FLOWCHART AND PSEUDOCODE
(PRACTICE AS MUCH PROBLEMS AS POSSIBLE)
MODULE 3
FUNDAMENTAL CONSTRUCTS OF PYTHON
PROGRAMMING (SELECTION, ITERATION,
SEQUENCE DATA TYPES), LEARN BY PRACTICING
EXAMPLE PYTHON PROGRAMS.

RECURSION (PRACTICE RECURSIVE FUNCTION


PROGRAMS)

RECURSION (PRACTICE RECURSIDECOMPOSITION


AND MODULARISATIONVE FUNCTION PROGRAMS)
MODULE 4
COMPUTATIONAL APPROACHES TO PROBLEM
SOLVING, THEIR DEFINITION AND
CHARACTERISTICS
(BRUTE-FORCE APPROACH, DIVIDE-AND-CONQUER
APPROACH, DYNAMIC PROGRAMMING APPROACH,
GREEDY ALGORITHM APPROACH, RANDOMIZED
APPROACH)

PRACTICE EXAMPLE PROBLEMS OF GREEDY


ALGORITHM APPROACH AND RANDOMIZED
APPROACH

You might also like