Algorithms & Problem solving (Programming Techniques)
Course Overview
This course aims to provide the learners with an ability to get comfortable with programming techniques like methods of problem solving techniques. This course will help in gaining proficiency in writing functions, recursions, backtracking, dynamic programming & greedy approach etc. Basic programming, problem solving is a prerequisite for this course.
Faculty Details
Course Instructors
Learning Objectives
Associates undergoing this course will:
Learn from functions till backtracking
- Understand in detail about Dynamic programming and Greedy approach
- Learn in depth about the Function, Recursion, Backtracking
Course Coverage
1. Functions
(Duration: 120 minutes)
- Introduction to Functions
- Arguments to functions
- Return values
- Iteration vs recursion
- Coding exercises
2. Recursions
(Duration: 120 minutes)
- Introduction to Recursions
- Base cases & Recursive cases
- Stack calls
- Types of recursions
- Coding exercises
3. Backtracking
(Duration: 120 minutes)
- Introduction to Backtracking
- Backtracking vs Recursions
- Maze solving
- Sudoku solving
- Coding exercises
4. Dynamic programming
(Duration: 120 minutes)
- Introduction to Dynamic programming
- Memoization
- Bottom-up approach
- Problem solving
- Coding exercises
5. Greedy approach
(Duration: 120 minutes)
- Introduction to Greedy approach
- Local optimality principle
- Applications of greedy approach
- Analyzing the effectiveness
- Coding exercises
About the Faculty
