Introduction to computer science with an emphasis on programming concepts, logic, and methodology: computer hardware and software, problem solving and algorithm development, flow of control, and modular design. Accelerated and more in-depth study of programming concepts than CSC 10. Intended for computer science and computer engineering majors who have little or no programming experience. Lecture two house, technical activity and laboratory, two hours. Not open to students who have received credit for CSC 10.

Preqrequisite: Math 11

Programming concepts using an object-oriented programming language. Introduction to methodologies for program design, development, testing, and documentation. Topics include program design, algorithm design, number systems, classes and objects, methods (functions), control structures, arrays, and interactive input/output. Lecture two hours, technical activity and laboratory two hours.

Prerequisite: CSC 10, or programming experience in a high-level programming language. Not currently enrolled in CSC 15.

Students concurrently enrolled in CSC 15 work through faculty-designed problem sets under the guidance of a trained student facilitator to improve their understanding of CSC 15 content. Pedagogical strategies that encourage active, engaged learning are employed to facilitate student success. Discussion, 2 hours.

Corequisite: CSC 15

Application of object-oriented techniques for systematic problem analysis and specification, design, coding, testing, and documentation. Semester-long project approach emphasizing larger programs. Managing program complexity using abstraction. Introduction to algorithm analysis and Big-O notation. Advanced language features. Basic sorting and searching algorithms. Recursion. Lecture two hours, technical activity and laboratory two hours.

Prerequisite: CSC 15.

Introduction to the nature and possible meanings of higher education, and the functions and resources of the University. Designed to help students develop and exercise fundamental academic success strategies and to improve their basic learning skills. Development of information competence and computer literacy. Students interact with fellow students and the seminar leader to build a community of academic and personal support.

Topics include: types, operators, control structures, input/output, arithmetic operations, the C library and preprocessor, functions and parameters, arrays, strings, pointers, and structures. Program design and style will be emphasized. Students will use a compiler.

Note: Students with significant programming experience should take CSC 60 rather than CSC 25. Lecture two hours, technical activity and laboratory two hours.

Introduction to the essential discrete structures used in Computer Science, with emphasis on their applications. Topics include: counting methods, elementary formal logic and set theory, recursive programming, digital logic and combinational circuits, real number representation, regular expressions, finite automata.

Prerequisite: MATH 26A or MATH 29; and CSC 20; CSC 20 may be taken concurrently.

Internal representation of numeric and non-numeric data, assembly level machine architecture, addressing modes, subroutine linkage, polled input/output, interrupts, high-level language interfacing, macros and pseudo operations. Lecture two hours, technical activity and laboratory two hours.

Prerequisite: CSC 15.

Features of the C language commonly used in systems programming, application to systems programming in a UNIX environment. Topics include C preprocessor macros, I/O, bit-manipulation facilities, timesharing system concepts, file permissions, shell script programming, make files and source code control, basic system calls like fork and exec, pointers and dynamic memory allocation, libraries and relocation and linking concepts including assembler handling of symbol tables. Prior knowledge of a C like programming language is presumed.

Prerequisite: CSC 20, CSC 35.

Techniques and processes to create 3D computer models and environments. Exercises, assignments and projects designed to build skill levels with 3D computer modeling tools. Demonstrations and workshops in the use of 3D computer modeling software. Critiques, discussion and presentations to develop students' conceptual grasp of 3D computer modeling and virtual reality environments. Example applications in art/new media and computer gaming.

Note: May be taken twice for credit.

Prerequisite: CSC 10 or ART 97 or equivalent. Cross-listed as ART 142.

Specification, implementation, and manipulation of abstract data types and their structures: balanced trees, priority queues, sets, hash tables, and graphs; recursion; searching and sorting algorithms; asymptotic analysis; NP completeness; fundamental graph algorithms including graph search, shortest path, and minimum spanning trees

Prerequisite: CSC 20, CSC 28; CSC 28 may be taken concurrently. Not currently enrolled in CSC 130.

