1. TRANSLATION OF FLOW GRAPHS TO NASSI-SHNEIDERMAN DIAGRAMS
COS 151 TUTORIALS 2
TRANSLATION OF FLOW GRAPHS TO NASSI-SHNEIDERMAN DIAGRAMS
TOPE KEKERE

2. Learning Outcomes At the end of this tutorial,
students should be able to translate flow charts to Nassi-Shneiderman diagrams and vice-versa.

3. Ground Rules
Tutorials will either be submitted at the end of a tutorial class, or at the reception desk of the Computer Science Department by a specified deadline. Once again, ensure that you follow submission instructions exactly, or the submission will not be assessed.
Each tutorial will count equally towards a 15% contribution to the semester mark. You must have a result for at least 70% of the tutorials (i.e. 9 of the 13 tutorials) to gain examination entrance. Once again, this means that you must have a mark for the tutorials in question. Submitting a tutorial late does not count towards the number of completed tutorials. Tutorial result queries are handled in the same way as practical lab experience queries.
Again, it is compulsory for students to attend all tutorial classes, unless illness prevents this. There will also be no aegrotat tutorials (sick tutorials). At risk students may be required to complete additional exercises to improve their tutorial results.

4. What is a Flow Chart?
A flowchart is a visual representation of the sequence of steps and decisions needed to perform a process. Each step in the sequence is noted within a diagram shape. Steps are linked by connecting lines and directional arrows.

5. Flow chart Symbols

7. Example of a Flow Chart using Euclidean Algorithm

9. What is a Nassi-Shneiderman Diagram?
A Nassi-Shneiderman developed by (Ike Nassi and Ben Shneiderman) diagram a visual representation of structured programs. It is also known as a structured flowchart. The main purpose of a Nassi-Shneiderman diagram is to create a logical structure (a blueprint) for the program.

11. Example of a Nassi-Shneiderman using Euclidean Algorithm

13. The Sieve of Eratosthenes

14. A prime number is a whole number that has only two factors, itself and 1. The Sieve of Eratosthenes is an ancient algorithm of finding all prime numbers up to a given limit.

15. Flow Chart and Nassi-Shneiderman diagram of The Sieve of Erathostenes

19. Summary
Flow Chart and Nassi-Shneiderman diagrams are visual representation of algorithms.

20. References
Cleland, C. E. (2001). Recipes, algorithms, and programs. Minds and machines, 11(2),
Farrell, J., 2014. Programming logic and design, comprehensive. Cengage Learning.
Forouzan, B. A., & Mosharraf, F. (2008). Foundations of computer science. Cengage Learning EMEA.
Schneider, G. M., & Gersting, J. (2018). Invitation to computer science. Cengage Learning.
Ali, M. (2018). Google Search.