COMP20007 - Design of Algorithms and Programming Problem - Computer Science Assignment Help

Assignment Task

This assignment consists of 3 problems: 1 programming problem and 2 written problems. You will submit your solutions for the C programming component via dimefox submit and the written component via the LMS. This assignment has a total of 20 marks and will contribute 20% to your final grade for this subject

Task 1

Develop the pseudocode for an efficient algorithm that computes the number of connected components in a graph G = (V, E) given vertices V and edges E. Discuss the complexity of your algorithm in detail.

Task 2

Write a C program that takes the name of one file as a command line argument containing the specification for the network, reads in a text file from standard input and prints out the total number of connected subnetworks before the outage for this network. Suppose that the network has n servers and each server has a unique server ID (SID) which is an integer between 0 and n − 1 inclusively. The file specified as the command line argument for this and the subsequent programming tasks has two parts:

• The first line gives the number of servers, n, and the number of network connections in the graph, m, separated by a space.

• The following lines specify the m connections between servers, one per line, given as the two SIDs separated by a space. Note that each edge is listed only once. The text file received on standard input is also given in two parts:

• The first line specifies the number of servers which are affected by the outage.

• The following line contains a list of all the SIDs affected by the outage, each separated by a space

This (COMP20007) Computer Science Assignment has been solved by our Computer Science experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.