Introduction to systematic computer problem-solving and programming for a variety of applications. Open to all majors. Carolina Core ARP.

Continuation of CSCE 145. Rigorous development of algorithms and computer programs; elementary data structures. Three lecture hours and two laboratory hours per week. Open to all majors.

Introduction to the theory and practice of computer security, including security policies, authentification, digital certificates, firewalls, malicious code, legal and ethical issues, and incident handling. Not auditable.

Introduction to computer applications in business. Programming exercises in COBOL.

The Unix programming environment: I/O programming, Unix processes, fork, exec, pipes and signals, and tools. Open to all majors.

Number representation, data formats, CPU and memory organization, assembly language, I/O and peripherals, computer networks.

Computer architecture, components. and organization; memory addressing; Input/Output; instruction sets; interrupts; assembly-language programming.

Fundamentals of software design and development; software implementation strategies; object-oriented design techniques; ethics in software development.

Design and control of robots. Interactions between robots, sensing, actuation, and computation.

Operating system structure and function; process implementation, scheduling, and synchronization; memory management; security; naming protection; resource allocation; network file systems.

System-level modeling and evaluation of computer systems: requirements elicitation and specification, architectural design, reliability and performance evaluation, Markov modeling, life-cycle cost analysis, project management.

Techniques for representing and processing information, including the use of lists, trees, and graphs; analysis of algorithms; sorting, searching, and hashing techniques.

Professional issues in the information technology professions; history and social context of computing; professional responsibilities; privacy; intellectual property; risks and liabilities of computer-based systems. Carolina Core VSR.

Concepts and components of computer networks and the Internet; network applications; network protocol stack.

Continuation of CSCE 490. Computer system implementation, testing, verification and validation of results. Written reports and oral presentations in a technical setting.

Concepts and properties of algorithms; programming exercises with emphasis on good programming habits. Credit may not be received for both CSCE 500 and CSCE 145. Open to all majors. May not be used for major credit by computer science and engineering majors.

Measuring, modeling, analyzing, and predicting performance of computer systems and networks; bottleneck analysis; Markovian queuing systems and networks; use of operational and probabilistic models.

Computer networks and communication protocols; socket programming; interprocess communication; development of network software; case studies.

Methodical approaches for collecting and preserving evidence of computer crimes. Foundational concepts such as file system structures, MAC times, and network protocols; tools for extracting evidence; general legal issues.

Database management systems; database design and implementation; security, integrity, and privacy.

Cooperative information systems and service-oriented computing. Techniques for achieving coordinated behavior among a decentralized group of information system components. Distributed databases, multiagent systems, conceptual modeling, Web services, and applications.

Development of mobile applications, including user interface design for mobile, local and cloud data storage techniques, and application architectures.

Construction of software systems resistant to vulnerabilities and attacks. Cryptographic tools. Language, operating system, and network security. Case studies. Development of best practices through programming assignments.

Design and development of computer games, with emphasis on the technologies used. Hands-on development of computer games.

Design of secret codes for secure communication, including encryption and integrity verification: ciphers, cryptographic hashing, and public key cryptosystems such as RSA. Mathematical principles underlying encryption. Code-breaking techniques. Cryptographic protocols.

Computer simulation of real systems; principles of system organization; random number generation; programming exercises in a simulation language.

Graphics hardware; graphics primitives; two-dimensional and three-dimensional viewing; basic modeling.

Architecture and interconnection of parallel computers; parallel programming models and applications; issues in high-performance computing; programming of parallel computers.

Interdisciplinary approach to interaction design, user-centered design, human abilities, survey development, experimental study methodology, heuristic evaluations, usability testing, universal design, and accessibility.

Text and natural language processing; formal models and data structures appropriate for text processing; selected topics in computational linguistics, stylistics, and content analysis.

Normative approaches to uncertainty in artificial intelligence. Probabilistic and causal modeling with Bayesian networks and influence diagrams. Applications in decision analysis and support. Algorithms for probability update in graphical models.

