CSC 105 DIGITAL HUMANITIES/ 3 CREDITS
An introduction to the theory and methods of Digital Humanities. Topics will include digital text encoding (XML), text computation and analysis, data visualization, and geographic information system (GIS) mapping.
CSC 115 INTRODUCTION TO PROGRAMMING IN JAVA / 3 CREDITS
An introduction to object-oriented programming using Java. Topics include problem-solving methods, algorithm development, program design, testing, debugging, and documentation. Prerequisite: MTH 101.
CSC 140 INTRODUCTION TO PROGRAMMING IN C / 3 CREDITS
An introduction to structured programming, including user defined types, arrays, records, files, and sets. Prerequisite: MTH 101.
CSC 240 DATA STRUCTURES WITH C++ / 3 CREDITS
CSC 245 INTRODUCTION TO DIGITAL LOGIC / 3 CREDITS
An introduction to digital electronic circuits and techniques. Boolean algebra, digital logic gates, registers, automa theory, and integrated circuits. Prerequisite: MTH 115. (Same as PHY 235).
CSC 255 COMPUTER ARCHITECTURE / 3 CREDITS
Introduction to computer organization and the basic structure of a modern programmable computer. Topics covered include the von Neumann architecture, the CPU, pipelining, memory hierarchy, assembly/ machine language, and the basic laws underlying performance evaluation. Prerequisite: CSC 240 and CSC 245.
CSC 265 ALGORITHMS / 3 CREDITS
Study of algorithmic paradigms including divide and conquer algorithms, greedy methods, dynamic programming, heuristics, and probabilistic algorithms. Prerequisite: CSC 240.
CSC 301 JUNIOR INTERNSHIP / 1-2 CREDITS
Practical experience through a supervised internship. Students can conduct their internships on-site, working under the supervision of computing/automation/IT professionals, or on eIntern. Prerequisite: CSC 140 and permission of instructor.
CSC 310 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE / 3 CREDITS
Introduction to mathematical topics as they relate to computer science, such as finite state automata, regular expressions, context-free grammars, Turing machines, and unsolvability. Prerequisite: CSC 265.
CSC 320 PROGRAMMING LANGUAGES
A study of programming languages, their data, paradigms, and design and implementation issues. Topics include language representation, control structures, binding, run-time environment, exception handling, information handling, encapsulation and static and dynamic types. Prerequisite: CSC 310.
CSC 330 DATABASE THEORY AND APPLICATION / 3 CREDITS
An introduction to the theory of databases, database design, and database application development. Topics include database models such as relational, network, hierarchical, object-oriented, and distributed. Students will apply this theory to the development of an actual database application. Prerequisite: MTH
115 and either CSC 115 or CSC 140.
CSC 401 SENIOR INTERNSHIP / 1-2 CREDITS
CSC 410 DATA COMMUNICATIONS AND NETWORKS / 3 CREDITS
An introduction to the theory and practice of computer networks, software protocols, communication hardware, error detection, and handling. Prerequisite: CSC 265 and CSC 310
CSC 415 NUMERICAL ANALYSIS / 3 CREDITS
Examination of error analysis, interpolation, approximate differentiation, approximate integration, solutions to differential equations, matrix manipulation, and solutions to systems of linear equations. Prerequisites: MTH 300 and CSC 115 or CSC 140. (Same as MTH 415).
CSC 420 OPERATING SYSTEMS / 3 CREDITS
An introduction to the components and organization of operating systems. Batch, interactive and distributed operating systems will be considered. Other topics include multiprogramming, multiprocessing, concurrent programming, memory management, and resource allocation. Prerequisite: CSC 265.
CSC 450 INDEPENDENT STUDY / 1-3 CREDITS
Individual work on special topics in computer science. Prerequisite: Permission of instructor.
CSC 482 SPECIAL TOPICS IN COMPUTER SCIENCE / 3 CREDITS
Study of selected topics in computer science. Prerequisites will vary.
Lyon is more than just a college. It's a community distinguished by its academic curriculum, unique honor and social systems, and award-winning professors.