[PORTALNAME]
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.
CSC 102: Numerical Methods
3.00 Credits
Hofstra University
Semester Hours: 3 Fall, Spring Iterative computational methods for solving numerical equations and systems using computer programs and spreadsheets. Roots of algebraic equation systems. Matrices; solutions of linear algebraic equations by matrix methods, iteration, and relaxation. Taylor's series, finite differences, numerical integration, interpolation, and extrapolation. Solution of initial and boundary value ordinary differential equations. Prerequisite(s)/Course Notes: MATH 72, CSC 15 or ENGG 10. Same as ENGG 101 and MATH 147.
Share
CSC 102 - Numerical Methods
Favorite
CSC 14: Discrete Structures for Computer Science I
3.00 Credits
Hofstra University
Semester Hours: 3 Fall, Spring Review of propositional and predicate logic. Methods of theorem proving; strong and weak induction. Finite and infinite sets, set operations. Introductions to computational complexity, theta and big-O notation Combinatorics, including permutations and combinations. Discrete probability and binomial distribution. (3 hours lecture, 1 hour laboratory.) Prerequisite(s)/Course Notes: Three years of high school mathematics.
Share
CSC 14 - Discrete Structures for Computer Science I
Favorite
CSC 15: Fundamentals of Computer Science I:Problem Solving and Program Design
4.00 Credits
Hofstra University
Semester Hours: 4 Fall, Spring Introduction to computer science with emphasis on problem solving, programming and algorithm design. Uses a high-level programming language for solving problems and emphasizing program design and development. Topics include basic programming constructs, expressions, functions, data types, arrays and strings. (3 hours lecture, 2 hours laboratory.)
Share
CSC 15 - Fundamentals of Computer Science I:Problem Solving and Program Design
Favorite
CSC 16: Fundamentals of Computer Science II:Data Structures,Algorithms and Object-Oriented Programming
4.00 Credits
Hofstra University
Semester Hours: 4 Fall, Spring Continuation of CSC 15. Introduction to classes and objects. Investigates the essential properties of data structures, abstract data types, algorithms for operating them, use of these structures as tools to assist algorithm design. Introduces searching and sorting techniques. (3 hours lecture, 2 hours laboratory.) Prerequisite(s)/Course Notes: CSC 14, 15.
Share
CSC 16 - Fundamentals of Computer Science II:Data Structures,Algorithms and Object-Oriented Programming
Favorite
CSC 17: Fundamentals of Computer Science III:Advanced Data Structures and Object-Oriented Programming
3.00 Credits
Hofstra University
Semester Hours: 3 Fall, Spring Continuation of CSC 16. This course advances beyond the principles learned in CSC 16 to practical programming skills; design and analysis of data structures involving techniques including: inheritance, polymorphism, parametric polymorphism through templates, systematic approaches to coding and testing; code reuse; standard template libraries; I/O issues. (3 hours lecture, 1 hour laboratory.) Prerequisite(s)/Course Notes: CSC 14, 16. (Formerly UNIX and C++; CSC 155, Fundamentals of Computer Science III.)
Share
CSC 17 - Fundamentals of Computer Science III:Advanced Data Structures and Object-Oriented Programming
Favorite
CSC 204: Algorithm Design and Analysis
3.00 Credits
Hofstra University
Review of algorithm basics (Big-Oh, Big-Theta and Big-Omega notation), algorithms for searching, sorting (Mergesort, Quicksort, Heap Sort), median order statistic, hashing, priority queues, red-black trees, AVL trees, dynamic programming, amortized analysis, graph algorithms for shortest path problems, minimum spanning tree, min-cut and max-flow problems and NP completeness.
Share
CSC 204 - Algorithm Design and Analysis
Favorite
CSC 207: Advanced Data Structures
3.00 Credits
Hofstra University
Managing multiple stacks and queues. Stack series. Permutations obtainable from stacks and queues. Concatenatable queues. Locating repeated substrings: an application of stacks. Stack and queue operation sequences. Set representation methods. The union-find algorithm. Trees: Robson traversal, Lindstrom scanning, Siklossy traversal. Generalized lists. Mergeable heaps. Files as a data structure. Storage compaction. Garbage collection.
Share
CSC 207 - Advanced Data Structures
Favorite
CSC 252: Programming Language Concepts
3.00 Credits
Hofstra University
The theory, evolution and practice of high-level programming languages. The comparative analysis of modern language such as ML, PERL, C++ and Java. The impact of advanced programming methods such as higher-order functional programming, object-oriented design patterns and aspect-oriented programming.
Share
CSC 252 - Programming Language Concepts
Favorite
CSC 254: Database Design
3.00 Credits
Hofstra University
Study of database design and modeling; the relational model; relational algebra and calculus; normal forms; SQL query language; database application development; transaction processing; storage and indexing principles.
Share
CSC 254 - Database Design
Favorite
CSC 256: Advanced Operating Systems Design
3.00 Credits
Hofstra University
No course description available.
Share
CSC 256 - Advanced Operating Systems Design
Favorite
First
Previous
11
12
13
14
15
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