Course Duration: 10 Meetings/20 Hours;
Meeting 1:
Simple Algorithms, Bisection search; Conversion algorithms, Dealing with floats
Meeting 2
Fractions, fraction conversion Newton Raphson
Meeting 3:
Scope in functions, scope details, key and default arguments, Built-in functions Stings recall-all methods, Recursion, Factorial
Meeting 4:
Scope in recursion, Iteration vs recursion, Mathematical induction, Tower of Hanoi, Palindromes
Meeting 5:
Fibonacci, GCD, Modules, Usage of Tuples, algorithms
Meeting 6:
Lists methods recalls, functions as objects, List of functions, Map, Algorithms with lists
Meeting 7:
Dictionaries operations recall, Leveraging dictionaries properties, Algorithms with dictionaries
Effective recursion using dictionaries
Meeting 8:
Testing and debugging, Classes of tests, testing approaches, Black box testing, Glass box testing, Bugs, Categories of bugs, Debugging in Practice, Tests
Meeting 9:
Exceptions recall, assertions, Programs with exceptions, Exception control as flow Classes recall
Built in methods, Hierarchies, Inheritance, Algorithms with classes
Meeting 10:
Class override, Class overload, Class generators, Algorithmic complexity, Complexity classes, recursion complexity, Searching and sorting algorithms
Examination