|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
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.
-
3.00 Credits
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.
-
4.00 Credits
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.)
-
4.00 Credits
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.
-
3.00 Credits
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.)
-
3.00 Credits
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.
-
3.00 Credits
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.
-
3.00 Credits
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.
-
3.00 Credits
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.
-
3.00 Credits
No course description available.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|