Login
|
Register
|
Favorites (0)
Home
Search
Search
Search for Transfer Profiles
Search for Course Equivalencies
Search for Exam Equivalencies
Search for Transfer Articulation Agreements
Search for Programs
Search for Courses
Current
Search for Colleges
Search for Open Education Resources
PA Bureau of CTE SOAR Programs
Current
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
COM 1422H: Great Proofs in Mathematics
3.00 Credits
Yeshiva University
Landmark theorems from ancient to modern times. Geometry: Pythagorean theorem, Euler's formula, platonic polyhedra. Number theory: irrational numbers, infinitude of primes, unique factorization, Pythagorean triples. Set theory: sets, relations, functions, infinite cardinal numbers, Schroeder-Bernstein theorem. Probability: expectation, conditioning, independence, the law of averages. Theory of computation: Turing machines, decidable and undividable problems. (lecture-recitation 3 hours) .
Share
COM 1422H - Great Proofs in Mathematics
Favorite
COM 1430H: Computing & Probability
3.00 Credits
Yeshiva University
No course description available.
Share
COM 1430H - Computing & Probability
Favorite
COM 1502: Discrete Structures
2.00 - 3.00 Credits
Yeshiva University
No course description available.
Share
COM 1502 - Discrete Structures
Favorite
COM 1503: Discrete Structures
3.00 Credits
Yeshiva University
No course description available.
Share
COM 1503 - Discrete Structures
Favorite
COM 1504: Discrete Structures
0.00 - 4.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. (lecture: 3 hours; lab: 2 hours)
Share
COM 1504 - Discrete Structures
Favorite
COM 1621: Theory of Computation
3.00 Credits
Yeshiva University
Deterministic and nondeterministic finite state automata; regular grammars and regular expressions; equivalence of regular expressions and finite automata; pumping lemma for regular languages; context free grammars; languages generated by context free grammars; parse trees and ambiguity; Chomsky normal form; pushdown automata; equivalence of context free grammars and pushdown automata; pumping lemma for context free languages; Turing machines; Universal Turing machine; Halting problem; solvable and unsolvable problems about automata and languages; introduction to complexity theory; NP-complete problems.
Share
COM 1621 - Theory of Computation
Favorite
COM 1821: Computability
3.00 Credits
Yeshiva University
AE Functions computable by problems; simulation and diagonalization; Godel numbering and unsolvability results; Halting problem; Post's correspondence problem; recursion theorem; Ackerman's function; abstract complexity and the speed-up theorem; Tue and Norman systems.
Share
COM 1821 - Computability
Favorite
COM 1999: Computer Sci Elective
1.00 - 4.00 Credits
Yeshiva University
No course description available.
Share
COM 1999 - Computer Sci Elective
Favorite
COM 2101C: Digital Logic
0.00 - 3.00 Credits
Yeshiva University
Representation of both data and control information by digital signals; logical devices for processing (gates) and storing (flip-flops) information; description by truth tables, Boolean functions, and timing diagrams; analysis and synthesis of combinatorial networks of gates; parallel and serial registers; simple synchronous control mechanisms; data and address bases; addressing and accessing methods; memory segmentation; methods of timing pulse generation; common coding schemes; encoders, decoders, converters; memory, control, processing, and I/O units. Coordinated laboratory work in digital logic.
Share
COM 2101C - Digital Logic
Favorite
COM 2101L: Digital Logic
1.00 Credits
Yeshiva University
No course description available.
Share
COM 2101L - Digital Logic
Favorite
First
Previous
136
137
138
139
140
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
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.