|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Prerequisites: Either CSCD 211 or CSCD 255 with a minimum grade of 2.7; Math Proficiency with a minimum grade of 2.5. This course includes program development tools of the UNIX operating system and syntax and programming techniques of the C language in that environment. UNIX topics include interactive shells, common text editors, utility programs, file system structure, libraries and operating system calls and system programming. C topics include data types, structures, pointers and pointer arithmetic, arrays, linked lists and function design and use. Programming projects are required.
-
5.00 Credits
Prerequisite: MATH 105 or Math Proficiency. Learning to use the "C" language in the context ofbeginning computer science concepts and engineering practices. This course will provide students with a familiarity with the C programming language, skills and understanding of programming concepts, experience programming in a structured, modular manner consistent with accepted programming practices and basic programming principles in the context of engineering problems.
-
4.00 Credits
Prerequisites: CSCD 211 with a minimum grade of 2.7; a minimum grade of 2.5 in ENGR 160 and in Math Proficiency. This course covers fundamentals of digital computer design and microcomputer systems. Topics include number systems, Boolean algebra, basic digital circuits and an instruction set for a microprocessor. Homework assignments will include use of current software for the design, analysis and simulation of digital circuits, assembly language programming emphasizing I/O device access and features that support high level languages. Programming projects are required.
-
1.00 - 5.00 Credits
Seminar
-
1.00 - 5.00 Credits
Prerequisite: Permission of the instructor and the department chair. Subjects studied vary according to student and faculty interest.
-
4.00 Credits
Prerequisites: CSCD 211 with a minimum grade of 2.7 and a minimum grade of 2.5 in MATH 106 or in MATH 301 or in MATH 380. This course covers fundamental abstract concepts of data structures as well as their implementation in a programming language. Topics include linked lists, stacks, queues, hashing, recursion, complexity analysis of algorithms, binary search trees and heaps. Programming projects with formal documentation are required.
-
4.00 Credits
Prerequisite: A minimum grade of 2.7 in CSCD 255 or in both CSCD 211 and CSCD 240. This course teaches the C++ programming language. Topics include basic syntax, pointers, memory management, classes, inheritance and polymorphism, exception handling, standard template library usage, name spaces, memory management and graphical user interface (GUI) programming. Programming projects are required.
-
4.00 Credits
Prerequisites: CSCD 211 with a minimum grade of 2.7 and MATH Proficiency with a minimum grade of 2.5. This course covers the fundamental concepts associated with the design, development and use of information systems. Topics include information technology, characteristics of IS professionals and IS career paths, information assurance, privacy, ethics and globalization. Practical exercises corresponding to both IS professionals and end-users are required.
-
4.00 Credits
Prerequisites: MATH 200 or MATH 231 or MATH 301. This course provides an introduction to scientific computing in a programmable mathematics-oriented environment such as Matlab or Octave. Topics include programming constructs, data visualization, solutions to linear systems of equations and algebraic approaches to root-finding, interpolation and optimization.
-
4.00 Credits
Prerequisites: CSCD 300 with a minimum grade of 2.7, ENGR 160 with a minimum grade of 2.5, Advancement Programming Exam clearance and a minimum grade of 2.5 in either MATH 161 or MATH 301. This course studies mathematical aspects of computer science with emphasis on data structures and algorithmic implementation. Topics include logic, methods of proof, set theory, relations and functions, numerical representations, cardinality, computability, combinatorics (with a bit of discrete probability), computational complexity and graph theory.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|