Scribd
Upload
13 views

6.1.9 Recursion - Recursive Algorithms Assignment

Uploaded by

davidinformant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

6.1.9 Recursion - Recursive Algorithms Assignment

Uploaded by

davidinformant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

ICS 4U1 – Unit 6 – Recursive: Recursive Algorithms Assignment

DetectColonies2 Application

Create a DetectColonies2 application that is based on DetectColonies presented in this unit. This application gives
improved colony results because slides are now digitized to report colour. For example, a slide file could look similar to:

00550000
00050000
00005500
01200000
01111000
00000030

The digits 1 through 9 represent various colours. The digit 0 represents black(background colour).
The DetectColonies2 application should display a listing of the size, location, and colour value of each colony on the
slide. A colony is defined as a connected (horizontally or vertically) sequence of cells holding the same colour value. For
the above slide, the application should report:

Colour Size Location


5 3 1, 3
5 2 3, 5
1 5 4, 2
2 1 4, 3
3 1 6, 7

Maze Application

A maze can be defined in a file using X characters to represent walls, space characters to represent paths, and a $ character to
represent the goal. For example, a file containing a maze should look similar to:

8
10
XXXXXXXXXX
X X
XX XXX XXX
XX X X
XXXX X X X
X X XXX
X XXXX $X
XXXXXXXXXX

The starting point is assumed to be location (1, 1) and the maze is assumed to have a border. Create a Maze application that displays
the sequence of positions in a path from the start to the goal, or indicate if no path is available. For example, for the maze above, the
application should report:

Path: (1,1) (1,2) (1,3) (1,4) (1,5) (1,6)


(2,6) (3,6) (4,6) (5,6) (6,6) (6,7) (6,8)
ICS 4U1 – Unit 5: Recursive Algorithms Assignment
Success Criteria: What I am looking for…
Program 1 – DetectColonies2 Application
Criteria Yes No/Needs Some Work Marks
Thinking, Inquiry, and Problem Solving
Your program is fully functional using correct
code conventions.
/10
Thinking, Inquiry, and Problem Solving
Recursive searching algorithm is correctly
implemented.
/10
Application
Program stores all detected colonies in
correct accumulator variables.
/5
Application
Program displays a summary of all colonies
found.
/5
Knowledge & Understanding
You properly formatted your program with
correct class and method declaration
conventions. /5
Knowledge & Understanding
You properly formatted your program with
correct indentation and spacing.
/5
Communication
You properly documented your program: File
heading, internal documentation, internal
mechanics of program explained. /10

Total: /50
Program 2 – Maze Application
Criteria Yes No/Needs Some Work Marks
Thinking, Inquiry, and Problem Solving
Your program is fully functional using correct
code conventions.
/10
Thinking, Inquiry, and Problem Solving
Recursive searching algorithm is correctly
implemented.
/10
Application
Path is found using correct recursive
algorithm.
/5
Application
Coordinates of path are displayed.

/5
Knowledge & Understanding
You properly formatted your program with
correct class and method declaration
conventions. /5
Knowledge & Understanding
You properly formatted your program with
correct indentation and spacing.
/5
Communication
You properly documented your program: File
heading, internal documentation, internal
mechanics of program explained. /10

Total: /50
Assignment Total: /100

You might also like