Write Algorithms with NS (Nassi Schneiderman) Diagrams part 2 - Branching blocks
In this set of tutorials you will learn about NSDs (Nassi-Schneiderman Diagrams) and how they are used to write algorithms. In the first lesson you learned about process blocks. Now you will learn about branching blocks so that your program can make decisions / evaluate conditions.
Mathematics & Digital Technologies Education
Videos, quizzes, and other learning resources
Eddie the Magic Monk has 16 years teaching experience as a high school teacher in Australia. He will explain things to you in the simplest way possible to help you fully understand high school mathematics and computer science concepts.
Eddie began his tutorial channel on Youtube in 2012. His videos have been well received all over the world and now has 22+ million views! He sees the benefit in multidisciplinary learning hence his tutorials cover topics ranging from maths to dance.
Leave Write Algorithms with NS (Nassi Schneiderman) Diagrams part 2 - Branching blocks to:
Best Posts From Magic Monk
We have not curated any of magicmonk's posts yet. But you can encourage our curation team to review posts by visiting them regularly and by referring other readers. Because we give priority to frequently read content.