Graduate Transfer Credit and Graphs: Difference between pages

From Computer Science at Indiana State University
(Difference between pages)
Jump to navigation Jump to search
VisualWikitext
m 1 revision imported
 
wiki_previous>Jkinne
 
Line 1: Line 1:
CS graduate students who have graduate credit elsewhere may ask for transfer credit.  The criterion used to evaluate graduate transfer credit is similar to that used to evaluate [[Undergraduate Transfer Credit]].
=Assignment=
 
Problems from [https://courses.csail.mit.edu/6.042/spring18/mcs.pdf Mathematics for Computer Science] (MCS). These are tentative, I will probably remove a few after working them out myself.
Note that at most 9 credits of transfer credit can be applied to the MS degree, only grades of B or higher can transfer, and the transfer course must be a graduate course while the student was a graduate student.
# MCS Problem 12.2, but instead of 20, use (first two letters of your last name, add them up, % 10, *2, +10).  Kinne: Ki, 10+8, 18, %10 = 8, *2 = 16, +10 = 26. Note: simple graph is unweighted, undirected, no self loops.
# MCS Problem 12.12 (ungraded).  Bipartite: 2 parts.
# MCS Problem 12.23 and note that Chi(G) is the chromatic number of G - the smallest number of colors that can be used to color the vertices of the graph.
# MCS Problem 12.25.  Connected component - can get from any vertex in the component to any other in the component, and cannot go outside the component.
# MCS Problem 12.33.  Assume we are talking about graphs that are undirected and without self loops.
# MCS Problem 12.46.  Base case: 1 vertex graph, 2 vertex graph, 3 vertex graph.
# MCS Problem 12.50.  Diameter - largest distance between any two vertices.  Note - "degrees of separation", "Erdos number". Note that a tree is a connected graph without any cycles.

Revision as of 02:48, 18 November 2022

Assignment

Problems from Mathematics for Computer Science (MCS). These are tentative, I will probably remove a few after working them out myself.

  1. MCS Problem 12.2, but instead of 20, use (first two letters of your last name, add them up, % 10, *2, +10). Kinne: Ki, 10+8, 18, %10 = 8, *2 = 16, +10 = 26. Note: simple graph is unweighted, undirected, no self loops.
  2. MCS Problem 12.12 (ungraded). Bipartite: 2 parts.
  3. MCS Problem 12.23 and note that Chi(G) is the chromatic number of G - the smallest number of colors that can be used to color the vertices of the graph.
  4. MCS Problem 12.25. Connected component - can get from any vertex in the component to any other in the component, and cannot go outside the component.
  5. MCS Problem 12.33. Assume we are talking about graphs that are undirected and without self loops.
  6. MCS Problem 12.46. Base case: 1 vertex graph, 2 vertex graph, 3 vertex graph.
  7. MCS Problem 12.50. Diameter - largest distance between any two vertices. Note - "degrees of separation", "Erdos number". Note that a tree is a connected graph without any cycles.
Retrieved from "https://cs.indstate.edu/web/index.php?title=Graduate_Transfer_Credit&oldid=248"