Principles of Software Engineering covering the software development life cycle, including software requirements engineering (elicitation, modeling, analysis and specification), software design, software implementation and testing. Main topics include various software development process models, method and techniques for specifying requirements, architectural and detailed design specification, prototyping, top-down and bottom-up software implementation and testing. Topics also include project management, project documentation and the development of communication skills through written documentation and oral presentation.

Prerequisite: CSC 130; may be taken concurrently. Not currently enrolled in CSC 131.

Introduction to computer graphics and to advanced topics in object-oriented programming. Mobile application development; implementation of event-driven systems; advanced object-oriented concepts such as inheritance and polymorphism; implementation of software design patterns; graphical user interface development; fundamentals of 2D graphics systems. Application of these topics to mobile programming.

Prerequisite: CSC 130, CSC 131, not currently enrolled in CSC 133.

Entity-Relationship (ER) model; relational model; relational database design by ER-to-relational mapping; design of applications using database technology; SQL; schema definition, constraints, and queries; relational algebra; data normalization; access methods such as indexing and hash structures; introduction to transaction processing.

Prerequisite: CSC 130, and not currently enrolled in CSC 134

Introduction to limits of computation and techniques for specifying and processing formal languages. applications. Regular languages, regular expressions, finite automata, properties and limitations. Context-free languages, grammars, pushdown automata, properties and limitations. Applications in lexical and syntax analyses, including recursive-descent or table-driven parsing. Turing machines, halting problem, reductions. Introduction to functional programming and related programming language features.

Prerequisite: CSC 28, CSC 35, CSC 130, and not currently enrolled in CSC 135.

Introduction to computer organization and architecture. Combinational devices, sequential and synchronized circuits, memory organization, CPU architecture and organization, bus structures, input/output, interrupts, DMA, memory hierarchy, introduction to instruction level parallelism, multithreading, and multiprocessing.

Prerequisite: CSC 28, CSC 60, CSC 130, not currently enrolled in CSC 137.

Overview, structure, models, concepts, principles and protocols of computer networking. Network architecture, ISO/OSI reference model, TCP/IP protocol stack, layering. Protocol, encapsulation, socket. HTTP, FTP, SMTP, DNS, P2P, TCP, UDP. Multiplexing and demultiplexing, reliable data transfer, flow control, congestion control. Internet addressing, routing, forwarding, IP, ICMP. Error detection and correction, multiple access problem, LAN vs WAN, Ethernet, ARP, switching. Wireless standards. Network security, threats and attacks, defense and countermeasures.

Prerequisite: CSC 60, CSC 130. Not currently enrolled in CSC/CPE 138.

Cross Listed: CPE 138; only one may be counted for credit.

Concepts, principles, fundamental issues, organization and structure of contemporary operating systems. Topics include processes, threads, concurrency, parallelism on multi-processor and multi-core systems, CPU scheduling, inter- process communication and synchronization, deadlocks, real and virtual memory management, device management, file systems, security, and protection. Lecture three hours.

Prerequisite: CSC 60 and CSC 130 and either CSC 137 or CPE 185. Not currently enrolled in CSC 139.

Algorithm design using dynamic programming, randomization and greedy methods. Analysis using recurrence relations and amortization. String and network-flow algorithms. NP-completeness, reductions, and approximation algorithms. Review of divide-and-conquer design and asymptotic notation.

Prerequisite: CSC 130.

Design and performance issues of computers. Instruction set architecture, computer arithmetic, processor design, survey of contemporary architectures, interfacing I/O devices, hierarchal memory design and analysis, parallelism and multiprocessing, distributed systems, techniques for enhancing performance, and an introduction to EDA tools for design and verification of computers. Design and simulation of a microcomputer in an HDL.

Note: Open to students with full CSC or CPE major standing only.

Prerequisite: CSC 137 or CPE 166 and CPE 185.

Cross Listed: CPE 142; only one may be counted for credit.

Modeling and simulation techniques; Monte Carlo methods; queuing theory; model formulation, data collection and analysis, experimental design; model verification and validation.

Prerequisite: MATH 26B or MATH 31, STAT 50 or ENGR 115, and proficiency in a programming language.

