|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Object-oriented design methodologies; object-oriented programming; class concepts, encapsulation; polymorphism, composition and inheritance; virtual functions; delayed binding; class-interfaces and message passing; generics/templates; function overloading; and exception handling; binary file I/O; advanced OO programming.
-
3.00 Credits
Basic programming constructs: primitive types, expressions, and statements; class hierarchies; elementary predefined classes such as String and Math; object-oriented programming; packages and interfaces; exception handling; I/O and file access; graphics; applets; studio processing and other applications.
-
3.00 Credits
UNIX commands, shells, utilities, editors; file types and modes; shell scripts; make-files; memory and storage management; C programming tools; processes, IPC (signals, sockets, pipes); development tools; streams; networking; UNIX internals, system administration and other topics as time permits.
-
3.00 Credits
Study of mathematical topics needed for further study of computer science at the advanced undergraduate level, including: logic, sets, proof techniques, matrices, basic number theory, modular arithmetic, functions, linear transformations, relations, basic combinatorics.
-
3.00 Credits
A continuation of CSIT 241. Topics include combinatorics, digraphs, and trees; recurrence relations; switching circuits and logic gates; automata, grammars and languages; other topics as time permits.
-
3.00 Credits
Overview of information systems (IS) for operational, tactical and strategic functions of business organizations; IS practices and challenges for business competitiveness; data, information and knowledge processing; information systems theory and quality decision, systems analysis and design, database management, network and network management; electronic commerce and social and ethical issues; IS and IT planning and implementation.
-
0.00 - 3.00 Credits
No course description available.
-
0.00 - 99.00 Credits
No course description available.
-
3.00 - 12.00 Credits
Review basic data structures and algorithmic complexities; sorting; generalized lists; binary trees; binary search trees; tree traversals; advanced hierarchical structures: n-ary trees, heaps, balanced trees, tries; priority queues; hashing; graphs, graph algorithms; applications of above data structures.
-
0.00 Credits
Non-credit course for students interested in performing computer-related services for the Computer and Information Sciences program. Duties include: proctoring in computing laboratories; assisting with the labs in CSIT 121 or CSIT 221; helping the faculty director and/or systems manager with basic laboratory maintenance. Grading is on an S/U basis. Permission of the department required.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|