Euclid’s Algorithm
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
State unfied into a single parameter, dictionaries introduced.
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Fundamental notions of number theory and proof techniques.
Mainly proof questions based on basic number theory.
An introduction to higher-order functions in programming.
An introduction to lambda expressions in Python and their use in (functional) programming.
A set of programming exercises to practice higher-order functions.
funcutils
A utility module for functional abstractions.
A generic function to process sequences based on user-defined behavior.
Working with files in Python.
An introduction to lambda expressions in Python and their use in (functional) programming.
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
while
An introduction to iteration using while loops in Python, illustrated with the Collatz conjecture.
A set of programming exercises to practice iteration.
An introduction to lambda expressions in Python and their use in (functional) programming.
Tasks on Zipf’s and related laws.
Various text tokenization techniques in Python.
Linear algebra exercises.
State unfied into a single parameter, dictionaries introduced.
Exercises on sequence manipulation.
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Fundamental notions of number theory and proof techniques.
Mainly proof questions based on basic number theory.
Modules and techniques for scientific computing in Python.
Plotting in Python.
Probability and programming exercises.
Various counting exercises.
Tasks on Zipf’s and related laws.
An introduction to higher-order functions in programming.
State unfied into a single parameter, dictionaries introduced.
The notion of state and how to enhance its memory power by tuples.
An introduction to lambda expressions in Python and their use in (functional) programming.
A set of programming exercises to practice iteration.
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Fundamental notions of number theory and proof techniques.
Mainly proof questions based on basic number theory.
A set of programming exercises to practice higher-order functions.
A set of programming exercises to practice iteration.
Exercises on sequence manipulation.
Modules and techniques for scientific computing in Python.
Exercises on sequence manipulation.
Math and programming exercises based on basic set theory.
Sorting in Python.
String operations in Python.
Various text tokenization techniques in Python.
The notion of state and how to enhance its memory power by tuples.
Exercises on sequence manipulation.