1 / 2

Prime Path Generator: Compute and Analyze All Prime Paths in a Graph

This project involves developing a program in C to compute all prime paths in a directed graph. You will define all nodes as integers, with input detailing edges between them. The program should avoid dynamic memory allocation and minimize pointer operations, adhering to a modular design for analysis. You will create control flow graphs, generate test paths to cover the prime paths, and execute test cases while reporting statement and branch coverage using gcov. Both hard and soft copies of the project must be submitted.

sai
Télécharger la présentation

Prime Path Generator: Compute and Analyze All Prime Paths in a Graph

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. HW2: A prime path generator (Due Oct 6th 23:59) • Input format • All nodes are named as 1, 2… • Each line contains one edge • First line contains a set of initial nodes • Second line contains a set of final nodes • Ex: 1 2 5 1 3 2 5 3 5 3 6 6 1 • Write a program that will compute all prime paths in a graph, then derive test paths to tour the prime paths in C (say prime_path.c) • You will apply various analysis tools to prime_path.c.So, complex statements are not recommended • No dynamic memory allocation • No pointer arithmetic and minimal pointer operations • You have to write down the program in a modular fashion, so that you can analyze prime_path.cunit by unit 1 2 2 5 1 3 6 1 3 6 1 3 6 1 3 5 6 1 3 6 3 6 5

  2. Draw control flow graphs of your modules in prime_path.c • Generate all prime paths of the modules in prime_path.c • Create test paths to tour all the prime paths of the modules • Create test cases to execute the test paths at Step 4 - sidetrip/detour might be ok, if you cannot find test cases to tour all the prime paths • Also, report the statement and branch coverage by using gcov Note. Submit both hardcopy and softcopy to the TA ( vita500@gmail.com )

More Related