PW N°3 Data structure “Lists -dictionaries”
Videos and Exercises
Final task: Code exercises 6 to 10. M5
1) PW N°2 Data structure “stack” text, code,
Quiz, video and problems balanced symbols [],(),{}, and Converting Decimal Numbers to Binary
Numbers
Final task: code
this converter
M3
2) PW N°2 Data structure “Queue” text, code, Quiz, video and problems
Hot Potato.
PW N°1 : OOP functions : text, code, video and
problems :
1) Fractions ( test codes) then
2) logic gates : M2
3) Final task: logic gate : Solve the following logic gate problem : Create a two new gate classes, one called NorGate the other called NandGate. NandGates work like AndGates that have a Not attached to the output. NorGates work lake OrGates that have a Not attached to the output.
Create a series of gates that prove the following equality NOT (( A and B) or (C and D)) is that same as NOT( A and B ) and NOT (C and D). Make sure to use some of your new gates in the simulation.
PW N°0 functions text, code, video and problem : Infinite monkey theorem https://runestone.academy/runestone/books/published/pythonds/Introduction/DefiningFunctions.html
Final task: code the problem Infinite monkey theorem
The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type any given text, such as the complete works of William Shakespeare. In fact, the monkey would almost surely type every possible finite text an infinite number of times.
1)Introduce yourself.
2) Information about the trip to Italy/Spain/NYC.
