[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.
COMPSCI 214: Computer Networks and Distributed Systems
3.00 Credits
Duke University
Basic systems support for process-to-process communications across a computer network. The TCP/IP protocol suite and the Berkeley sockets application programs interface. Development of network application programs based on the client-server model. Remote procedure call and implementation of remote procedure call. Prerequisite: knowledge of the C programming language. Instructor: Maggs or X. Yang
Share
COMPSCI 214 - Computer Networks and Distributed Systems
Favorite
COMPSCI 215: Wireless Networking and Mobile Computing
3.00 Credits
Duke University
Theory, design, and implementation of mobile wireless networking systems. Fundamentals of wireless networking and key research challenges. Students review pertinent journal papers. Significant, semester-long research project. Networking protocols (Physical and MAC, multi-hop routing, wireless TCP, applications), mobility management, security, and sensor networking. Prerequisites: Electrical and Computer Engineering 156 or Computer Science 114. Instructor: Roy Choudhury
Share
COMPSCI 215 - Wireless Networking and Mobile Computing
Favorite
COMPSCI 216: Data-Intensive Computing Systems
3.00 Credits
Duke University
Data-Intensive Computing Systems. Principles and techniques for making intelligent use of the massive amounts of data being generated in commerce, industry, science, and society. Topics include indexing, query processing, and optimization in large databases, data mining and warehousing, new abstractions and algorithms for parallel and distributed data processing, fault-tolerant and self-tuning data management for cloud computing, and information retrieval and extraction for the Web. Prerequisites: Computer Science 116 or an introductory database course or consent of instructor. Instructor: Babu or J. Yang
Share
COMPSCI 216 - Data-Intensive Computing Systems
Favorite
COMPSCI 219: Statistical Data Mining
3.00 Credits
Duke University
Introduction to data mining, including multivariate nonparametric regression, classification, and cluster analysis. Topics include the Curse of Dimensionality, the bootstrap, cross-validation, search (especially model selection), smoothing, the backfitting algorithm, and boosting. Emphasis on regression methods (e.g., neural networks, wavelets, the LASSO, and LARS), classifications methods (e.g., CART, Support vector machines, and nearest-neighbor methods), and cluster analysis (e.g., self-organizing maps, D-means clustering, and minimum spanning trees). Theory illustrated through analysis of classical data sets. Prerequisites: Statistics 114. Instructor: Banks
Share
COMPSCI 219 - Statistical Data Mining
Favorite
COMPSCI 220: Advanced Computer Architecture I
3.00 Credits
Duke University
Fundamental aspects of advanced computer architecture design and analysis. Topics include processor design, pipelining, superscalar, out-of-order execution, caches (memory hierarchies), virtual memory, storage systems, simulation techniques, technology trends and future challenges. Prerequisite: Computer Science 104 or Electrical and Computer Engineering 152 or equivalent. Instructors: Board, Kedem, Lebeck, or Sorin
Share
COMPSCI 220 - Advanced Computer Architecture I
Favorite
COMPSCI 221: Advanced Computer Architecture II
3.00 Credits
Duke University
Parallel computer architecture design and evaluation. Design topics include parallel programming, message passing, shared memory, cache coherence, cache coherence, memory consistency models, symmetric multiprocessors, distributed shared memory, interconnection networks, and synchronization. Evaluation topics include modeling, simulation, and benchmarking. Prerequisite: Computer Science 220 or Electrical and Computer Engineering 252 or consent of instructor. Instructor: Lebeck or Sorin
Share
COMPSCI 221 - Advanced Computer Architecture II
Favorite
COMPSCI 225: Fault-Tolerant and Testable Computer Systems
3.00 Credits
Duke University
Technological reasons for faults, fault models, information redundancy, spatial redundancy, backward and forward error recovery, fault-tolerant hardware and software, modeling and analysis, testing, and design for test. Prerequisite: Electrical and Computer Engineering 152 or equivalent. Instructor: Sorin
Share
COMPSCI 225 - Fault-Tolerant and Testable Computer Systems
Favorite
COMPSCI 226: Probability for Electrical and Computer Engineers
3.00 Credits
Duke University
Basic concepts and techniques used stochastic modeling of systems with applications to performance and reliability of computer and communications system. Elements of probability, random variables (discrete and continuous), expectation, conditional distributions, stochastic processes, discrete and continuous time Markov chains, introduction to queuing systems and networks. Prerequisite: Mathematics 107. Instructor: Trivedi
Share
COMPSCI 226 - Probability for Electrical and Computer Engineers
Favorite
COMPSCI 230: Design and Analysis of Algorithms
3.00 Credits
Duke University
Design and analysis of efficient algorithms. Algorithmic paradigms. Applications include sorting, searching, dynamic structures, graph algorithms, randomized algorithms. Computationally hard problems. NP completeness. Prerequisite: Computer Science 100 or equivalent. Instructor: Agarwal, Edelsbrunner, Munagala, or Reif
Share
COMPSCI 230 - Design and Analysis of Algorithms
Favorite
Show comparable courses
COMPSCI 232: Approximation Algorithms
3.00 Credits
Duke University
Cover traditional approximation algorithms with combinatorial and linear programming techniques; extended survey of cut problems and metric embeddings; embeddings, dimensionality reduction, locality sensitive hashing, and game theory. Instructor: Agarwal or Munagala
Share
COMPSCI 232 - Approximation Algorithms
Favorite
First
Previous
131
132
133
134
135
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