Subject: Discrete Math

Topics can be :

1. Algebraic Structures (Abstract Algebra, Binary structures) 2. Graph Theory 3. Graph Theory (Special graphs and Trees) 4. Graph Theory Problems and Applications

56. Which of the following islare TRUE? l. Kruskal's algorithm and Prim 's algorithm will always yield the same Minimum Spanning Tree. ll. Kruskai's algorithm starts with a vertex. A. | only is true B. H only is true 0. Both I and II are true D. Neitherl nor II are true 10 For items 57 to 60, identity which graph problem can be applied to solve the given problem. A. Minimum spanning tree problem B. Traveling salesman problem (3. Graph coloring problem D. Graph matching problem 57. Given an undirected simple graph G. we need to determine whether the graph is bipartite or not. 58. Ms. Evergreen is a Vetlvled who offers home care services for her pet patients. Being conscious of her gasoline consumption upon making visits to her pets. she wants to make sure that she would arrange her visits in the shortest path possible. 59. To avoid people from walking to different booths in an open area vaccination center, the health care staff needs to create pathways among booths. The city mayor advises them to nd a pathway connecting all booths with the waiting area so he can donate a shaded pathway to reduce the heat. The healthcare staff, therefore, needs to determine the best way to link the stations in order to minimize the cost of materials needed to build the pathways. 60. The city mayor's assistant was tasked to assign a doctor to each barangay to facilitate vaccination. The limitation of this task is that the doctor only agrees to a barangay if it is near hisiher residence. The assistant needs to make sure that there should be one doctor in each barangay to facilitate the vaccination