CollegeTransfer.Net
Toggle menu
Home
Search
Search
Search Transfer Schools
Search for Course Equivalencies
Search for Exam Equivalencies
Search for Transfer Articulation Agreements
Search for Programs
Search for Courses
PA Bureau of CTE SOAR Programs
Transfer Student Center
Transfer Student Center
Adult Learners
Community College Students
High School Students
Traditional University Students
International Students
Military Learners and Veterans
About
About
Institutional information
Transfer FAQ
Register
Login
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
COMP 1320C: Data Structures
4.00 Credits
Yeshiva University
String processing; concatenation, substrings, matching; internal searching and sorting; recursion; linked lists and linear allocation (stacks, queues, deques). Elementary data structures; file structures and algorithms; searching and sorting; trees and algorithms for their manipulation; notions of algorithm complexity; memory and data management systems.
Share
COMP 1320C - Data Structures
Favorite
COMP 1504: Discrete Structures
3.00 Credits
Yeshiva University
Boolean algebra and predicate calculus; proof methods; sets, functions, and relations; combinatorics; graph theory and algorithms; mathematical induction and recursion; probability and average case analysis of algorithms. Prerequisite: three years of high school mathematics.
Share
COMP 1504 - Discrete Structures
Favorite
COMP 1504C: Discrete Structures
0.00 - 6.00 Credits
Yeshiva University
Boolean algebra and predicate calculus; proof methods; sets, functions, and relations; combinatorics; finite state machines and regular expressions; trees and tree transversals; context-free grammars; graph theory and algorithms; mathematical induction and recursion; probability and average case analysis of algorithms; gates and circuits.
Share
COMP 1504C - Discrete Structures
Favorite
COMP 1621: Theory of Computation
3.00 Credits
Yeshiva University
Deterministic and nondeterministic finite state automata; regular grammars and regular expressions; languages generated by regular expressions; equivalence of regular expressions and finite automata; solvable problems concerning finite automata; context-free grammars; languages generated by context-free grammars; derivation trees; simplification of context-free grammars; pushdown automata; properties of context-free languages; solvable and unsolvable problems concerning context-free languages; Turing machine model; Universal Turing machine; Halting problem; further examples of solvable and unsolvable problems about Turing machines, grammars, and sets. Prerequisite: COMP 1504C.
Share
COMP 1621 - Theory of Computation
Favorite
COMP 2113: Comp Org & Assemb Lang Prog
3.00 - 4.00 Credits
Yeshiva University
Basic logic functions. Synthesis of more complex combinational circuits. Electronic implementation of these functions. Simple synchronous circuits. Major components of a computer. Machine and assembly lan?guage instruction set. Implementation of the instruction set electronic circuits. Circuits needed to perform arithmetic oper?ations. Memory and I/O implementation.
Share
COMP 2113 - Comp Org & Assemb Lang Prog
Favorite
COMP 2113C: Computer Organ & Assembly Lang
3.00 - 4.00 Credits
Yeshiva University
Basic logic functions. Synthesis of more complex combinational circuits. Electronic implementation of these functions. Simple synchronous circuits. Major components of a computer. Machine and assembly language instruction set. Implementation of the instruction set electronic circuits. Circuits needed to perform arithmetic operations. Memory and I/O implementation.
Share
COMP 2113C - Computer Organ & Assembly Lang
Favorite
COMP 2512: Networking & Communications
3.00 Credits
Yeshiva University
Fundamentals of networking and communications: network concepts, hardware, software, and programming. Data communications; wide and local area networks; communications architecture and protocols. Network programming in C/C++ and Java. Advanced elective. Prerequisite: COMP 2545C.
Share
COMP 2512 - Networking & Communications
Favorite
COMP 2545: Algorithms
0.00 - 6.00 Credits
Yeshiva University
No course description available.
Share
COMP 2545 - Algorithms
Favorite
COMP 2545C: Algorithms
4.00 Credits
Yeshiva University
Advanced data structures and algorithms: tables, AVL and red-black trees, B and B+ trees, heaps, disjoint sets. Graph algorithms: minimum spanning trees, shortest path, and maximum flow algorithms. Selected algorithms in parallel computers, string matching, and computational geometry. Lecture: 3 hours; lab: 2 hours. Prerequisites: COMP 1320C, COMP 1504C, MATH 1412.
Share
COMP 2545C - Algorithms
Favorite
COMP 3511: Algorithmic Processes
3.00 Credits
Yeshiva University
Design of algorithms and applications of data structure permutations, polynomials, derivations, matrices, sorting, discrete simulation; list marking, garbage collection, analysis of algorithms; space and time efficiency; comparison of sorting techniques; discrete Fourier Transform; pattern matching; computational models, Turing machines, complex hierarchies. Advanced elective. Prerequisite: COMP 2545C.
Share
COMP 3511 - Algorithmic Processes
Favorite
First
Previous
141
142
143
144
145
Next
Last
Results Per Page:
10
20
30
40
50
Search Again
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
College:
(Type the name of a College, University, Exam, or Corporation)
Course Subject:
(For example: Accounting, Psychology)
Course Prefix and Number:
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
Course Title:
(For example: Introduction To Accounting)
Course Description:
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
Within
5 miles
10 miles
25 miles
50 miles
100 miles
200 miles
of
Zip Code
Please enter a valid 5 or 9-digit Zip Code.
(For example: Find all institutions within 5 miles of the selected Zip Code)
State/Region:
Alabama
Alaska
American Samoa
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
District of Columbia
Federated States of Micronesia
Florida
Georgia
Guam
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Marshall Islands
Maryland
Massachusetts
Michigan
Minnesota
Minor Outlying Islands
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Northern Mariana Islands
Ohio
Oklahoma
Oregon
Palau
Pennsylvania
Puerto Rico
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virgin Islands
Virginia
Washington
West Virginia
Wisconsin
Wyoming
American Samoa
Guam
Northern Marianas Islands
Puerto Rico
Virgin Islands