Organization of Programming Languages

User Generated

snant2

Programming

Description

all the details on the file

Unformatted Attachment Preview

The project should be submitted by the due in the following form: Page #1 COSC 352.001 – Organization of Programming Languages Fall / 2017 Project-1 Due: Wednesday, September 06, 2017, 01:00 PM Student: First Name Family Name Instructor: Vojislav Stojkovic Points: Page #2 Description/text of the problem Page #3 Algorithm Data structures Explanations - Discussion - Assumptions (if any) Page #4 Program-Code Page #5 Test examples Write in the Dr. Racket programming language functions: (a) Graph to define a graph. A graph is a listof (node listof nodes) (b) neighbors neighbors(node, graph) = list of nodes neighbors: node graph -> list of nodes to compute node’s neighbors in graph. (c) find-route find-route(node, node, graph) = list of nodes or false find-route: node node graph -> list of nodes or false to compute a list of nodes, starting with the origination node and ending with the destination node in a graph. If there is no path, the value of function is false. Test the program for the graph Example G has no neighbors: empty A has the list of neighbors (B E) Hint (define Graph etc. ) (define (neighbors a-node a-graph) etc. ) (define (find-route origination destination graph) etc. ) Test (define Graph '((A (B E)) (B (E F)) (C (D)) (D ()) (E (C F)) (F (D G)) (G ()))) (find-route 'A 'G Graph) -> (list 'A 'B 'E 'F 'G) (find-route 'C 'G Graph) -> #f
Purchase answer to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Hi,Your code is done.Can yo...


Anonymous
Goes above and beyond expectations!

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags