• CSC 307: Data Structures

  3.00 Credits

  Carson-Newman University

  
  Not currently available
  ShareCSC 307 - Data Structures

• CSC 308: Algorithms

  3.00 Credits

  Carson-Newman University

  
  Algorithm design techniques, greedy algorithms, divide-and-conquer approaches, dynamic programming, data representation, heuristic search, program complexity, and algorithm verification. Prerequisites: CSC 207 and MATH 207.
  ShareCSC 308 - Algorithms

• CSC 310: Networking

  3.00 Credits

  Carson-Newman University

  
  Introduction to data communications and networking. Basic network principles, hardware and software standards, network types and structures, security, and physical implementation will be introduced. Prerequisite: CSC 207.
  ShareCSC 310 - Networking

• CSC 312: Database Management

  3.00 Credits

  Carson-Newman University

  
  Introduction to databases and their design, function management and application. This includes data modeling approaches including entity-relationship and semantic object models. A variety of database access and management systems will be explored. Prerequisite: CSC 207.
  ShareCSC 312 - Database Management

• CSC 320: Systems Programming

  3.00 Credits

  Carson-Newman University

  
  Introduction to C and its use in system programming. Memory and process layout, system calls, buffering, file systems, virtual memory, threading, and inter-process communication. Prerequisite: CSC 207.
  ShareCSC 320 - Systems Programming

• CSC 330: Mobile Application Programming

  3.00 Credits

  Carson-Newman University

  
  Not currently available
  ShareCSC 330 - Mobile Application Programming

• CSC 370: Special Topics

  3.00 Credits

  Carson-Newman University

  
  An exploration of a current topic in computing. May be repeated if taken with different topics. Prerequisites: CSC 207 or instructor's consent.
  ShareCSC 370 - Special Topics

• CSC 405: Theory of Computation

  3.00 Credits

  Carson-Newman University

  
  Formal models of computation such as finite state automata, pushdown automata, and Turing machines, along with corresponding elements of formal languages, regular expressions, context-free languages, and recursively enumerable languages. Prerequisites: CSC 207 and MATH 207.
  ShareCSC 405 - Theory of Computation

• CSC 406: Principals Programming Languages

  3.00 Credits

  Carson-Newman University

  
  The theory of programming languages, data types, data control, sequence control, run-time storage, language translations, semantics. Language models will include procedural, function, logic, and object-oriented programming. Prerequisite: CSC 207.
  ShareCSC 406 - Principals Programming Languages

• CSC 407: Operating Systems

  3.00 Credits

  Carson-Newman University

  
  Advanced computer architecture, technological choices, and the operating system interface with the hardware, the application, and the system user. Process synchronization, memory management, devices, files and performance evaluation. Prerequisite: CSC 303.
  ShareCSC 407 - Operating Systems