The attached documents contain two separate sets of assignments that I need help with

 

Homework 9: Graph AlgorithmsDue: See T-SquareImportantThere are general homework guidelines you must always follow. If you fail to follow any of the followingguidelines you risk receiving a0for the entire assignment.1. All submitted code must compile underJDK 8. This includes unused code, so don’t submit extrafiles that don’t compile. Any compile errors will result in a 0.2. Do not include any package declarations in your classes.3. Do not change any existing class headers, constructors, or method signatures.4. Do not add additional public methods.5. Do not use anything that would trivialize the assignment. (e.g. don’t import/usejava.util.LinkedListfor a Linked List assignment. Ask if you are unsure.)6. Always be very conscious of efficiency. Even if your method is to beO(n), traversing the struc-ture multiple times is considered non-efficient unless that is absolutely required (and that case isextremely rare).7. You must submit your source code, the.javafiles, not the compiled.classfiles.8. After you submit your files redownload them and run them to make sure they are what you intendedto submit. You are responsible if you submit the wrong files.Graph AlgorithmsFor this assignment, you will be coding 5 different graph algorithms. WARNING: This homework hasquite a few files in it, so you should make sure to read ALL of the documentation given to you, includingthis pdf as well as all of the javadocs before asking a question.Graph RepresentationsFor this assignment, you will be using two different representations of graphs, the adjacency list andadjacency matrix. The adjacency list will be used for BFS, Dijkstra’s, Prim’s and Kruskal’s. Theadjacency matrix will be used for DFS.Generally, an adjacency matrix is better for when the graph is dense (many edges), and an adjacencylist is better for when the graph is sparse (fewer edges). Also, it’s worth noting from here on out, thetime complexities will have two inputs,|V|to mean the number of vertices, and|E|to mean the numberof edges. Although it is true that a simple graph can have at most|E| ≤|V|(|V|-1)2=O(|V|2) edges,other than this, there isn’t really any relationship between|V|and|E|.Keep in mind that the way that the graph is stored/represented will affect the time complexity of thealgorithm. For example, for Dijkstra’s algorithm, if an adjacency matrix is used, the time complexity isO(|V|2) while if an adjacency list with a priority queue is used, it is insteadO(|E|+|V|log|V|).Search AlgorithmsThe first two algorithms are breadth-first search (BFS) and depth-first search (DFS). These algorithmsare search algorithms that start at the given vertex and traverse the entire graph in a particular order(the order in which the vertices are visited depend on whether you are doing breadth-first search ordepth-first search, the edges that are in the graph, and the order the adjacent vertices are listed).1

EEE 304 Lab: Control (Extra Credit)1. Bill of MaterialsIn this laboratory experiment, you will build and test a simple feedback control experiment. Theidea is to maintain a constant light in a space as measured by a sensor. Think of this as awatered down version of illumination control, wherein the amount of light inside a room is keptconstant throughout the day. In our case, we will only use one light source and one sensor.In order to carry out this experiment you will be required to obtain the followingTable 1: List of parts to be purchasedItemModelQuantityArduinoDue1Micro USB cableAnyandroidphonecharger1Photo Transistor3034a2Bright White LED12900 mcd WHITE LED1Resistor100 K Ohm1Set of wiresMale to Male Jumperwires10BreadboardAny breadboard1You will require at least the quantities mentioned in the table to successfully carry out theexperiment. The hyperlinks attached to theitem namesare for example only and you canpurchase these items from anywhere you like.You will also need MS Visual Studio to work as a compiler, instructions on how to install is postedon Blackboard.If you haven’t completed the first extra credit lab assignment, you need to go through thefollowing sections in the first extra credit lab to make sure software is setup correctly:Section 2 “Introduction to Arduino DUE”Section 3 “Software Preparation”Section 4.2 Building the Simulink Test Model2. Lab Procedure2.1 Building the CircuitUsing the parts purchased, connect the circuit as shown in Figure 1. If you are unsure of thepin labels or for any details, you may look up datasheet for the parts online.