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.

Pointers; memory management; advanced programming language structures: operator overloading, iterators, multiple inheritance, polymorphism, templates, virtual functions; Unix programming environment.

Fundamentals of software design and development; software implementation strategies; object-oriented design techniques; functional design techniques; design patterns; design process; source control; testing.

Systematic problem definition, solution formulation, and computer implementation for business and related areas. Internet and database applications. Programming exercises in a high-level programming language.

Fundamentals of embedded systems: hardware components, software components, hardware/software interface design, and hardware/software co-design.

Formal specification of syntax and semantics; structure of algorithms; list processing and string manipulation languages; statement types, control structures, and interfacing procedures.

Basic theoretical principles of computing as modeled by formal languages, grammars, automata, and Turing machines; fundamental limits of computation.

Introduction to the large scale computer systems used by businesses to support thousands of simultaneous users and process millions of transactions.

Cross-listed Course: ITEC 475

Major team-based software design project to be undertaken in a student's final year of study; project planning, software requirements analysis, design, and specification. Written reports and oral presentations in a technical setting.

Individual investigation or study of special topics. At most three credits may be applied toward a degree

System software such as command language interpreters, client-server applications, debuggers; mail systems, browsers, macroprocessors, and revision control systems; file systems, processes, threads, and interprocess communication.

Design methodology; processor design; computer arithmetic: algorithms for addition, multiplication, floating point arithmetic; microprogrammed control; memory organization; introduction to parallel architectures.

Structure, design, and analysis of computer networks; ISO/OSI network architecture.

Fundamental principles and techniques of ethical hacking, including penetration testing life cycle, planning and scoping, identifying targets and goals, active and passive reconnaissance, enumeration and scanning, exploitation, post-exploitation, and results reporting.

Threats to information resources and appropriate countermeasures. Cryptography, identification and authentication, access control models and mechanisms, multilevel database security, steganography, Internet security, and intrusion detection and prevention

Techniques for design and implementation of compilers, including lexical analysis, parsing, syntax-directed translation, and symbol table management.

Object-oriented methods and tools for application programming with graphically interactive operating systems.

Basic theoretical principles of computing as modeled by formal languages and automata; computability and computational complexity.

Concepts, algorithms and tools for important problems in Bioinformatics, including nucleotide and amino acid sequence alignment, DNA fragment assembly, phylogenetic reconstruction, and protein structure visualization and assessment.

Interpolation and approximation of functions; solution of algebraic equations; numerical differentiation and integration; numerical solutions of ordinary differential equations and boundary value problems; computer implementation of algorithms

Parallel algorithms; scientific visualization; techniques for solving scientific problems.

Scientific visualization tools as applied to sampled and generated data; methods for data manipulation and representation; investigation of visualization techniques.

Foundational techniques for implementing procedural rhetoric, specifically as software designed to present sensitive, sometimes controversial, material in ways to engender empathic awareness of the interactant.

Design and application of robotic systems; emphasis on mobile robots and intelligent machines.

Heuristic problem solving, theorem proving, and knowledge representation, including the use of appropriate programming languages and tools.

Foundational techniques and tools required for data science and big data analytics. Concepts, principles, and techniques applicable to any technology or industry for establishing a baseline that can be enhanced by future study.

Strategic management and use of information systems in organizations.

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.