<p>Bamamomof3, I am not sure which year your daughter entered or what her major is. My memory is not that great. But when I looked back at the current catalog as well as the previous catalog, it does show that Math 301 is needed for CS 360. Below are the entries, but here is the link to the various catelogs for you too. [Academic</a> Catalogs - The University of Alabama](<a href=“Page Not Found | The University of Alabama”>Page Not Found | The University of Alabama)</p>
<p>The CS flowcharts also show MATH 301 requierd prior to CS360 back until 2010. <a href=“http://eris.cs.ua.edu/ug_advising.html[/url]”>http://eris.cs.ua.edu/ug_advising.html</a></p>
<p>It does not look like CS360 was a class at all prior to 2010. </p>
<p>the 2010-2012 catelog for CS360:
CS 360 Data Structures and Algorithms (4-0) 4 hours.
Prerequisite: CS 250 and CS 260 and MATH 301.
Prerequisite with concurrency: CS 350 or CS 351 or CS 352</p>
<p>Basic concepts of data, linear lists, strings, arrays, trees, graphs, and the related storage of representations and structures. Applications include expression conversion, sorting, searching, and dynamic storage allocation.</p>
<p>For MATH 301:
MATH 301 Discrete Mathematics. 3 hours. (I think this is actually 4cr)
Prerequisite: MATH 125 or MATH 145.
An introductory course that primarily covers logic, recursion, induction, modeling, algorithmic thinking, counting techniques, combinatorics, and graph theory</p>
<p>The college catelog for 2012: </p>
<p>CS 360. Data Structures & Algorithms. 4 sem. hrs.
Basic concepts of data, linear lists, strings, arrays, trees, graphs and the related storage of representations and structures. Applications include expression conversion, sorting, searching and dynamic storage allocation.
Prerequisite(s): MATH 301; and CS 250 or ECE 285; and CS 260; and CS 350 or CS 351 or CS 352.</p>
<p>MATH 301. Discrete Mathematics. 3 sem. hrs.
An introductory course that primarily covers logic, recursion, induction, modeling, algorithmic thinking, counting techniques, combinatorics, and graph theory.
Prerequisite(s): MATH 125 or MATH 131 or MATH 145.</p>
<p>MATH 302. Topics in Discrete Mathematics. 1 sem. hr.
A supplemental course in discrete mathematics covering select topics of interest in computer science. Topics include graphs and trees, finite state automata and regular expressions, efficiency of algorithms.
Prerequisite(s): MATH 301.</p>