|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
For seniors majoring in computer science.
-
3.00 Credits
A how-to course for any technologist who has endured difficult interfaces and want to design effective user interfaces that respect and advance the user experience. Course includes: Psychology, HCI personas, scenarios, prototyping, and evaluation for desktop and mobile applications. Prereq: CSCI 2312 - Intermediate Programming.
-
3.00 Credits
Computer Game Design and Programming introduces practical and example driven approaches to modern 3D game development. Topics include 3D modeling, character animation, UI design, scripting, texture mapping, and sound effect. Prereq: CSCI 2421.
-
1.00 - 3.00 Credits
Faculty or employer-supervised employment in industry. Enrollment is limited to students who fully completed a contract for cooperative education credit by the last day of the drop or add period. Prereq: CSCI 3415.
-
3.00 Credits
Provides a broad but detailed overview of the computer science field to graduate students in the biosciences, with emphasis on web technologies, programming languages, algorithms and database systems. No credit for CS graduate students. Prereq: working knowledge of programming language (e.g., Java).
-
3.00 Credits
Introduces information theory and its application in computer science, communication theory, coding and applied mathematics. Entropy, mutual information, data compression and storage, channel capacity, rate distortion, hypothesis testing. Error detecting and correcting codes, block codes and sequential codes. Prereq: CSCI 4535.
-
3.00 Credits
Software system design using object-oriented techniques, responsibility driven design and agile development practices. Topics include objects, classes, interfaces, inheritance, polymorphism, exception handling and testing.
-
3.00 Credits
Introduces discrete structures applications of graph theory to computer science, engineering and operations research. Topics include connectivity, coloring, trees, Euler and Hamiltonian paths and circuits. Matching and covering problems, shortest route and network flows. Prereq: MATH 3000 or CSCI 2511. Cross-listed with MATH 4408.
-
3.00 Credits
Studies geometric graphs and other geometric objects, both analysis and algorithmic construction, leads to interesting connections among VLSI design, graph theory and graph algorithms. Studies a subset of the recent literature, with special emphasis on visibility graphs, thickness of graphs, graph coloring and the surprising and elegant connections among them all. Other topics are introduced as time permits. Prereq: CSCI 3412, CSCI 4408, CSCI 5451 or MATH 4408 or permission of instructor.
-
3.00 Credits
Many practical and aesthetic algorithmic problems have their roots in geometry. Applications abound in the areas of computer graphics, robotics, computer-aided design, and geographic information systems, for example. A selection of topics from convex hull, art gallery problems, ray tracing, point location, motion planning, segment intersection, Voronoi diagrams, visibility and algorithmic folding will be covered. Prereq: CSCI 3412. Cross-listed with CSCI 4411.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|