Schedule of Classes

Pattern recognition, search strategies, game playing, knowledge representation; logic programming, uncertainty, vision, natural language processing, robotics, programming in LISP and PROLOG. Advanced topics in artificial intelligence. Cross-listed with CS 561.

Designing and building enterprise-wide data warehouses. Cover topics related to large distributed databases, including designing distributed databases, replicating data, and concurrency. NoSQL, object-oriented, and multimedia databases and their query languages. Cross-listed with CS 572.

Pattern recognition, search strategies, game playing, knowledge representation; logic programming, uncertainty, vision, natural language processing, robotics, programming in LISP and PROLOG. Advanced topics in artificial intelligence. Cross-listed with CS 461. For cross-listed undergraduate/graduate courses, the graduate-level course will have additional academic requirements beyond those of the undergraduate course.

Designing and building enterprise-wide data warehouses. Cover topics related to large distributed databases, including designing distributed databases, replicating data, and concurrency. NoSQL, object-oriented, and multimedia databases and their query languages. Cross-listed with CS 472. For cross-listed undergraduate/graduate courses, the graduate-level course will have additional academic requirements beyond those of the undergraduate course.

Covers topics including basic concepts and principles of software requirements engineering, the requirements engineering process, requirements elicitation, requirements analysis, requirements specification, system modeling, requirements validation and requirements management, and techniques, methods, and tools for requirements engineering and software systems requirements modeling (including structured, object-oriented and formal approaches to requirements modeling and analysis).

Theory of formal languages and computability, Automata, Turing machines, grammars. Context free and context sensitive languages; parsing. Recursion theory; limits of effective computability, P and NP class of problems, NP-complete problems. Non Turing computable problems, reducibility, complexity.

Special software engineering research and development projects under staff supervision. Emphasis on a specific topic and emerging technologies in the software engineering area.

Individual study in an area of computer science relevant to the student's professional goals and not covered in a formal course offered by the department. May be repeated twice for a maximum of 6 credit hours.