| CS 1309 | Computer Science I |
CS 1309 (COSC 1336) Computer Science I (2-2). This course is a disciplined approach to problem-solving with structured techniques and representation of algorithms using pseudo-code and graphical tools. There will be discussions of methods for testing evaluation and documentation. Topics include data types; control structures; functions structures arrays and file input/output; the mechanics of running testing and debugging programs; introduction to programming; and introduction to the historical and social context of computing. Prerequisite: Students may concurrently enroll in Math 1314. |
| CS 1309 | Computer Science I Lab |
CS 1309 (COSC 1336) Computer Science I (2-2). This course is a disciplined approach to problem-solving with structured techniques and representation of algorithms using pseudo-code and graphical tools. There will be discussions of methods for testing evaluation and documentation. Topics include data types; control structures; functions structures arrays and file input/output; the mechanics of running testing and debugging programs; introduction to programming; and introduction to the historical and social context of computing. Prerequisite: Students may concurrently enroll in Math 1314. |
| CS 1320 | Computer Science II |
CS 1320 (COSC 1337) Computer Science II (2-2). Students are introduced to the fundamental concepts of object-oriented programming including concepts and techniques of object-oriented programming. This course introduces students to objects classes constructors methods object inheritance and polymorphism from a practical and hands-on approach. Prerequisite: CS 1309. |
| CS 1320 | Computer Science II Lab |
CS 1320 (COSC 1337) Computer Science II (2-2). Students are introduced to the fundamental concepts of object-oriented programming including concepts and techniques of object-oriented programming. This course introduces students to objects classes constructors methods object inheritance and polymorphism from a practical and hands-on approach. Prerequisite: CS 1309. |
| CS 2315 | Data Structures |
CS 2315 (COSC 2336) Data Structures (2-2). This course is a further application of programming techniques. Topics include Abstract Data Types (ADTs) linear data structures (arrays stacks queues and lists) and non-linear data structures including graphs trees heaps has tables dictionaries and maps. Students will also be introduced to recursive algorithms and graph traversal techniques. Prerequisite: CS 1320. |
| CS 2315 | Data Structures Lab |
CS 2315 (COSC 2336) Data Structures (2-2). This course is a further application of programming techniques. Topics include Abstract Data Types (ADTs) linear data structures (arrays stacks queues and lists) and non-linear data structures including graphs trees heaps has tables dictionaries and maps. Students will also be introduced to recursive algorithms and graph traversal techniques. Prerequisite: CS 1320. |
| CS 3306 | ST: Python Programming |
CS 3306 Special Topics (3-0). Discussion of selected topics in computer science suitably for upper division students. The course may be repeated with different topics. Offered when needed. Prerequisite: Permission of the instructor. |
| CS 3310 | Computer Communications |
CS 3310 Computer Communications (3-0). Course covers network systems topology media the theoretical network real-world networks and configuration of networks. Offered fall even years. Prerequisite: CS 1320 |
| CS 3320 | Object-Oriented Program |
|
| CS 3331 | Advanced Database Systems |
CS 3331 Advanced Database Systems (3-0). Study of the concepts of database management systems. Topics include file structures access methods database modeling and design structured query language (SQL) and high level language interfaces to database systems. Offered spring even years. Prerequisite: CS 2315 |
| CS 4320 | Software Engineering |
CS 4320 Software Engineering (2-2). This course emphasizes the software life cycle and the tools and models that have been developed to build large systems. Planning estimating and managing project development are discussed. Both the structured and the object-oriented paradigms will be covered. Offered fall even years. Prerequisite: CS 2315 or permission of the instructor. |
| CS 4320 | Software Engineering Lab |
CS 4320 Software Engineering (2-2). This course emphasizes the software life cycle and the tools and models that have been developed to build large systems. Planning estimating and managing project development are discussed. Both the structured and the object-oriented paradigms will be covered. Offered fall even years. Prerequisite: CS 2315 or permission of the instructor. |
| CS 4340 | Computer Architecture |
CS 4340 Computer Architecture (2-2). Topics include combinational logic circuits and design sequential circuits registers and counters memory and programmable logic devices register transfers and data paths and sequencing and control. Offered spring odd years. Prerequisites: CS 2315 |
| CS 4340 | Computer Architecture Lab |
CS 4340 Computer Architecture (2-2). Topics include combinational logic circuits and design sequential circuits registers and counters memory and programmable logic devices register transfers and data paths and sequencing and control. Offered spring odd years. Prerequisites: CS 2315 |
| CSA 1309 | Computer Science I |
CSA 1309 (COSC 1336) Computer Science I (2-2). This course is a disciplined approach to problem-solving with structured techniques and representation of algorithms using pseudo-code and graphical tools. There will be discussions of methods for testing, evaluation, and documentation. Topics include data types; control structures; functions, structures, arrays, and file input/output; the mechanics of running, testing and debugging programs; introduction to programming; and introduction to the historical and social context of computing. Prerequisite: Students may concurrently enroll in Math 1314. Equivalent courses: CS 1320 (through Summer 2014), CS 1309 (through Summer 2023). |
| CSA 1320 | Computer Science II |
CSA 1320 (COSC 1337) Computer Science II (2-2). Students are introduced to the fundamental concepts of object-oriented programming, including concepts and techniques of object-oriented programming. This course introduces students to objects, classes, constructors, methods, object inheritance, and polymorphism from a practical and hands-on approach. Prerequisite: CSA 1309. Equivalent course: CS 1320 (through Summer 2023), CS 1321 (through Summer 2014). |
| CSA 1320 | Computer Science II Lab |
CSA 1320 (COSC 1337) Computer Science II (2-2). Students are introduced to the fundamental concepts of object-oriented programming, including concepts and techniques of object-oriented programming. This course introduces students to objects, classes, constructors, methods, object inheritance, and polymorphism from a practical and hands-on approach. Prerequisite: CSA 1309. Equivalent course: CS 1320 (through Summer 2023), CS 1321 (through Summer 2014). |
| CSA 2326 | Basic Television Technology |
CSA 2326 Basic Television Technology (3-0). Introductory course dedicated to basic television principles as related to game technology and communication design. Including, but not limited to camera, sound, lights, story board, and basic production elements to be used with green screen technology. Equivalent course: CSAT 2306 (through Summer 2023) |
| CSA 2327 | Introduction to Audio |
CSA 2327 Introduction to Audio (2-2). Students learn the fundamentals of the physics of sound and basic recording and editing techniques. Equivalent course: CSAT 2307 (through Summer 2023) |
| CSA 3310 | Computer Communications |
CSA 3310 Computer Communications (3-0). Course covers network systems, topology, media, the theoretical network, real-world networks, and configuration of networks. Offered fall even years. Prerequisite: CS or CSA 1320. Equivalent course: CS 3310 (through Summer 2023), CSR 3310. |
| CSA 3316 | Operating Systems |
CSA 3316 Operating Systems (3-0). This course examines the important problems in operating system design and implementation. Operating systems provide an established, convenient, and efficient interface between user programs and the bare hardware of the computer on which they run. The operating system is responsible for sharing resources (e.g. disks, networks, and processors), providing common services needed by many different programs (e.g. file services, the ability to start or stop processes, and access to the printer), and protecting individual programs from interfering with one another. Prerequisites: CS or CSA 2315. Equivalent course: CS 3316 (through Summer 2023), CSR 3316. |
| CSA 4311 | Senior Capstone II |
CSA 4311 Senior Capstone II (3-0). Continuation of Senior Capstone I Students complete a collaborative programming project and present a working product and business plan. Prerequisites: CSA 4310. Equivalent course: CS 4311 (through Summer 2023), CSR 4311. |
| CSA 4324 | Arts Technology Capstone I |
CSA 4324 Arts Technology Capstone I (3-0). The Senior Capstone is the culminating course in the CSAT concentrations sequence. Each capstone is implemented by students with the help and encouragement of an academic advisor. Capstone experiences allow each student to demonstrate the capacity to bring information, skills, and ideas acquired from the major to bear on one significant project. It is aimed at providing students with the opportunity to integrate the knowledge and skills they have acquired as Computer Science majors as well as provide experiences for students to exhibit competent Computer Science skills within their concentration learned during their program of study in order to prepare for a career in Computer Science Applied Technology. Equivalent course: CSAT 4310 (through Summer 2023), CSR 4324. |
| CSA 4372 | Intrusion Detect/Prevent |
CSA 4372 Intrusion Detection/ Prevention Systems (3-0). This course provides students with knowledge and skills related to detecting and analyzing vulnerabilities and threats and taking steps to mitigate associated risks. It addresses deep packet inspection, log file analysis, cross log comparison and analysis, host or network based intrusion detection, honeynets and honeypots. Prerequisite: CSA 3310. Equivalent course: CSST 4372 (through Summer 2023), CSR 4372. |
| CSAT 2307 | Introduction to Audio |
CSAT 2307 Introduction to Audio (2-2). Students learn the fundamentals of the physics of sound and basic recording and editing techniques. |
| CSAT 2308 | Web Page Development |
CSAT 2308 Web Page Development (3-0). Layout and design of web pages including structuring the page with proper alignment consistency and site navigation; visual appeal of color and concepts for choosing color schemes that best represent the purpose of the website; and consideration of copyright law as applied to web page technology. |
| CSAT 2309 | Intro To Game Design |
CSAT 2309 Introduction to Game Design (3-0). Students will study a range of game genres in order to understand the fundamentals of game design and what makes a game interesting addictive and fun. Game ideas will be developed using paper prototyping and later in the course digitally prototyped using game-creation software. |
| CSAT 2310 | Intro to Digital Imaging |
CSAT 2310 Introduction to Digital Imaging (1-2). This course covers digital imaging techniques including Photoshop and Illustrator. The course will focus on digital image editing digital painting and illustration. |
| CSAT 2315 | Intro To Game Programming |
CSAT 2315 Introduction to Game Programming (3-0). A course designed to introduce students to programming languages and techniques used in the computer gaming industry. This course serves as the foundation for all other courses in the Gaming Technology concentration. Prerequisite: CS 1320 |
| CSAT 3303 | Individual Studies: Motion Cap |
CSAT 3303 Individual Studies (3-0). In this course students complete individual work towards the fulfillment of their degree. Prerequisite: Consent of instructor. |
| CSAT 3340 | Advanced Animation |
CSAT 3340 Advanced Animation (2-2. Further study of frame-by frame animation continue to develop their animation skilled through examples and projects. |
| CSAT 3350 | Adv Two-Dimensional Imaging |
CSAT 3350 Advanced Two-Dimensional Imaging (3-0). A course in advanced digital imaging including creation of original digital matte paintings illustration and photo manipulation for print gaming and art applications. Students will work in a variety of industry standard programs including Photoshop and Illustrator. Prerequisite: CSAT 2310 |
| CSAT 3360 | User Interface Prog |
CSAT 3360 User Interface Programming (3-0). Programming related to interactive displays interfaces and environments for controlling a variety of computer applications including games and communication and other programs including human- computer interface applications. Prerequisite: CS 2315 |
| CSAT 3380 | Motion Capture |
CSAT 3380 Motion Capture (2-2). Covers the basics of directing and capturing 3D data for use in character design and movement in videogames. |
| CSAT 4301 | Voice Over Techniques |
CSAT 4301 Voice-Over Techniques (2-2). An advanced approach to vocal production and voice-over performance utilizing audio recording equipment. Prerequisite: THEA 1351 |
| CSAT 4302 | Advanced Maya |
CSAT 4302 Advanced Maya (3-0). This course is the further study of Maya to create 3-dimensional graphics. Students will refine the creation lightning texturing and animation of their 3-d objects. Prerequisite: CSAT 3330 |
| CSAT 4310 | Senior Capstone |
CSAT 4310 Senior Capstone (3-0). The Senior Capstone is the culminating course in the CSAT concentrations sequence. Each capstone is implemented by students with the help and encouragement of an academic advisor. Capstone experiences allow each student to demonstrate the capacity to bring information skills and ideas acquired from the major to bear on one significant project. It is aimed at providing students with the opportunity to integrate the knowledge and skills they have acquired as Computer Science majors as well as provide experiences for students to exhibit competent Computer Science skills within their concentration learned during their program of study in order to prepare for a career in Computer Science Applied Technology. |
| CSAT 4311 | Capstone II |
CSAT 4311 Capstone II (2-2). Continuation of Senior Capstone. Students complete a collaborative video game project and present a working product and business plan. Prerequisite: CSAT 4310 |
| CSST 1370 | Cyber Ethics |
CSST 1370 Cyber Ethics (3-0). This course focuses on computer science programming ethics and management ethics with consideration for others. Students are expected to meet the learning objective of the course through a wide range of activities to include reading viewing researching programing and completing lab access assignments as well as participation in collaborative projects and a community interaction project. |
| CSST 3322 | Secure Program Practices |
CSST 3322 Secure Programing Practices (3-0). This course provides students with an understanding of the characteristics of secure programs and the ability to implement programs that are free from vulnerabilities. It addresses robust programming defensive programming and programming flaws. Prerequisite CS 1320 (may be concurrent). |
| CSST 3382 | Cyber Sec Plan & Mgmt |
CSST 3382 Cyber Security Planning and Management (3-0). This course provides students with the ability to develop plans and processes for a holistic approach to cyber security for an organization. It addresses CBK operational and tactical strategic plans and management and making cyber security a strategy. Prerequisite: CSST 2372 |
| CSST 4372 | Intrusion Detect/Prevent |
CSST 4372 Intrusion Detection/ Prevention Systems (3-0). This course provides students with knowledge and skills related to detecting and analyzing vulnerabilities and threats and taking steps to mitigate associated risks. It addresses deep packet inspection log file analysis cross log comparison and analysis host or network based intrusion detection honeynets and honeypots. Prerequisite: CS3310 |
| CSST 4374 | Network Defense |
CSST 4374 Network Defense (3-0.) This course provides students with knowledge of the methods of analyzing and mitigating threats coming from inside or outside the network. It addresses network protocols security devices security services configuration and packet capture and analysis. Prerequisite: CSST 3310 |
| MATH 1314 | College Algebra |
MATH 1314 (MATH 1314) College Algebra (3-0). In-depth study and applications of polynomial rational radical exponential and logarithmic functions and systems of equations using matrices. Additional topics such as sequences series probability and conics may be included. |
| MATH 1316 | Plane Trigonometry |
MATH 1316 (MATH 1316) Plane Trigonometry (3-0). In-depth study and application of trigonometry including definitions identities inverse functions solutions of equations graphing and solving triangles. Additional topics such as vectors polar coordinates and parametric equations may be included. Prerequisite: Math 1314 or consent of instructor. |
| MATH 1332 | Contemporary Mathematics |
MATH 1332 (MATH 1332) Contemporary Mathematics (3-0). This course is an introduction to a selection of college-level math topics. This course typically covers topics selected from the following: problem-solving counting the real number system sets geometry solutions of linear and quadratic equations elementary probability financial math the mathematics of voting and fair division. |
| MATH 1342 | Elementary Stat Methods |
MATH 1342 (MATH 1342) Elementary Statistical Methods (3-0). Collection analysis presentation and interpretation of data and probability. Analysis includes descriptive statistics correlation and regression confidence intervals and hypothesis-testing. Use of appropriate technology is recommended. |
| MATH 2310 | Foundations Elementary Math I |
MATH 2310 Foundations of Elementary Mathematics I (3-0). First course in required mathematics content sequence for preservice elementary and middle school teachers. Topics include problem-solving techniques reasoning study of sets systems of numeration natural numbers integers number theory and rational numbers. Emphasis on problem-solving as a pedagogical tool with integration of manipulative-based explorations. Offered fall. Prerequisites: Satisfactory completion Math 1315 or Math 1342 with a grade of C or better; or equivalent advanced credit placement. |
| MATH 2311 | Foundations Elementary Math II |
MATH 2311 Foundations of Elementary Mathematics II (3-0). Second course in the mathematics content sequence for preservice elementary and middle school teachers. Topics include: fraction operations decimals real numbers ratio and proportion percent basic notions of geometry measurement and basic probability and statistics. Offered spring. Prerequisites: Satisfactory completion of Math 2310 with a grade of C or better. |
| MATH 2318 | Linear Algebra |
MATH 2318 Linear Algebra (3-0). Systems of linear equations, matrices, determinants, vector spaces, quadratic forms, linear transformations, eigenvalues and eigenvectors, and applications in science and engineering. Prerequisite: MATH 1316 or MATH 2413. |
| MATH 2413 | Calculus I |
Topics include limits and continuity, the derivative, techniques for differentiation of algebraic, logarithmic, exponential and trigonometric functions applications of the derivative and anti-differentiation. Offered fall. Prerequisite: Math 1314 and Math 1316 or consent of instructor. |
| MATH 2413 | Calculus I Lab |
Topics include limits and continuity, the derivative, techniques for differentiation of algebraic, logarithmic, exponential and trigonometric functions applications of the derivative and anti-differentiation. Offered fall. Prerequisite: Math 1314 and Math 1316 or consent of instructor. |
| MATH 2414 | Calculus II |
MATH 2414 (MATH 2414) Calculus II (3-2). Topics include the definite integral and its applications techniques of integration improper integrals Taylor's formula and infinite series. Offered spring. Prerequisite: Math 2413 |
| MATH 2414 | Calculus II L01 |
MATH 2414 (MATH 2414) Calculus II (3-2). Topics include the definite integral and its applications techniques of integration improper integrals Taylor's formula and infinite series. Offered spring. Prerequisite: Math 2413 |
| MATH 2414 | Calculus II Lab |
MATH 2414 (MATH 2414) Calculus II (3-2). Topics include the definite integral and its applications techniques of integration improper integrals Taylor's formula and infinite series. Offered spring. Prerequisite: Math 2413 |
| MATH 3301 | Geometry |
MATH 3301 Geometry (3-0). Modern formal development of Euclidean geometry with congruences and constructions. Introduction to other geometries as time permits. Prerequisite: MATH 2311/MTH 3309, MATH 2413, or permission of instructor. |
| MATH 3305 | History of Mathematics |
MATH 3305 History of Mathematics (3-0). Biographies of mathematicians along with an exploration of the chronological development of important ideas in mathematics. Prerequisite: MATH 2413. |
| MATH 3305 | History of Mathematics |
MATH 3305 History of Mathematics (3-0). Biographies of mathematicians along with an exploration of the chronological development of important ideas in mathematics. Prerequisite: MATH 2413. Equivalent courses: MTH 3305 |
| MATH 3306 | Math History |
MATH 3306 Special Topics (3-0). Discussion of selected topics in mathematics. Course may be repeated as topics vary. Prerequisite: permission of instructor. |
| MATH 3306 | Topics in Algebra and Geometry |
MATH 3306 Special Topics (3-0). Discussion of selected topics in mathematics. Course may be repeated as topics vary. Prerequisite: permission of instructor. |
| MATH 3307 | Differential Equations |
MATH 3307 Differential Equations (3-0). First-order differential equations, linear differential equations of higher order, systems of linear differential equations, and applications. Prerequisite: MATH 2414. |
| MATH 3307 | Differential Equations |
MATH 3307 Differential Equations (3-0). First-order differential equations, linear differential equations of higher order, systems of linear differential equations, and applications. Prerequisite: MATH 2414. Equivalent courses: MTH 3307 |
| MATH 3330 | Number Theory & Cryptography |
MATH 3330 Number Theory and Cryptography (3-0). This is an introductory course in basic number theory via its important applications in modern cryptography. Topics include divisibility and the Euclidean algorithm congruences finite fields quadratic residues enciphering matrices public key cryptography pseudoprimes and factoring techniques. Offered fall or spring when needed. Prerequisite: Math 2414. |
| MATH 3340 | Foundations Of Higher Math |
MATH 3340 Foundations of Higher Mathematics (3-0). Organization and structure of mathematical thought. Writing and evaluating proofs. Topics include propositional logic, set theory, functions, sequences, relations, number theory, and graph theory. Prerequisite: MATH 2311 / MTH 3309 or MATH 2414. |
| MATH 3415 | Calculus III |
MATH 3415 Calculus III (3-2). Calculus of functions of several variables, including partial derivatives, multiple integrals, and vector calculus. Prerequisite: MATH 2414 with a C or better. |
| MATH 3415 | Calculus III - Lab |
MATH 3415 Calculus III (3-2). Calculus of functions of several variables, including partial derivatives, multiple integrals, and vector calculus. Prerequisite: MATH 2414 with a C or better. |
| MATH 3415 | Calculus III Lab |
MATH 3415 Calculus III (3-2). Calculus of functions of several variables, including partial derivatives, multiple integrals, and vector calculus. Prerequisite: MATH 2414 with a C or better. |
| MATH 4301 | Modern Abstract Algebra |
MATH 4301 Modern Abstract Algebra I (3-0). Congruence classes, group theory and its applications to number theory and geometry, introduction to rings, integral domains, and fields. Prerequisite: MATH 2318 and MATH 3301 / MTH 3301 or permission of instructor. |
| MATH 4303 | IS: Modern Algebra |
MATH 4303 Individual Studies (3-0). Independent study of selected topics in mathematics. This course may be repeated during different semesters. Prerequisite: Permission of instructor. |
| MATH 4320 | Real Analysis |
MATH 4320 Real Analysis (3-0). Topology of the real line, sequences, series, continuity, and differentiation. Prerequisite: MATH 2414. |
| MATH 4360 | Complex Variables I |
MATH 4360 Complex Variables I (3-0). An introductory course covering functions of one complex variable. Topics will include: the algebra of complex numbers geometry in the complex plane polar representation of complex numbers analytic functions mappings continuity differentiability Cauchy-Riemann equations elementary functions of a complex variable contour integrals and the Cauchy integral formula. Rotated with 4320 and 4330. Prerequisite: Math 2415 |
| MATH 4390 | Senior Project |
MATH 4390 Senior Project (3-0). Directed individual studies in a mathematical topic of interest to the student. Emphasis on written and oral communication. Prerequisite: Completion of any 4000-level course with a C or better or permission of instructor. |
| MATH 4390 | Senior Project: McNair |
MATH 4390 Senior Project (3-0). Directed individual studies in a mathematical topic of interest to the student. Emphasis on written and oral communication. Prerequisite: Completion of any 4000-level course with a C or better or permission of instructor. |
| MATH 5301 | Number Theory and Crypt |
MATH 5301 Special Topics in Mathematics (3-0). Selected topics in theoretical and applied mathematics. The course may be repeated for different topics. Offered when needed. Prerequisites: Permission of instructor. Equivalent courses: MTH 5301 |
| MATH 5301 | Real Analysis |
MATH 5301 Special Topics in Mathematics (3-0). Selected topics in theoretical and applied mathematics. The course may be repeated for different topics. Offered when needed. Prerequisites: Permission of instructor. |
| MATH 5301 | ST in Mathematics: Algebra II |
MATH 5301 Special Topics in Mathematics (3-0). Selected topics in theoretical and applied mathematics. The course may be repeated for different topics. Offered when needed. Prerequisites: Permission of instructor. |
| MATH 5301 | ST in Mathematics: Analysis II |
MATH 5301 Special Topics in Mathematics (3-0). Selected topics in theoretical and applied mathematics. The course may be repeated for different topics. Offered when needed. Prerequisites: Permission of instructor. |
