Course Inventory

CAP Space includes a repository of detailed Courses grouped into Course Categories, comprised of Course Topics, and assessed via defined Course Learning Outcomes. Use the tools below to explore these components and the relationships among them.

• Course Details

  Select a Course Category and then a Course to view Course details.

  Choose a Category... Computing Course Engineering Course Mathematics Course
  
  
    

• Courses by Topic

  Select a Topic from the list below to locate all Courses in which the Topic appears.

  Choose a topic... *None - temporary placeholder Access controls Algorithmic strategies Attacks Authentication Basic algorithmic analysis Canonical data structures Code review Combinational logic circuits Combinatorics Communication vulnerabilities Communications Computer arithmetic Concurrency Cryptography fundamentals Data Protection Design experience Design patterns Digital system design Domain modeling Electrical quantities Engineering as a profession Engineering skills Ethical Conduct Ethics and professionalism Event-driven programming Extreme Function Values and Techniques of Graphing Formal computing algorithms Frequency response Functions, Limits, and Continuity Fundamental Algorithms and Problem Solving Fundamental Data Structures Fundamental Programming Constructs Fundamentals of computer architecture Graphs and trees Historical context of computing Human-Computer Interaction Human-Computer Interaction Input validation Integer overflow Integrity Interfacing and communication Intermediate computing algorithms Intermediate data structures Intermediate Human-Computer Interaction Intermediate programming constructs Intermediate Recursion Introduction to recursion Introduction to software architecture Introduction to software project management Inverse Trigonometric Functions Logic and Boolean algebra Machine Level Representation of Data Management Mathematical induction Memory elements Memory management Memory system organization and architecture Modular design of combinational circuits Networks and security Number bases Object-oriented design and modeling Object-Oriented Principles Object-oriented programming Other proof techniques Overview of circuit analysis Overview of computer organization and architecture Overview of digital logic circuits Overview of Operating Systems Overview of security vulnerabilities and risks in software Professional development Professional Issues Professionalism Program Development Programming Languages Reactive circuits and networks Requirements analysis Resistive circuits and networks Reusable technologies Review of object-oriented principles Role of assured software engineering Secure Code Secure systems Security goals and fundamentals Security issues Security standards in government and industry Sequential logic circuits Sets, relations, functions, congruences Signals Simple database integration Sinusoidal analysis Societal and Professional Issues Software and Information Assurance Software assurance Software behavior Software development Software engineering Software reuse Software Tools and IDE Standard risk mitigation strategies and resources Switching theory The Definite Integral and Integration The Derivative and Differentiation Transcendental Functions UML and OCL Unified Modeling Language (UML) Unit testing for security vulnerabilities Use and misuse cases Verification and validation Vulnerabilities in modern languages
  
  

• Courses by Learning Outcome

  Select a Course Learning Outcome from the list below to locate all courses in which the Course Learning Outcome appears.

  Choose a learning outcome... *None - temporary placeholder Analyze the efficiency of recursive algorithms. Analyze the execution of searching and sorting algorithms. Apply mathematical induction and other techniques to prove mathematical results. Apply methods of scientific inquiry. Apply problem solving techniques to real-world experiences. Apply secure coding techniques to object‐oriented programming solutions. Apply the program development process to problems that are solved using fundamental programming constructs and predefined data structures. As part of a team, develop software with documentation iteratively and incrementally Assess the appropriateness of using recursion to solve a given problem. Choose professional behavior in response to ethical issues inherent in computing. Compare and contrast a range of searching and sorting algorithms and analyze time and space efficiencies. Compare and contrast the primitive data types of a programming language; describe how each is stored in memory; and identify the criteria for selection. Compose requirements by writing user stories, use cases and use case diagrams Construct a preliminary investigative report for a proposed system that includes scheduling and plans for mitigating potential risks. Construct multiple‐file or multiple‐module programming solutions that use class hierarchies, inheritance, and polymorphism to reuse existing design and code. Construct object oriented programming solutions for reuse, using ADTs that incorporate encapsulation, data abstraction, and information hiding. Create effective, efficient and secure software, reflecting standard principles of software engineering and software assurance. Create programming solutions that use data structures and existing libraries. Decompose a program into subtasks and use parameter passing to exchange information between the subparts. Decompose complex systems using best practice object-oriented analysis and design tools and techniques Describe the language translation phases of compiling, interpreting, linking and executing, and differentiate the error conditions associated with each phase. Design and construct programming solutions using a variety of recursive techniques. Design and develop reusable software using appropriate data structures and templates. Design and develop secure and fault‐tolerant programs that mitigate potential security vulnerabilities. Design and implement consistent and coherent user-centered interfaces that comply with UI standard practices Differentiate and integrate inverse trigonometric functions. Differentiate and integrate transcendental functions. Differentiate between the object‐oriented, structured, and functional programming methodologies. Discuss significant trends and societal impacts related to computing, software, and the Internet. Evaluate and apply antiderivatives. Evaluate and test software system requirements that considers both validation and verification Evaluate limits and determine when a function is continuous. Examine the logical validity of arguments and proofs as they apply to Boolean expressions. Find derivatives using the definition of a derivative and special formulas, and apply derivatives to geometrical and physical problems. Find relative and absolute maxima and minima of a function, solve related geometrical and physical problems, and sketch graphs using the techniques of calculus. Illustrate the basic terminology and properties of graphs and trees. Perform binary and hexadecimal conversions of numbers. Perform computations using recursively defined functions and structures. Practice the tenets of ethics and professional behavior promoted by computing societies; accept the professional responsibilities and liabilities associated with software development. Produce algorithms for solving simple problems and trace the execution of computer programs. Produce graphical user interfaces that incorporate simple color models and handle events. Solve problems involving sets, relations, functions, and congruences. Test user requirements and program logic using manual and automated testing methods Use graphs and trees to solve problems algorithmically. Use methods of combinatorics to solve counting problems. Use standard analysis and design techniques to produce a team‐ developed, medium‐sized, secure software application that is fully implemented and formally tested. Verify program correctness through the development of sound test plans and the implementation of comprehensive test cases.
  
  

