|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Credits: 3 Covers various basic software topics in autonomous robotics, including autonomous architectures, elementary kinematics and controls, simulation, localization and mapping, reasoning, and multiagent environments. The course will have several projects involving physical robots. Prerequisites CS 262, CS 310, MATH 203 or permission of the instructor. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Capstone course focusing on design and successful implementation of major software project, encompassing broad spectrum of knowledge and skills, developed by team of students. Requires final exhibition to faculty-industry panel. Prerequisites Grade of C or better in CS 421, 483; two other CS 400-level courses; and senior standing. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
1.00 - 3.00 Credits
Credits: 1-3 Research and analysis of selected problems or topics in computer science. Topic must be arranged with instructor and approved by department chair before registering. Prerequisites 60 credits, major in computer science, and permission of instructor. Notes May be repeated for maximum 6 credits if topics substantially different. Hours of Lecture or Seminar per week 0 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Topics of special interest to undergraduates. Prerequisites 60 credits and permission of instructor; specific prerequisites vary with nature of topic. Notes May be repeated for maximum 6 credits if topics substantially different. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Basic programming language processors such as assemblers, interpreters, and compilers. Topics include design and construction of language processors, formal syntactic definition methods, parsing techniques, and code generation techniques. Lab includes construction of language processors, and experience with programming environments. Prerequisites MATH 125; and CS 310, 330, and 365 Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Techniques and systems for communication of data between computational devices and layers of Internet Protocol Suite. Topics include role of various media and software components, local and wide area network protocols, network design, performance and cost considerations, and emerging advanced commercial technologies. Emphasizes TCP/IP family of protocols. Prerequisites STAT 344 or equivalent. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Models of operating systems. Major functions including processes, memory management, I/O, interprocess communication, files, directories, shells, distributed systems, performance, and user interface. Prerequisites CS 310 and CS 465. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Principles and methods for knowledge representation, reasoning, learning, problem solving, planning, heuristic search, and natural language processing and their application to building intelligent systems in a variety of domains. LISP, PROLOG, or expert system programming language. Prerequisites CS 310 and 330. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Topics include analyzing sequential and parallel algorithmic strategies such as greedy methods, divide and conquer strategies, dynamic programming, search and traversal techniques, and approximation algorithms; and analyzing specific algorithms falling into these classes, NP-Hard and NP-Complete problems. Prerequisites CS 310 and 330, and MATH 125. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
3.00 Credits
Credits: 3 Introduction to logic and proof techniques, formal languages, automata theory, and computational complexity. Specific topics include regular and context-free languages, Turing machines, NP-completeness, and undecidability. Prerequisites CS 583 and discrete mathematics. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|