Reading and research on selected topics in information technology. Course content varies and will be announced in the schedule of courses by suffix and title. May be repeated for credit as topics vary.

VLSI design process models, introduction to EDA tools, HDL modeling and simulation, logic synthesis and simulation, benchmark design projects

Operating system organization and interactive processing systems, multiprogramming systems, process management, task scheduling, resource control, deadlocks.

Analysis of security threats in TCP/IP networks. Design of safeguards. Coverage of security threats at each of the OSI layers. Application of cryptographic protocols for secure communication across a network.

Evaluation of computer system performance and reliability using reliability block diagrams, fault trees, reliability graphics, queuing networks, Markov models, and Markov reward models.

This course focuses on the security and privacy issues associated with wireless networks. Various attacks against wireless networks and their defense strategies will be analyzed. Students are able to embark in research of wireless network security.

Database design methodologies and tools; data models; implementation languages; user interfaces.

Current trends and challenges in information warfare. High-level analysis of information warfare threats, like cyber terrorism, espionage, Internet fraud, intelligence activities, cyber ethics, and law enforcement.

Current practices and research in software development, requirements definition, design, program testing and reliability, maintenance, and management.

Structural organizations for software systems as collections of interconnected components: formal models and languages; design tools and guidelines.

Fundamentals of object-oriented technology; object modeling of structure, function, and time-dependent behavior; system analysis and design.

Structural and functional techniques for testing software; code inspection, peer review, test verification and validation; statistical testing methods; preventing and detecting errors; testing metrics; test plans; formal methods of testing. Not auditable.

Formal models of computation, including finite state automata, Turing machines, recursive functions, formal grammars, and abstract complexity theory.

Numerical solution of equations and systems of linear equations, polynomial approximation, difference calculus, solution of ordinary and partial differential equations, least squares and sets of orthogonal polynomials, Gaussian quadrature.

Concepts and techniques for digital image processing; emphasis on low-level processes that analyze discrete images at the pixel level.

Visualization techniques for scientific computing; interactive steering of calculations; animation and rendering techniques for multivariate data analysis.

Bayesian classifiers; optimal risk schemes; error rates; numerical methods; implementation; architectures.

Computational models for the analysis and synthesis of natural language; representations for syntax and semantics; applications to text-to-speech conversion, speech recognition, and language understanding.

Design and operation of robot systems; dynamics, control, and motion trajectories of manipulators; visual, auditory, and tactile sensing systems; planning and learning.

Expert system domains, knowledge representation techniques, inference engines, and knowledge acquisition methods.

Mathematical foundations of biological and artificial neural networks, supervised and unsupervised systems, applications.

Reading and research on selected topics in information technology. Course content varies and will be announced in the schedule of courses by suffix and title. May be repeated for credit as topics vary.

Work. Written report required. Not auditable. Pass-Fail Grading.

Individual research to be arranged with the instructor.

Study security threats and prevention/detection/response techniques on the Internet, including hackers, masqueraders, information spoofing, sniffing, and distribution of damaging software. Security analysis of Web applications.

Contemporary computer communication protocols and network architectures.

Custom design methodology design rules, stick notation, logic synthesis, and circuit layout; symbolic layout languages; introduction to CAD tools.

Information processing techniques and mathematical tools to assemble, access, and analyze data for decision support and knowledge discovery.

Strategies for achieving coordinated behavior among a heterogeneous group of information system components; world-wide information networks and applications in health care, logistics, telecommunications, and manufacturing automation.

Definitions of algorithms and formal models of computation; concepts of space and time; synthesis and analysis of algorithms for sorting, search graphs, set manipulation and pattern matching; NP-complete, and intractable problem.

Input and display devices, data structures, architectures, primitives, and geometrical transformations appropriate to computer graphics, parametric surfaces.

Feature nomination, selection, extraction, and evaluation; deterministic, stochastic, and fuzzy models for classifier design; parameter estimation; error rate estimation; clustering and sequential learning.

Ph.D Seminar.