|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
This course discusses concepts of languages defined by formal grammars, Turing machines and rewriting systems, computability, Church-Turing thesis, decidable and undecidable problems, computational complexity, polynomial reducibility, NP-completeness, and Cook's theorem. Prerequisites/Corequisites: Prerequisite: CSCI 2400. When Offered: Fall term annually. Credit Hours: 4
-
4.00 Credits
Introduction to the theory, algorithms, and applications of automated learning (supervised, reinforcement, and unsupervised), how much information and computation are needed to learn a task, and how to accomplish it. Emphasis will be given to unifying approaches coming from statistics, function approximation, optimization and pattern recognition. Topics include: Decision Trees, Neural Networks, RBF's, Bayesian Learning, PAC Learning, Support Vector Machines, Gaussian processes, Hidden Markov Models. Prerequisites/Corequisites: Prerequisites: familiarity with probability, linear algebra, and calculus. When Offered: Offered on availability of instructor. Credit Hours: 4
-
4.00 Credits
Topics and techniques of artificial intelligence using the language LISP. Topics include search, knowledge representation, expert systems, theorem proving, natural language interfaces, learning, game playing, and computer vision. Techniques include pattern matching, data-driven programming, substitution rules, frames, heuristic search, transition networks, neural networks, and evolutionary computation. Development of programming proficiency in LISP is emphasized. Prerequisites/Corequisites: Prerequisite: CSCI 2300. When Offered: Fall term annually. Credit Hours: 4
-
4.00 Credits
An introduction to algorithms for robotic systems with a focus on motion planning, processing sensor information, world modeling, and handling uncertainty. Discusses application of techniques to mobile robotics and robotic manipulations. Emphasizes practical algorithms and implementing them in the laboratory. Prerequisites/Corequisites: Prerequisites: CSCI 2300, MATH 1020, and MATH 2800. When Offered: Spring term even-numbered years. Credit Hours: 4
-
4.00 Credits
Discussion of various aspects of computer operating systems design and implementation. Topics include I/O programming, concurrent processes and synchronization problems, process management and scheduling of processes, virtual memory management, device management, file systems, deadlock problems, system calls, and interprocess communication. Programming projects are required. Prerequisites/Corequisites: Prerequisites: CSCI 2300 and CSCI 2500. When Offered: Fall and spring terms annually. Credit Hours: 4
-
4.00 Credits
An overview of the principles of computer networks, including a detailed look at the OSI reference model and an overview of various popular network protocol suites. Concentration on Unix interprocess communication, network programming using TCP/ IP, and distributed objects using CORBA. Prerequisites/Corequisites: Prerequisite: CSCI 4210. When Offered: Spring term annually. Credit Hours: 4
-
4.00 Credits
Basic principles of computer design, including such topics as instruction sets, memory hierarchy, arithmetic, pipelining, vector processing, interconnection networks, and multiprocessors. The course emphasizes fundamental concepts and presents examples from existing computer systems. Prerequisites/Corequisites: Prerequisites: CSCI 2500 and CSCI 2300. When Offered: Fall term annually. Credit Hours: 4
-
4.00 Credits
Fundamental concepts and methods of graph theory and its applications of computing and the social and natural sciences. Topics include graphs as models, representation of graphs, trees, distances, matchings, connectivity, flows in networks, graph colorings, Hamiltonian cycles, traveling salesman problem, planarity. All concepts, methods, and applications are presented through a sequence of exercises and problems, many of which are done with the help of novel software systems for combinatorial computing. Prerequisites/Corequisites: Prerequisites: MATH 2800 and CSCI 1100. When Offered: Spring term. Cross Listed: Cross-listed as MATH 4150. Students cannot obtain credit for both this course and MATH 4150. Credit Hours: 4
-
4.00 Credits
Techniques and methods for parallel programming: models of parallel machines and programs, efficiency and complexity of parallel algorithms. Paradigms of parallel programming and corresponding extensions to sequential programming languages. Overview of parallel languages and coordination languages and models; programming on networks of workstations. Basic parallel algorithms: elementary computation, matrix multiplication, sorting; sample scientific application. Prerequisites/Corequisites: Prerequisites: CSCI 2400 and CSCI 2500. When Offered: Spring term annually. Credit Hours: 4
-
4.00 Credits
Discussion of the state of practice in modern database systems, with an emphasis on relational systems. Topics include database design, database system architecture, SQL, normalization techniques, storage structures, query processing, concurrency control, recovery, security, and new directions such as object-oriented and distributed database systems. Students gain hands-on experience with commercial database systems and interface building tools. Programming projects are required. Prerequisites/Corequisites: Prerequisite: CSCI 2300. When Offered: Fall and spring terms annually. Credit Hours: 4
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|