|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Prerequisite: CSC 220 with a grade of C or higher A second course in computer science in which students learn how the algorithms and structures studied in CSC 220 are implemented. Classic data structures (lists, queues, stacks, trees, and hash tables) and algorithms (searching and sorting) are considered. The analysis of implementation techniques is addressed by studying the trade-offs between static and dynamic structures. A second object-oriented programming language is introduced. A C++ test is required for students approved to transfer an equivalent course in which C++ was not covered.
-
4.00 Credits
Prerequisite: CSC 215 with a grade of C or higher; for non-majors only A first, intensive course in computer science for non majors with demonstrated programming experience. The basic introduction to programming (as covered in CSC 220) is considered a review, while the emphasis on problem solving and solution design is presented within the context of a thorough grounding in the classic data structures using the modern object-oriented framework. Note: Students approved to take CSC 250 must complete an additional CS option for the major or minor.
-
4.00 Credits
Prerequisite: CSC 220 with a grade of C or higher; CSC 215,, or 250 with a grade of C or higher is permitted for non-majors This course introduces students to concepts and structures fundamental to computer science, while emphasizing algorithmic thinking, mathematical reasoning, and their applications. Topics include logic, sets, functions, relations, graphs, induction, recursion, languages and grammars, and finite-state machines.
-
4.00 Credits
(cross-listed as STA 307) Prerequisites: STA 215, and BIO 352 or CSC 320 An introduction to Data Mining and Predictive Modeling. Topics include decision trees, link functions, logic regression, neural networks, TreeNet, support vector machine, text mining, association rules (market basket analysis), and link analysis.
-
4.00 Credits
Prerequisite: CSC 230 with a grade of C or higher; non-majors may use CSC 250 in lieu of CSC 230 This course introduces students to the fundamental concepts necessary for designing and implementing database systems. It stresses the fundamentals of database modeling and design, the language and facilities provided by database management systems, and system implementation techniques. A database management system like Oracle or PostgreSQL is utilized to underscore concepts learned in class.
-
4.00 Credits
(cross-listed as IMM 320) Prerequisites: For CS majors: CSC 230 with a grade of C or higher. For IMM majors: IMM core with a grade of C or higher; other majors may use CSC 250 in lieu of CSC 230. The course discusses theory and practice of searching and retrieval of information. Topics covered include automated indexing, statistical and linguistic models, text classification, Boolean and probabilistic approaches to indexing, query formulation and output ranking, information routing and filtering, topic detection and tracking, as well as measures of retrieval effectiveness, including relevance, utility, miss/false-alarm. Techniques for enhancing retrieval effectiveness including relevance feedback, query reformulation, thesauri, concept extraction, and automated summarization. Experimental retrieval approaches from relevant state-of-the-art conferences (TREC) as well as modern Internet search engines are discussed in detail.
-
4.00 Credits
Prerequisites: CSC 230 and CSC 270, both with a grade of C or higher; non-majors may use CSC 250 in lieu of CSC 230 Introduces the architecture of a general-purpose computer by considering its structure at the hardware and software levels through the instruction set. This project-oriented course stresses design and implementation of the processor of a computer. Introduces design and simulation of combinational and sequential logic circuits, the design of the instruction set for a von Neumann architecture, and the writing of programs in an assembly language for such a machine. Topics include combinational logic design; finite state machines; instruction set architectures; elements of computer organization; RTL; processor and hardware control unit design; computer arithmetic and ALU design; memory subsystem and cache design; reduced instruction sets; and I/O interfaces.
-
4.00 Credits
Prerequisites: CSC 230 and CSC 270, both with a grade of C or higher; non-majors may use CSC 250 in lieu of CSC 230 This course presents major principles of algorithm design and analysis, and applies those principles to classical problems in computer science. Topics include algorithm complexity analysis, data structures, divide and conquer, searching and sorting, greedy algorithms, graph search and traversal, bipartite matching, dynamic programming, approximate string matching, partitioning, and union-find.
-
4.00 Credits
Prerequisites: CSC 325; Engineering majors: ELC 451, and CSC 250 with a grade of C or higher Operating systems (OS) theory and implementation, examining the operating system as an interface between the application program and computer hardware. OS services for memory, processor, file, and device management are examined. Study of resource management implemented by an operating system in a multiprogramming environment. Case studies include system software design and implementation highlighting standard operating systems.
-
4.00 Credits
Prerequisites: CSC 230 and CSC 270, both with grades of C or higher; non-majors may use CSC 250 in lieu of CSC 230, but must demonstrate knowledge of C/C++ by passing a placement test This course is an introduction to the fundamentals underlying the design of computer graphics software, taking an algorithmic approach to the study of graphic operations required to create a complex scene. The modeling and transformation process is stressed. Topics include 2D and 3D graphic elements and transformations, viewing and clipping, hierarchical modeling, visible surface detection, and lighting models.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|