|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
5.00 Credits
Prereq: C S 361 & (320 OR E E 352) & SR. All major phases of the software engineering lifecycle, including system engineering, requirements analysis, design, implementation and testing. Communication skills that are relevant to working in software engineering teams and interacting with customers. Teams of students perform all software engineering phases in response to the needs of a customer. May be retaken three times excluding withdrawals, but only last course taken counts. T3
-
5.00 Credits
Prereq: C S 442. Continuation of 442. Detailed discussion of virtual memory and backing stores. File system interfaces, implementation, and protection mechanisms. Process scheduling issues, policies, and mechanisms. Interprocess communication between programs on different computers. Distributed systems issues, examples, and implementation. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 361. Introduces fundamental concepts in data modeling and relational database systems. Begins with the entity-relationship (ER) modeling technique as a tool for conceptual database design. The relational data model and relational algebra are introduced next, followed by the SQL query language for relational databases. Functional dependencies, normalization, and relational database design algorithms are then discussed. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 442 & 462. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 462. This course introduces both fundamental and advanced concepts in modern information retrieval. Approaches and algorithms for automatic indexing are discussed. File and access structures for implementing information retrieval systems are studied. Several information retrieval models are investigated in detail. Methods for quantifying retrieval effectiveness and enhancing retrieval effectiveness via user relevance feedback are examined. Hypertext/Hypermedia principles are introduced, and distributed hypermedia systems are studied. May be retaken three times excluding withdrawals, but only last course taken counts.
-
4.00 Credits
Prereq: C S 361 & NOT COMT 475. Understanding internet protocols; network cabling, hubs, and switches; configuring network routers; configuring Unix and Windows workstations; measuring and analyzing network performance; and troubleshooting. May be retaken two times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 300. Definition of heuristic versus algorithmic methods, rationale of heuristic approach, description of cognitive processes, and approaches to mathematical invention. Objectives of work in artificial intelligence, simulation of cognitive behavior, and selforganizing systems. Heuristic programming techniques including use of list processing languages. Survey of examples from representative application areas. Mindbrain problem and nature of intelligence. Class and individual projects to illustrate basic concepts. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: C S 480. Work on a major project in one of the basic areas of Al investigation. These include natural language processing, vision simulation, intelligent database systems, heuristic state-space search, and inferential networks. Emphasis on program selfmodification through feedback mechanisms. May be retaken three times excluding withdrawals, but only last course taken counts.
-
5.00 Credits
Prereq: MATH 250. Foundation and development of expert systems using the CLIPS environment.
-
3.00 Credits
Prereq: JR RANK & 3 400-LEVEL COURSES BELOW 490. Special project in 1 of various subfields of computer science or application area studied, investigated, and/or solved by individual student or small group working in close relationship with instructor. Suitable problems might include construction of compiler for special purpose artificial language, perfection of computer code to solve some significant problem, or study of coherent subfield of computer science. May be repeated for credit. May be repeated for a maximum of 15 hours.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|