Courses may be offered in one of the following modalities:
If you are enrolled in courses delivered in traditional or hybrid modalities, you will be expected to attend face-to-face instruction as scheduled.
Semester: | Spring 2024 |
Number: | 0145-344-002 |
Instructor: | Sixia Chen |
Days: | Tuesday Thursday 4:30 pm - 5:45 pm |
Note: | Traditional In-Person Class |
Location: | Garden City - Blodgett Hall 209 |
Credits: | 3 |
Status: | This Course is Filled to Capacity |
Notes: |
Grade Of C- Or Better In Mth 131 Or Mth 141, Csc 156and Csc 171 |
Course Materials: | View Text Books |
Description: |
Learn to analyze iterative and recursive algorithms for use of resources (time, memory, parallelism, bandwidth, randomness, etc.). Develop fluency with big-O notation, and learn to choose and implement efficient algorithms for numeric, combinatorial, and geometric problems. Learn basic concepts and terminology in computability and computational complexity. |
Learning Goals: |
Students will be able to write programs in C++ using data structures. Students will be able to analyze the efficiency of sorting and searching algorithms and to determine whether there is a more efficient way of solving a problem or a class of problems. *The learning goals displayed here are those for one section of this course as offered in a recent semester, and are provided for the purpose of information only. The exact learning goals for each course section in a specific semester will be stated on the syllabus distributed at the start of the semester, and may differ in wording and emphasis from those shown here. |
Prerequisites: |
» View Other Sections of this Course