Practical approach to compiler design and implementation. Organization of a compiler, algorithms for lexical, syntactic and semantic analysis, recursive descent and/or LALR parsing, organization of symbol tables, error detection and recovery, object code generation. Modular design will be emphasized.

Prerequisite: CSC 135

Introduction to design and analysis of cryptographic systems. Symmetric cryptography: Block ciphers and secure hash functions. Asymmetric cryptography: Key exchange and public-key systems. Authentication and encryption in an adversarial model. Simple cryptanalysis. Protocol design and analysis.

Prerequisite: CSC 60, CSC 130; and STAT 50 or ENGR 115

Application of operating system principles to the design and implementation of a multitasking operating system. Students will write an operating system for a computer platform. Topics include: scheduling of processes, control and allocation of computer resources, and user interfacing.

Prerequisite: CSC 139.

Cross Listed: CPE 159; only one may be counted for credit.

Parallel programming with emphasis on developing GPU computing applications. Topics include the GPU architecture and programming model, mapping computations to parallel hardware, parallel computation patterns, parallel programming optimization techniques, and application case studies.

Prerequisite: CSC 60, CSC 130, CSC 137; and either MATH 30 or MATH 26A.

Fundamental issues in the management and economics of a software engineering project in the context of the software development lifecycle. Topics include: techniques for project planning (budgeting and scheduling), controlling (including quality assurance and configuration management), organizing, staffing, and directing a software project (leadership and motivation); and contemporary issues in management.

Prerequisite: CSC 131.

Design principles and concepts for visualizing data; current visualization systems and languages, exploratory data analysis, interaction techniques, high-dimensional data, network visualization, and text visualization.

Prerequisite: CSC 130, CSC 134, and STAT 50 or ENGR 115.

Enhanced Entity-Relationship (EER) modeling; relational database design based on EER; SQL views; integrity constraints and triggers; stored procedures and functions; database programming techniques; query processing and optimization; transactions concurrency and recovery techniques; relational decomposition and normalization algorithms; database schema and data security.

Prerequisite: CSC 131, CSC 134.

Theory and implementation of techniques for data analytics and mining with emphasis on big data. Topics include data cleaning, exploratory data analysis, data visualization, feature engineering, classification, clustering, association rule mining, predictive model evaluation, parameter tuning, natural language processing, and selected advanced data mining topics. Design and implementation of systems using contemporary data analysis and mining programming libraries for automatic discovery of patterns and knowledge.

Prerequisite: CSC 134 and STAT 50 or ENGR 115.

Theory and implementation of a variety of techniques used to simulate intelligent behavior. Expert systems, fuzzy logic, neural networks, evolutionary computation, and two-player game-tree search will be covered in depth. Knowledge representation, pattern recognition, hybrid approaches, and handling uncertainty will also be discussed.

Prerequisite: MATH 26B or MATH 31; STAT 50 or ENGR 115; CSC 130 and CSC 135.

The first of a two-course sequence in which student teams undertake an industry-grade a project to develop and deliver a software product. Teams apply software engineering principles in the preparation of a software proposal, a project management plan, a software product backlog, and a high-fidelity prototype. All technical work is published using guidelines modeled after IEEE documentation standards. Oral and written reports are required. Lecture one hour, laboratory three hours..

Prerequisite: Senior status, WPJ score of 70+ or at least a C- in ENGL 109M/W, completed CSC 130, CSC 131, and four additional 3-unit upper-division CSC courses that fulfill the major requirements (excluding CSC 192-195, 198, and 199), not currently enrolled in CSC190.

Continuation of the team group project begun in CSC 190. Teams apply software engineering principles to the design, implementation, testing, and deployment of their software product. All technical work is published using guidelines modeled after IEEE documentation standards. Oral and written reports are required. Senior project is completed with the successful delivery, installation and demonstration of the software along with all approved documentation. Lecture one hour, laboratory three hours.

Prerequisite: CSC 190, not currently enrolled in CSC191.