• Assessment Rubric for Course Learning Outcomes

  Select a Course from the list below to locate the Assessment Rubric associated with the Course Learning Outcomes for that Course.

  Choose a course... Calculus I Circuit Analysis with Lab Computer Organization and Architecture with Lab Computer Science I Computer Science II Computer Science III Digital Logic Circuits with Lab Discrete Structures Hardware Fundamentals Introduction to Computer Security Introduction to Database Systems Introduction to Engineering Introduction to Software Engineering Secure Coding
  
  
    

• Courses by Program

  Select a Course Category and then a Course to view all Programs in which the Course appears.

  Choose a Category... Computing Course Engineering Course Mathematics Course
  
  

• Courses Learning Outcomes by Program

  Select a Course Learning Outcome from the list below to view all Program Outcome Groups with which the Course Learning Outcome is associated.

  Choose a learning outcome... *None - temporary placeholder Analyze the efficiency of recursive algorithms. Analyze the execution of searching and sorting algorithms. Apply mathematical induction and other techniques to prove mathematical results. Apply methods of scientific inquiry. Apply problem solving techniques to real-world experiences. Apply secure coding techniques to object‐oriented programming solutions. Apply the program development process to problems that are solved using fundamental programming constructs and predefined data structures. As part of a team, develop software with documentation iteratively and incrementally Assess the appropriateness of using recursion to solve a given problem. Choose professional behavior in response to ethical issues inherent in computing. Compare and contrast a range of searching and sorting algorithms and analyze time and space efficiencies. Compare and contrast the primitive data types of a programming language; describe how each is stored in memory; and identify the criteria for selection. Compose requirements by writing user stories, use cases and use case diagrams Construct a preliminary investigative report for a proposed system that includes scheduling and plans for mitigating potential risks. Construct multiple‐file or multiple‐module programming solutions that use class hierarchies, inheritance, and polymorphism to reuse existing design and code. Construct object oriented programming solutions for reuse, using ADTs that incorporate encapsulation, data abstraction, and information hiding. Create effective, efficient and secure software, reflecting standard principles of software engineering and software assurance. Create programming solutions that use data structures and existing libraries. Decompose a program into subtasks and use parameter passing to exchange information between the subparts. Decompose complex systems using best practice object-oriented analysis and design tools and techniques Describe the language translation phases of compiling, interpreting, linking and executing, and differentiate the error conditions associated with each phase. Design and construct programming solutions using a variety of recursive techniques. Design and develop reusable software using appropriate data structures and templates. Design and develop secure and fault‐tolerant programs that mitigate potential security vulnerabilities. Design and implement consistent and coherent user-centered interfaces that comply with UI standard practices Differentiate and integrate inverse trigonometric functions. Differentiate and integrate transcendental functions. Differentiate between the object‐oriented, structured, and functional programming methodologies. Discuss significant trends and societal impacts related to computing, software, and the Internet. Evaluate and apply antiderivatives. Evaluate and test software system requirements that considers both validation and verification Evaluate limits and determine when a function is continuous. Examine the logical validity of arguments and proofs as they apply to Boolean expressions. Find derivatives using the definition of a derivative and special formulas, and apply derivatives to geometrical and physical problems. Find relative and absolute maxima and minima of a function, solve related geometrical and physical problems, and sketch graphs using the techniques of calculus. Illustrate the basic terminology and properties of graphs and trees. Perform binary and hexadecimal conversions of numbers. Perform computations using recursively defined functions and structures. Practice the tenets of ethics and professional behavior promoted by computing societies; accept the professional responsibilities and liabilities associated with software development. Produce algorithms for solving simple problems and trace the execution of computer programs. Produce graphical user interfaces that incorporate simple color models and handle events. Solve problems involving sets, relations, functions, and congruences. Test user requirements and program logic using manual and automated testing methods Use graphs and trees to solve problems algorithmically. Use methods of combinatorics to solve counting problems. Use standard analysis and design techniques to produce a team‐ developed, medium‐sized, secure software application that is fully implemented and formally tested. Verify program correctness through the development of sound test plans and the implementation of comprehensive test cases.