32 courses with the subject CSC, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
CSC 101Introduction to Digital Technologies3
The goal of this course is to help students gain a deeper appreciation of the capabilities and limitations of computing. Students will learn core computer science concepts and apply those using tools that they will use as future scientists, data analysts, and decision makers. By understanding software as more than a black box, students are better positioned to understand its value and its results, and make more intelligent decisions about when and how much to rely on software results. The course will use tools as Excel, Access, SQL, XML, and NetLogo to demonstrate principles.
This course is a study of the COBOL programming language, with application of its features for table handling, sorting, sequential and random access file handling and modular programming.
CSC 165Programming in Visual Basic With Visual Basics3
This class covers the basics of structured programming using Visual Basic to develop decision support systems or management science applications. The theory and practice of structured programming, logic, systems development are covered in a series of iterative hands-on assignments, which are designed based on practical decision support systems or management science applications. Students can expect to learn how to create and program advanced Excel applications or other equivalent applications. A term project involving the development and documentation of a Visual basic program is required.
CSC 170Introduction to Java Programming Programming4
This course will introduce you to programming and object oriented programming using Java. General programming topics include program design, testing strategies, and control structures such as conditionals, iteration. Object oriented topics include creating and using classes, inheritance and interfaces. Students will also learn about basic data structures such as arrays and strings. Students will solve programming problems in weekly lab sessions. Graduate students in the course will also be introduced to event-driven programming using a graphical user interface (GUI), recursion, and 2-dimensional arrays.
CSC 175Introduction to Algorithms and Program Design4
This course introduces students to programming with an emphasis on computational problem-solving. Topics include program design and testing strategies, programming language syntax and semantics, scalar data types and an introduction to data structures, control structures, iteration, recursion, file input/output, exceptions as well as an introduction to algorithm analysis. Students will use a high-level programming lanugage to develop programs and reinforce their understanding of topics.
This course studies data structures and algorithm analysis. Topics include data structures such as list, trees, stackes, queues, heaps, hash tables and graphs, and algorithms for searching and sorting, and simple graph algorithms. Students will also learn how to formally analyze algorithms. The emphasis will be on applying data structures to design and implement efficient algorithms. Students will use a high-level programming language to complete several intermediate sized programming projects to reinforce concepts.
This practicum will allow participants to learn and apply professional communication practices in order to explore and develop connections to professional industry experts. Students will prepare a plan for accessing discovered industry-related contacts, develop and practice interview techniques, create questions for informational interviews, reach out to potential contacts, and ultimately, pursue vocational goals by connecting with industry experts. Participants will practice for and execute phone, email, and written communication to establish professional, industry-related connections in order to complete informational interviews. From the resulting interviews, students will reflect, explore, prepare and pursue determined vocational goals. Throughout the six classes, industry experts will be invited as guests to offer professional acumen and insights for students pursuing opportunities to further connect to potential careers. Pass/fail only. Open to all majors.
Since the mid-20th Century, digital technology has repeatedly and thoroughly revolutionized human life. Indeed, it may be more accurate to see the digital as the ground for an overall change in the way that we know and experience reality. Topics covered in this course will include the origins of the digital revolution, media and information, artificial intelligence and its challenges, the simulation hypothesis, the digital and human values, and digital technology and the future of the planet.
This course deals with the general topic of object-oriented software design and introduces an object-oriented programming language. Design strategies (e.g., compositional) and concepts (e.g., functional independence) are discussed in the context of a software design model that contains four elements-architecture, data, interfaces, and components. Different object-oriented software design techniques (e.g., UML), software design metrics (e.g., coupling), and software quality assurance techniques (e.g., review) are discussed and applied to software designs. Also introduced are human-computer interaction, incremental software development using a personal software process, information models and database systems, principles of secure design, defensive programming, threats and attacks, and secure software engineering. Each student will produce design models and a prototype implementation.
This course covers the fundamental mathematical principles relevant to computer science, applied mathematics, and engineering. Topics included are functions, relations, sets, propositional logic, predicate logic, proof techniques, (with an emphasis on mathematical induction), basics of counting, and discrete probability.
This course provides an introduction to computer hardware with an emphasis on architecture and low-level programming. Topics include Boolean logic, design of combinational and sequential circuits, design of computer hardware components such as the CPU, machine level representation of data, and basic machine architecture. Assembly language is used to provide a programming experience where the code directly manipulates the CPU and memory.
This course will explore the mathematics of encryption and decryption from the first ciphers to encryption methods used in modern internet security. Students will also be expected to write their own encryption and decryption protocols in Python.
An introduction to computer techniques and simulations emphasizing problem solving in physics and the use of statistical, differential, integral, graphical, and numerical methods. Examples will be drawn from classical, statistical, and quantum mechanics and will include numerical integration, differentiation, and the solution of ordinary and partial differential equations, using programs such as Exel, Maple, Matlab, Mathematica etc.
This course covers operating system principles and design, and focuses on process management, memory management, and device and file management. Performance considerations, including both resource usage and speed, are emphasized. Students will develop design models that describe the functional components of operating systems, and will develop/modify software that simulates selected components of an operating system. (Offered every other spring.)
This course introduces the theory of programming languages and at least two computing paradigms-functional and logic. Theory topics include syntax, semantics, type systems, program representation, language translation and execution, and memory management. At least one functional and one logic language will be covered, giving students hands-on experience using these paradigms. Choice of programming language and its impact on security will also be discussed.
This course covers at least four major algorithm design techniques: greedy, divide-and-conquer, dynamic programming and network flow algorithms while emphasizing techniques for analyzing algorithms. Designing and analyzing algorithms for parallel machines will also be discussed. Additional topics include computational complexity focusing on NP-completeness, and some algorithmic techniques for dealing with intractable problems including approximation algorithms and local search.
A student who wishes to pursue an independent study project for academic credit must submit, prior to registration, a proposed plan of study that includes the topic to be studied and goal to be achieved, the methodology to be followed, schedule of supervision, end product, evaluation procedure and number of credits sought. The proposal must be approved by the supervising faculty member, the department chair and the academic dean. The proposal will be kept on file in the academic dean's office.
This course introduces the concepts and uses of artificial intelligence. Topics include heuristic search techniques, branch and bound, game-playing, neural nets, knowledge representation, logic and deduction, planning and an introduction to machine learning.
The development of algorithms for and error analysis of: solutions of equations, interpolation and approximation, numerical differentiation and integration, numerical solutions of differential equations. Also, knowledge of a high level programming language. (Offered every other fall.)
This course introduces the concepts and uses of computer graphics. Topics include roster and vector graphics, graphics processing unit, graphics programming libraries, and graphic capabilities found in game engines.
This course introduces the concepts and uses of wheeled robots. Topics include navigating a robot in a physical setting using various types of sensors (e.g., LiDAR, image, and infrared proximity) and an introduction to the different types and uses of robots.
This course introduces secured software development in two environments - web and mobile -with an emphasis on design, construction, and testing. Also covered are human-computer interaction, agile software development using a personal software process, principles of secure design, defensive programming, threats and attacks, and secure software engineering. Each student will produce design models, a robust client-side web or mobile application, and a basic server-side component used to illustrate simple client-server communication.
This course covers net centric computing by exploring client-server programming and the internet protocol stack, with emphasis on protocols in the application, transport, and network layers. This course introduces practical applications of graph theory, cryptography, and parallel computing. While the main focus is on client-server computing, we will also discuss various other distributed computing architectures, for example, peer-to-peer and multi-tiered architectures.
This course focuses on introductory project management processes, technology, and tools, utilizing the Project Management Institute's (PMI) Project Management Body of Knowledge (PMBOK) and the Software Engineering Institute's (SEI's) Capability Maturity Model Integration (CMMI) processes and nomenclature. Students examine the processes and theory of project management as well as industry case studies and will utilize project management software in support of their management activities. Guest speakers and field research provide students with access and information from industry and academia. Students are engaged in a semester-long project. Initially, they are required to identify the project scope and team charter for their project; subsequent assignments require them to prepare a business case, work breakdown structure, cost estimate, and final project documentation for their project. Prerequisite(s): MIS 201 or permission of department chair/program director.
While most computer science courses discuss problems which are able to be solved by computers, this course will look at both the capabilities and the limitations of computers. We start by analyzing simple models of computation, including finite state automata, and push down automata, and build up to Turing machines, which are powerful enough to model modern computers including multicore parallel machines. The course explores where the boundary lies between what is possible and impossible to compute on each model to draw conclusions about the nature of computation.
This course introduces students to the foundations of data management, with a central focus on SQL. Students will use SQL to define, query, and manipulate structured data in support of both enterprise information systems and artificial intelligence (AI) applications. The course emphasizes techniques to wrangle, transform, and validate data for use in analytics, generative AI, and machine learning workflows. Following a learn-by-example pedagogy, students will explore how to generate SQL-based answers to real business questions. Practice exercises, solution reviews, and assignments reinforce learning throughout the semester.
This course introduces students to the theory behind database technologies. Student's knowledge of SQL will be used to discuss relational algebra, relational calculus, normalization, and functional dependencies. Indexing structures(e.g., b-tree, hashing) and their associated performace characteristics and transaction processing (i.e., commits and concurrency issues) will also be discussed. A student must concurrently take CSC 480(MIS 480).
Participation in a field learning experience in some area of computer science. The student intern reports as required to a supervising faculty member, who will evaluate the internship and its relationship to the student's academic program. May be taken pass/fail only.
This course, exclusively for senior computer science majors, involves the completion and presentation of a research project in a computer science topic of interest to the student. This research is typically done by students individually and results in a paper, presentation materials, and optionally a prototype implementation.
This course is exclusively for senior computer science and software applications and systems development majors. It involves the completion and presentation of either a software engineering or a research project. For software engineering- a small team of students self-manage their project and produce software engineering artifacts, presentation materials, and a prototype implementation. A research project is typically done individually and results in a paper, presentation materials, and a prototype implementation or code to support the research agenda. Permission from the department chair required. An upper-class student who wishes to qualify for departmental honors must complete a project of significant scope, and their Major GPA and CSC 496 grade must sum to at least 6.5.
