|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Common data structures and algorithms for their processing are covered. Elementary analysis of algorithms is included. Data structures include stacks, queues (including priority queues), binary search trees, advanced trees, graphs and their representations (including depth- and breadth-first traversals), and hash tables (including collision-avoidance strategies). Additional topics include searching and sorting. All data structures are presented using object-oriented implementations.
-
3.00 Credits
Students will be exposed to writing larger applications than in the introductory programming sequence (CSE 1301, CSE 1302, and CS 3424). In depth coverage of the programming language of choice is used to design and implement applications. Large scale projects are required.
-
1.00 - 4.00 Credits
Special topics selected by the department. Offered on a demand basis.
-
4.00 Credits
This course offers a first-hand programming experience with Personal Digital Assistants. The course addresses issues particular to small, portable devices, such as their GUI, storage and synchronization. It also explores the wireless environment where these devices would interact.
-
3.00 Credits
This course covers command line, shell, scripting and system tools like AWK and PERL. It also covers Unix file I/O and process control, as well as the use and construction of user interfaces.
-
3.00 Credits
A course that introduces students to the fundamental principles common to the design and implementation of programs that run on two or more interconnected computer systems. The subtopics, which are based on these principles, include: distributed operating system and network protocols for process communication, synchronization, scheduling, and exception and deadlock resolution; understanding of client-server, web-based collaborative systems; parallel computing; concurrency issues; and API's for distributed application development. Several distributed computing environments, like MPI, PVM, and Java RMI are discussed and used in developing experimental projects in a cluster of networked computers.
-
3.00 Credits
This course broadly covers networking technology from the bottom up. It begins with physical media (copper wire, optical fiber, radio), moves to electrical signaling (carriers, modulation), digital encoding, error detection, data framing and media access strategies. Physical and data link layer devices are studied along with popular topologies. Most popular data-link protocols are reviewed. The course includes an introduction to TCP/IP protocols.
-
3.00 Credits
This course covers the software-development life cycle as it applies to real-time systems. Labs involve the use of a real-time operating system and an associated development environment. System performance issues are also discussed. Major project included.
-
3.00 Credits
The basic principles and practices of interactive computer graphics and multimedia systems are covered in this introductory course. The design and implementation of state-of-the-art computer graphic rendering and visual multimedia systems are the main part of the course. The sub-topics of the course deal with specific input/output hardware devices and their technology, software and hardware standards, programming methods for implementing 3-dimensional graphical applications and interactive multimedia applications, and a study and evaluation of the effectiveness of graphic/multimedia communications. A large component of the class is the building of a large-scale application.
-
3.00 Credits
Advanced algorithm analysis including the introduction of formal techniques and the underlying mathematical theory. Topics include asymptotic analysis of upper and average complexity bounds using big-O, little-o, and theta notation. Fundamental algorithmic strategies (brute-force, greedy, divide-and-conquer, backtracking, branch-and-bound, pattern matching, and numerical approximations) are covered. Also included are standard graph and tree algorithms. Additional topics include standard complexity classes, time and space tradeoffs in algorithms, using recurrence relations to analyze recursive algorithms, non-computable functions, the halting problem, and the implications of non-computability. Algorithmic animation is used to reinforce theoretical results. Upon completion of the course, students should be able to explain the mathematical concepts used in describing the complexity of an algorithm, and select and apply algorithms appropriate to a particular situation.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|