Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.
  • 3.00 Credits

    Spring semester. 3 semester hours. This course studies the representation of data and programs in the fundamental language of the computer. Students will learn how numeric and non-numeric data are represented in the processor and memory of modern computers and be led to understand how the basic operations familiar in high-level languages are implemented by the instructions executed by the processor. Successful programming in assembler language requires great attention to detail. Prerequisite: CSC131 or CSC143. It is strongly recommended that CSC354 be taken concurrently with CSC255.
  • 3.00 Credits

    On demand. 3 semester hours. The mathematical and theoretical underpinnings of computer science will be explored. Students will be introduced to Boolean algebra and elementary logic and their application to computer implementation and algorithm development. This course explores the historical development of computer science from its roots in mathematical models including early models of computation, such as Turing machines and other finite state machines. Prerequisite: CSC131 or CSC143 and either MAT110 or MAT175.
  • 1.00 - 3.00 Credits

    On demand. 1-3 semester hours. This occasional offering will study special areas of computer science not otherwise covered in the curriculum. Prerequisite: permission of professor.
  • 3.00 Credits

    Every third semester. 3 semester hours. Modern computers represent a powerful synergy of hardware and software, represented in deeply nested abstraction layers. In this course, students study computer architecture and organization as influenced by hardware-software interfaces. The organization of processors to support the fundamental execution cycle is explored. Additional topics include computer arithmetic, pipelines, performance factors and specialized architectures. Prerequisite: CSC255.
  • 3.00 Credits

    On demand. 3 semester hours. The study of numerical methods involves the design and use of algorithms for solving large mathematical problems with a computer. Topics include estimation of accuracy, the use of series and approximation, and numerical integration and differentiation. Prerequisites: CSC251 and MAT176.
  • 3.00 Credits

    Every third semester. 3 semester hours. The use of computer technology to create and display information in a visual manner is studied. Topics include display technology, graphic user interfaces (GUI), graphics algorithms, and computer-based imagery. Exercises will involve the use of current graphics software and systems. Prerequisite: CSC251 and CSC354.
  • 3.00 Credits

    Fall semester. 3 semester hours. The organization of computer systems into networks and the theory of computer communication across those networks will be studied. Communications protocols from design to implementation perspectives will be considered with a focus on current technology and software. Students will construct and test software implementations of the technologies as they are discussed. Prerequisite: CSC251. CSC255 is recommended.
  • 3.00 Credits

    On demand.. 3 semester hours. Network Programming picks up where CSC330 leaves off. The goal of the course is to provide students with an in-depth look at network application programming and the techniques and tools that are used therein. The student is assumed to have a fundamental knowledge of the protocol layering model of networking as well as an understanding of the network, transport and application layers of the Internet protocol stack. The material for the course focuses on Java's streams and IP-based protocols. The discussion is extended to include topics such as RMI, servlets, and other components from the Java API. Prerequisites: CSC330.
  • 3.00 Credits

    On demand. 3 semester hours. This course will introduce the student to the fundamental concepts and implementation of modern database systems, including relational and object-oriented databases. Topics include entity relationship models, transaction processing, concurrency, and query processing. Prerequisite: CSC251.
  • 3.00 Credits

    Annually. 3 semester hours. Most programming problems encountered by undergraduate computer science students are solvable using straightforward approaches. There are a number of important and challenging problems whose efficient solutions demand more sophisticated techniques. This course presents an organized study of major algorithmic strategies (Divide and Conquer, Dynamic Programming, Backtracking, Greedy, Branch and Bound) and introduces students to advanced topics including computability, fixed-point algorithms, and NP-complete problems. Algorithms for parallel processing are explored through the use of a Beowulf processor cluster as a target platform for programming exercises. Prerequisites: CSC251, CSC354, and senior standing.
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)
Privacy Statement   |   Terms of Use   |   Institutional Membership Information   |   About AcademyOne   
Copyright 2006 - 2024 AcademyOne, Inc.