Metropolitan State University

Course Equivalents

Course Equivalents for ICS 240 at Metropolitan State University in

While all courses listed as equivalents below are transferable, they are not necessarily equivalent in both directions. The courses below transfer TO the college or university shown above. To see how courses from your home college or university transfer to other participating colleges or universities, you can search Transferology.

If you are enrolling in the equivalent course in order to fulfill a program/major requirement, it is best to check with your academic advisor to ensure that the equivalent course will meet the requirements of your particular major.

Filter Courses

Open Courses Only    Wait List Courses Only    All Courses






All results have been filtered out. Modify filters and search again.
Century College
CSCI 2082 - Data Structures and Algorithms - 3 credits

This course builds on the foundation provided by the CSCI 1081, CSCI 1082 sequence to introduce the fundamental concepts of data structures and the algorithms that proceed from them. Topics include generic programming, recursion, the underlying philosophy of object-oriented programming, fundamental data structures (including stacks, queues, linked lists, and trees) and the basics of algorithmic analysis. Prerequisite: CSCI 1082 with a grade of C or higher.
We cannot determine if this course equivalent is in effect at this time.
Normandale Community College
CSCI 2002 - Algorithms and Data Structures - 4 credits

(ICS 240+ICS 141+ICS 140)
Reinforces the concepts presented in CSCI 2001, such as data abstractions, from an object-oriented programming perspective. Introduces data structures such as stacks, queues, and trees, and introduces sorting algorithms. Students will implement data structures and their operations as abstract data types using an object-oriented approach. The programming language Java is used to express the concepts of the course.
We cannot determine if this course equivalent is in effect at this time.
COMBINED WITH
CSCI 2001 - Computer Programming Concepts - 4 credits

(ICS 240+ICS 141+ICS 140)
Introduces students to the fundamental principles of programming. Procedures, recursion, and iteration will be presented as algorithmic development techniques. Abstract data types, modularity and the use of abstraction to hide program details will be emphasized throughout the course. The computer language Python is used as a formal way of expressing algorithms and data.
We cannot determine if this course equivalent is in effect at this time.
COMBINED WITH
CSCI 1111 - Programming in C - 4 credits

(ICS 240+ICS 141+ICS 140)
Problem solving using the C programming language. Topics will include the syntax of the language, operators and expressions, control structures, scoping rules, functions, parameter passing, arrays, strings, pointers, structures, type definitions, file handling and libraries.
We cannot determine if this course equivalent is in effect at this time.
--------------------- OR ---------------------
CSCI 2002 - Algorithms and Data Structures - 4 credits

Reinforces the concepts presented in CSCI 2001, such as data abstractions, from an object-oriented programming perspective. Introduces data structures such as stacks, queues, and trees, and introduces sorting algorithms. Students will implement data structures and their operations as abstract data types using an object-oriented approach. The programming language Java is used to express the concepts of the course.
We cannot determine if this course equivalent is in effect at this time.
North Hennepin Community College
CSCI 2002 - Structure of Computer Programming II - 4 credits
This course continues using abstract data types and the concepts presented in CSci 2001 and introduces stacks, queues, linked lists, and trees. This course also covers advanced programming topics of recursion, sorting methods, and complexity measures. The object-oriented language Java will be used. Prerequisite: CSci 2001
We cannot determine if this course equivalent is in effect at this time.
Rochester Community and Technical College
COMP 2247 - Algorithms and Data Structures - 4 credits
This course covers the principles of complexity of algorithms and problem solving techniques with data structures. Topics include analysis of algorithm, linked lists, stacks, queues, binary search trees, sorting searching, and recursive algorithms. In-depth study of object-oriented programming concepts is covered. Additional topics may include lists, iterators, heaps and priority queues, balanced binary search trees, hashing and graph algorithms. (Prerequisites: COMP 1150, COMP 2243, college level reading). (4 C).
We cannot determine if this course equivalent is in effect at this time.
Saint Paul College
CSCI 1524 - Introduction to Algorithms and Data Structures - 4 credits
This course is focused on the use of algorithms and data structures to solve problems. Students will solve various problems using appropriate software design methods and software tools. For example, students need to decide which problem solving strategies (such as divide and conquer) might be useful for a specific problem, construct a solution, design appropriate data types and algorithms, and verify the correctness of the solution. (Prerequisite(s): CSCI 1523 and CSCI 1541) 4C/4/0/0
We cannot determine if this course equivalent is in effect at this time.
Southwest Minnesota State University
COMP 166 - Data Structures - 3 credits
Continuation of COMP 165. Topics include: recursion, lists, dictionaries, sorting and searching, stacks, queues, binary trees, and graphs. Hands-on laboratory exercises will be integrated into the course. Students must enroll in both COMP 166 and COMP 166L.
We cannot determine if this course equivalent is in effect at this time.
St. Cloud State University
CSCI 301 - Computer Science 2 - 4 credits

Recursion and recurrence. Trees, binary trees, 2/3 trees, directed and undirected graphs, searching and sorting, program layering. Sequential file processing, indexed files, and hashing techniques. Prereq.: CSCI 201. Coreq.: MATH 273. 4 Cr. F,S.
We cannot determine if this course equivalent is in effect at this time.
Winona State University
CS 250 - Algorithms and Problem Solving II - 4 credits

A continuation of the problem solving and programming concepts introduced in CS 234 - Algorithms and Problem-Solving I. Applies the basic principles of software engineering to more complex problems. Topics include recursive problem solving, searching, sorting, and dynamic structures. Prerequisites: CS 234 - Algorithms and Problem-Solving I and MATH 120 - Precalculus or higher. (Students must receive a C or better in the qualifying prerequisite courses to remain enrolled in CS 250.) Offered every semester.
We cannot determine if this course equivalent is in effect at this time.