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