|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Prerequisites: CSC 115, 117 or equivalent. A study of the COBOL programming language and its applications. Students are required to write/modify several programs applying structured programming techniques and to achieve successful computer execution. Credit not allowed as a Computer Science Elective for the Computer Science Degree.
-
3.00 Credits
Prerequisites: CSC 119, CSCL 119. Problem-solving methods, algorithm development, debugging and documentation in the C programming language with emphasis on the UNIX operating system environment. Topics include: pointers, strings, structures, unions, linked lists, UNIX process management, and UNIX shell programming. (F)
-
3.00 Credits
Prerequisites: CSC 119, CSCL 119. Problem-solving methods, algorithm development, debugging and documentation in the C++ programming language. Topics include: classes, operator overloading, inheritance, polymorphism, stream input/output, exception handling, and file processing. (S)
-
3.00 Credits
Prerequisites: CSC 119, CSCL 119. This course covers advanced topics for Java programmers. These topics include multithreading, collections, networking, advanced GUIs, database connectivity and JavaBeans. Students will be required to work on a project involving advanced Java programming.
-
3.00 Credits
Prerequisites: CSC 119, CSCL 119. This course is designed for students who have computer programming experience and who want to write Web applications. Students will learn the basic programming skills and languages that are needed to implement distributed Web applications. Topics include client-side programming techniques including HTML, Dynamic HTML and JavaScript; server-side programming techniques including CGI programming using Perl; and Web architectures and servers. (S)
-
3.00 Credits
Prerequisites: CSC 119, 225, CSCL 119, EN 212, ENL 212; corequisite:
-
3.00 Credits
Prerequisites: CSC 118, CSCL 118, MATH 118 or Higher. Introduces the foundations of discrete mathematics as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include basic logic, proof techniques, sets, bags, ordered structures, graphs, trees, facts and properties of functions, and construction techniques. (F, S)
-
3.00 Credits
Prerequisites: CSC 119, 225, CSCL 119; co-requisite: CSCL 228. The concepts of data abstraction and data structures are developed. For the basic data structures of linked lists, stacks, queues, hash tables, graphs, and trees, associated algorithms are described and analyzed. The course also treats recursion, sorting, fundamentals of software engineering, and the philosophy of object-orientation. (F, S)
-
3.00 Credits
Prerequisites: CSC 216, CSCL 216. Uniprocessor computer architectures are reviewed. Quantitative approaches of computer designs are emphasized. Performance enhancements to the uniprocessor architecture model, including pipelining and superscalar architectures, techniques to reduce instruction pipeline stalls, and memory organization techniques are studied. Advanced computer organizations, performance evaluation, and programming of vector processors, array processors, and multi processors are also covered. (F, S)
-
3.00 Credits
Prerequisites: CSC 118, CSCL 118. Topics include: Number bases, 2's and 1's complements, set theory, Venn diagrams, Boolean logic, DeMorgan's Rules, Propositional Calculus, Finite Calculus, introduction to the Predicate Calculus, combinatorics, gcd, modular arithmetic, introduction to the theory of computation and Turing Machines.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|