1 / 6

CSCE 106 Solution Hint for Prime Number Function and Graphics Generation

This solution hint provides code for a prime number Boolean function and generating graphics based on 'n'. For Dr. Khalil's Revision Sheets Problem 2. Best of luck with CSCE 106!

marsden-lopez
Télécharger la présentation

CSCE 106 Solution Hint for Prime Number Function and Graphics Generation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Revision I

  2. Outline • Solution hint for Problem 2 – Group 10 of Assignment Sheets. • Solution hint for Problem 2 of Dr Khalil’s Revision Sheets CSCE 106

  3. Solution Hint for Problem 2 – Group 10 of Assignment Sheets A boolean function the determines whether a number x is prime. bool prime(int x) { bool flag = true; int i = 2; while (i < x && flag) if (x % i == 0) flag = false; else i++; return flag; } CSCE 106

  4. Solution Hint for Problem 2 of Dr Khalil’s Revision Sheets Generating the following graphics that depends on n. Graphics for Graphics for Graphics for Graphics for  n = 1 n = 2 n = 3 n = 4 1   1 1 1 22 22 22 22   22 22 333 333 333 333 333  333 4444 4444 4444 4444 CSCE 106

  5. Solution Hint for Problem 2 of Dr Khalil’s Revision Sheets (cont’d) for (int i = 1; i <= n; i++) for (int j = 1; j <= i; j++) { for (int z = 1; z <= i; z++) cout<<i; cout<<endl; } CSCE 106

  6. Wish you all the best CSCE 106

More Related