C++ Data Structure Homework 3.2 Major Prerequisite Tree 1. What is the longest d
ID: 3824705 • Letter: C
Question
C++ Data Structure Homework
3.2 Major Prerequisite Tree
1. What is the longest directed path in this graph?
2. Which vertex has the highest in-degree?
3. What is the sum of the degrees of all vertices?
(Ignore dashed lines with arrows)
The following tree graph diagram illustrates the prerequisite and corequisite relationships between courses required for the major. Corequisite Start ick 12 units & at lesst Prerequisite rack Gateway CPSC 120 125 HYS PHYS 226L. CPSC MATH 270A. 150A CPSC GEOL. GEOL. 101 101 GEOL. GEOL. CPSC 201L. 223 240 Game Scl. Comp. EPP CPSC 30 CPSC) CPSC CPSC CPSC 35 Secunty CPSC Int. & Ent. CPSC 471 323 CPSC 335 BIOL CPSC CPSC 172 315 CPSC Softw. Eng. You are ordinarily limited to 16 units each term. In order to finish the B.S. program in 8 semesters, you will need to take five classes each semester. Almost all CPSC and GE courses TIP are 3 units each; almost all mathematics and science courses are 4 units each. Plan on taking four 3-unit courses (CPSC and/or GE), and one 4 unit course (mathematics or science) each semester, for a total of 16 units, until you have completed all required 4 unit courses.Explanation / Answer
Answer 1)
finding a simple path of maximum length in a given graph.
the longest directed path in this graph is:
Start-> CPSC120-> CPSC121-> CPSC131-> CPSC254-> CPSC351-> CPSC471
Answer 2)
Indegree of vertex V is the number of edges which are
coming into the vertex V.
vertex has the highest in-degree:
the maximum indegree in the given graph is 2 and there are few veritces
whose indegree is 2.
i.e.
CPSC311
CPSC240
CPSC335
CPSC481
CPSC362
Answer3) Sum of the degrees of all the veritces:
Sum of indegree: 27
Sum of outdegree: 33
Total: 60
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.