Designed to help students learn more about the labor market and opportunities in the Computer Science field. Students will examine their interests, consider their goals, and learn how to conduct an effective proactive job search. Strategies for long term career growth will be identified.

Prerequisite: CSC 130 and three additional upper-division courses that fulfill major requirements with a C- grade or better (excluding CSC 190-195, CSC 198, and CSC 199).

Directed observations and work experience in computer science with firms in the industry or public agencies. Supervision is provided by the instructional staff and the cooperating agencies.

Note: Faculty approval required. May be repeated for credit.

Prerequisite: Instructor permission.

Supervised employment in a professional engineering or computer science environment. Placement arranged through the Career Center.

Note: Requires satisfactory completion of the work assignment and a written report.

Prerequisite: Instructor permission.

Introduction to the World Wide Web; relationship between clients and servers, how web pages are created using several technologies: HyperText Markup Language (HTML), Cascading Style Sheets (CSS), JavaScript, Asynchronous JavaScript and XML (Ajax), server-side web services, integrate web applications with databases.

Note: Offered Online

Prerequisites: CSC 130

Individual projects or directed reading in specified topics in computer science.

Note: Open only to students who appear competent to carry on individual work; approval of faculty supervisor and advisor required. May be repeated for credit.

Immersion in the discourse of Computer Science: genres, literacies, stylistic conventions. Writing process, academic writing in various academic genres, revising, and editing. Tools for technical writing. Ethical issues in connection with scientific writing.

Prerequisite: Graduate standing in Computer Science or Software Engineering

Notations for the specification of programming language syntax and semantics; attribute, translational, operational, axiomatic, algebraic, denotational, and action semantics. Applications of programming language syntax and programming language semantics. Use of meta languages to generate executable language definitions for language implementation, program transformation, program property analysis, and rapid software prototyping. Principles of logic, functional, and object-oriented programming languages.

Prerequisite: Fully classified graduate status in Computer Science or Software Engineering.

Overview of computer systems organization and design. Concepts of instruction set architecture, interactions of hardware-software interface, principles of performance analysis, processor design, instruction level parallelism, survey of contemporary architectures, hierarchical memory design and analysis, interfacing I/O devices, parallel processing and multiprocessing, and introduction to EDA tools and methodologies for computer systems design and verification.

Prerequisite: Fully classified graduate status in Computer Science, Software Engineering or Computer Engineering.

Design and analysis of algorithms. Classical design paradigms including greedy, divide-and-conquer, dynamic programming, and backtracking algorithmic methods. Alternative paradigms of computing including parallel and numerical approaches. Theoretical limits of computation. Selected additional topics such as genetic, approximation, and probabilistic algorithms.

Prerequisite: Fully classified graduate status in Computer Science or Software Engineering.

Research methodology, problem formulation, and problem solving. Orientation to the requirements for Master's Thesis or Project. Presentations on various research topics.

Prerequisite: Enrolled in at least 3 units of 200-level courses in Computer Science.

Verification and validation (V & V) techniques to identify and resolve software problems and high-risk issues early in the software lifecycle. Application of V & V to all phases of the lifecycle process. Includes planning and reporting on the V & V effort. Topics also include software quality assurance and software testing.

Prerequisite: Fully classified graduate status in Computer Science or Software Engineering; or Computer Engineering and CSC 131.

SQL views, integrity constraints and triggers, stored procedures and functions. Advanced topics in database system design: an algebra for queries, query processing algorithms, query compiler, query optimization, transaction management, recovery, concurrency control. Special topics on data management.

Prerequisite: Fully classified graduate status in Computer Science or Software Engineering

Directed observations and work experience in computer science with firms in the industry or public agencies. Supervision is provided by the instructional staff and the cooperating agencies.

Note: Faculty approval required. May be repeated for credit.

Any properly qualified student who wishes to pursue a problem of his own choice may do so if the proposed subject is acceptable to the member of the staff with whom he/she works and to his/her advisor.

Note: May be repeated for credit.

Completion of a project approved for the Master's degree.

Prerequisite: CSC 209; advanced to candidacy.