Content Outline and Competencies:

I. Software Development Careers and Software Applications
    A. Describe different types of careers available to software developers.
    B. Identify real-world applications that are based upon computer programs.

II. Internal and External Data Representation&
    A. Convert characters to and from ASCII (American Standard Code for Information Interchange) code.
    B. Convert among binary, decimal and hexadecimal numbers.
    C. Discuss data storage.

III. Problem-Solving Techniques for Software Development
    A. Develop logic to solve computer programs.
    B. Represent problems and solutions.
       1. Use flowcharts to represent logical flow.
       2. Use hierarchy charts to represent relationships among modules.
       3. Use pseudo-code to represent algorithms.
    C. Discuss Top-Down Design.
    D. Explain the software development life cycle.
    E. Break a larger problem into smaller, more manageable units.
    F. Develop and implement plans to test solutions.
    G. Trace program flow manually and with a debugger.

IV. Fundamental Statements and Processes
    A. Declare variables using appropriate data types.
    B. Use assignment operators.
    C. Use arithmetic, relational and logical operators.
    D. Use branching statements.
    E. Use at least two different types of looping statements.
    F. Process user input.
    G. Generate user output.
    H. Declare and manipulate arrays.

V. Functions and Methods
    A. Call built-in and user-defined functions.
    B. Pass parameters.
    C. Process returned values.
    D. Write functions and methods.

VI. Object-Oriented Methodology
    A. Discuss advantages of object-oriented techniques.
    B. Utilize objects and methods from built-in classes.
    C. Create user-defined classes.
       1. Create and utilize static and non-static instance variables.
       2. Create and utilize static and non-static methods.
       3. Create constructors to initialize instance variables.
       4. Properly use public and private access modifiers.
    D. Instantiate objects from classes.

VII. Event-driven Programming
    A. List different types of event triggers.
    B. Use built-in classes to capture events
    C. Write event handlers to process events.

Content Outline and Competencies:

 
I. Create Programs Using the Following Program Structures 
   A. Input 
   B. Output 
   C. Assignment 
   D. Conditional 
   E. Looping 
   F. Subalgorithm Call 
 
II. Solve Problems and Develop Algorithms  
   A. Incorporate strategies for Problem Solving 
      1. Step-wise Refinement 
      2. Solution by Analogy 
      3. Use of Previously Developed Subalgorithms 
   B. Practice Problem Analysis 
      1. Understand the Problem 
      2. Identify the Input 
      3. Describe the Output 
   C. Represent Algorithms Using Pseudocode 
   D. Verify Algorithms 
      1. Desk Checking 
      2. Selecting Test Data 
 
III. Describe and Use Features of a Block Structured High-level 
Programming Language  
   A. Data 
      1. Types and Declarations 
      2. Scalar Types 
      3. Structured Types 
   B. Block Structure and Scope of Identifiers 
   C. Expressions 
      1. Operators 
      2. Relations 
      3. Functions 
      4. Rules of Precedence 
   D. Assignment Statements 
   E. Input and Output 
      1. Format 
      2. Terminal 
      3. Printer 
      4. Disk Files 
   F. Control Structures 
      1. Sequential 
      2. Conditional 
      3. Loops 
   G. Subprograms 
      1. Procedures and Functions 
      2. Parameters 
         a. Actual and Formal 
         b. Value and Reference 
      3. Recursion 
   H. Coding Standards and Documentation 
   I. Integrated Environment 
      1. Editing 
      2. Testing 
      3. Debugging 
 
IV. Utilize Data Structures 
   A. One and Two-dimensional Arrays 
   B. Strings 
   C. Records 
   D. Sets 
   E. Combinations of Structures 
 
V. Describe and Practice Program Development Methods and Style 
   A. Design 
      1. Procedural Abstraction 
      2. Data Abstraction 
      3. Top-down Design and Step-wise Refinement 
   B. Program Correctness 
   C. Development of Reusable Modules 
   D. Analysis of Program Size and Execution Time 
 
VI. Program Well-known Algorithms 
   A. Searches  
      1. Sequential 
      2. Binary 
   B. Sorts 
      1. Insertion 
      2. Selection 
      3. Bubble 
 
VII. Define Computer Systems 
   A. List and Describe Hardware Components 
      1. Primary Memory 
      2. Central Processing Unit 
      3. Secondary Memory 
      4. Peripherals 
   B. List and Define System Software 
      1. Operating Systems 
      2. Language Translators 
      3. File Systems 

Content Outline and Competencies:

I. Solve Problems and Develop Algorithms
   A. Incorporate strategies for Problem Solving
      1. Step-wise Refinement
      2. Solution by Analogy
      3. Use of Previously Developed Subalgorithms
   B. Practice Problem Analysis
      1. Understand the Problem
      2. Identify the Input
      3. Describe the Output
   C. Represent Algorithms Using Pseudocode
   D. Verify Algorithms
      1. Desk Checking
      2. Selecting Test Data

II. Describe and Practice Program Development Methods and Style
   A. Design
      1. Procedural Abstraction
      2. Data Abstraction
      3. Top-down Design and Step-wise Refinement
   B. Program Correctness
   C. Development of Reusable Modules
   D. Analysis of Program Size and Execution Time

III. Create Programs Using the Following Program Structures
   A. Input
   B. Output
   C. Assignment
   D. Conditional
   E. Looping
   F. Subalgorithm Call

IV. Describe and Use Features of an Object-Oriented Programming Language
   A. Data
      1. Types and Declarations
      2. Scalar Types
      3. Structured Types
   B. Block Structure and Scope of Identifiers
   C. Expressions
      1. Operators
      2. Relations
      3. Functions
      4. Rules of Precedence
   D. Assignment Statements
   E. Input and Output
      1. Format
      2. Screen
      3. Printer
      4. Disk Files
   F. Control Structures
      1. Sequential
      2. Conditional
      3. Loops
   G. Subprograms
      1. Functions
      2. Value and Reference Parameters
      3. Recursion
   H. Coding Standards and Documentation

V. Utilize Data Structures
   A. One and Two-dimensional Arrays
   B. Strings
   C. Objects
   D. Combinations of Objects

VI. Program Well-known Algorithms
   A. Searches
      1. Sequential
      2. Binary
   B. Sorts
      1. Insertion
      2. Selection
      3. Bubble

VII. Define Computer Systems
   A. List and Describe Hardware Components
      1. Primary Memory
      2. Central Processing Unit
      3. Secondary Memory
      4. Peripherals
   B. List and Define System Software
      1. Operating Systems
      2. Language Translators
      3. File Systems

Content Outline and Competencies:

I. Solve Problems and Develop Algorithms 
   A. Incorporate strategies for problem solving
      1. Step-wise refinement
      2. Solution by analogy
      3. Use of previously developed subalgorithms
   B. Practice problem analysis
      1. Understand the problem
      2. Identify the input
      3. Describe the output
   C. Represent algorithms using pseudocode
   D. Verify algorithms
      1. Desk checking
      2. Selecting test data

II. Describe and Practice Program Development Methods and Style
   A. Design
      1. Procedural abstraction
      2. Data abstraction
      3. Top-down design and step-wise refinement
   B. Program dorrectness
   C. Development of reusable modules
   D. Analysis of program size and execution time

III. Create Programs Using the Following Program Structures
   A. Input
   B. Output
   C. Assignment
   D. Conditional
   E. Looping
   F. Subalgorithm call

IV. Describe and Use Features of an Object-Oriented Programming Language 
   A. Data
      1. Types and declarations
      2. Scalar types
      3. Structured types
   B. Block structure and scope of identifiers
   C. Expressions
      1. Operators
      2. Relations
      3. Functions
      4. Rules of precedence
   D. Assignment statements
   E. Input and output
      1. Format
      2. Screen
      3. Printer
      4. Disk files
   F. Control structures
      1. Sequential
      2. Conditional
      3. Loops
   G. Subprograms
      1. Functions
      2. Parameters
         a. Actual and formal
         b. Value and reference
      3. Recursion
   H. Coding standards and documentation

V. Utilize Data Structures
   A. One and two-dimensional arrays
   B. Strings
   C. Objects
   D. Combinations of objects

VI. Program Well-known Algorithms
   A. Searches 
      1. Sequential
      2. Binary
   B. Sorts
      1. Insertion
      2. Selection
      3. Bubble

VII. Define Computer Systems
   A. List and describe hardware components
      1. Primary memory
      2. Central processing unit
      3. Secondary memory
      4. Peripherals
   B. List and define system software
      1. Operating systems
      2. Language translators
      3. File systems

Content Outline and Competencies:

I. Introduction
   A. Determine whether a solution is possible in a variety of
circumstances
   B. Count the number of solutions in a variety of circumstances
   C. Optimize a solution in a variety of circumstances
   D. Create PERT charts
   E. Find the critical path for a PERT chart

II. Sets
   A. Define a set and related properties
   B. Use operations with sets
   C. Use Venn Diagrams  with sets
   D. Use DeMorgan's Law
   E. Use the Cartesian Product

III. Equivalence Relations
   A. Define an equivalence relation
   B. Find if a relation has the reflexive property
   C. Find if a relation has the symmetic property
   D. Find if a relation has the transitive property
   E. Define and use partitions

IV. Congruence Classes
   A. Define a congruence class and related properties
   B. Do arithmetic operations using congruence classes

V. Functions
   A. Define a function and related properties
   B. Define one-to-one and related properties
   C. Define onto and related properties
   D. Define composition and related properties

VI.   Define and use the concepts of Mathematics Induction

VII. Graphs
   A. Define a graph and related properties
   B. Define a matrix and related properties
   C. Add matrices
   D. Subtract matrices
   E. Do scalar multiplication
   F. Do matrix multiplication
   G. Represent a graph as a graph, an adjacency list, and a matrix
   H. Change from any representation of a graph to another form
   I. Define and use the concept of isomorphisms
   J. Define a path and related properties for a graph
   K. Define a circuit and related properties for a graph
   L. Find Euler paths and circuits for a graph
   M. Find Hamiltonian paths and cycles for a graph
   N. Find the shortest path between any two points in a graph
   O. Color a map
   P. Find the graph of a map
   Q. Define a digraph and related properties
   R. Represent a digraph as a graph, an adjacency list, and a matrix
   S. Change the representation of a digraph from any representation of a
graph to another form
   T. Find the Euler paths and circuits for a digraph
   U. Find Hamiltonian paths and cycles for a digraph

VIII. Trees
   A. Define a tree and related properties
   B. Create a spanning tree for a graph
   C. Create a minimum spanning tree for a graph
   D. Create a maximum spanning tree for a graph
   E. Create a depth-first search spanning tree for a graph
   F. Create a breadth-first search spanning tree for a graph
   G. Define a rooted tree and related properties
   H. Define a binary tree and related properties
   I. Create an expression tree for a preorder, postorder, and inorder
expression
   J. Evaluate a preorder, postorder, and inorder expression
   K. From a tree, write the preorder, postorder, and inorder expression
   L. Develop an optimal tree using Huffman Code
   M. Develop and use a binary search tree

IX. Matching Problems
   A. Use systems of distinct representations to solve a variety of
problems
   B. Apply the algorithms of maximal independent sets to solve a variety
of problems

X. Network Flows
   A. Define a transportation network and related properties
   B. Maximize a transportation network
   C. Find a cut for an optimal transportation network 

XI. Counting Techniques
   A. Use the product rule
   B. Use the sum rule
   C. Use the Pigeonhole Principle
   D. Use the notation for permutations and combinations
   E. Use combinations
   F. Use permutations
   G. Use the principle of inclusion-exclusion

XII. Combinatorial Circuits
   A. Define AND, OR, and NOT gates and their related properties
   B. Use logical gates to create circuits
   C. Find the Boolean expression of a circuit
   D. Find the truth table for a Boolean expression
   E. Use Karnaugh maps to optimize a circuit or a logical expression

Content Outline and Competencies:

I. Use fundamental mathematical tools
   A. Use logic
   B. Use truth tables
   C. Use propositional equivalences
   D. Use predicates and quantifiers
   E. Use sets
   F. Use Venn Diagrams
   G. Apply set operations
   H. Use power sets and cartesian products
   I. Use functions and their characteristics
   J. Use sequences and summations
   K. Use integer/mod arithmetic
   L. Use matrices
   M. Apply matrix operations

II. Do mathematical proofs
   A. Do proofs with truth tables
   B. Do proofs using mathematical induction
   C. Use rules of inference

III. Recursion
   A. Develop recursive algorithms
   B. Develop recursive functions
   C. Evaluate recursive definitions

IV. Counting
   A. Use the Sum Rule
   B. Use the Product Rule
   C. Use the Pigeonhole Principle
   D. Use Inclusion-Exclusion Principle
   E. Use Tree diagrams to solve appropriate counting problems
   F. Use Permutations
   G. Use Combinations
   H. Use discrete probability
   I. Use generalized permutations and combinations
   J. Use recurrence relations
   K. Solve recurrence relations
   L. Apply the inclusion-exclusion principle

V. Relations
   A. Use relations on a set
   B. Use the properties of relations
      1. reflexive
      2. irreflexive
      3. symmetric
      4. asymmetric
      5. antisymmetic
      6. transitive
   C. Combine relations
   D. Use n-ary relations
   E. Use elementary database principles
   F. Represent relations in matrix form
   G. Represent relations in digraph form
   H. Define equivalence relations
   I. Define partial orderings
   J. Use Hasse Diagrams to represent partial orderings

VI. Graph Theory
   A. Define graphs, digraphs, simple graphs, multigraphs, pseudographs
   B. Represent graphs as pictures
   C. Represent graphs in matrix form
   D. Use graph terminology
   E. Apply graph theory to applications
   F. Use adjacency and incidence matrices
   G. Use isomorphisms and their properties
   H. Use connectivity, paths and circuits
   I. Create Euler paths and circuits
   J. Create Hamilton paths and cycles
   K. Using Dijkstra's Algorithm, find the shortest path between points
   L. Use planar graphs and their properties
   M. Color maps, create graphs of maps, and use their properties

VII. Trees
   A. Define a tree and related vocabulary
   B. Use the properties of trees
   C. Create binary search trees
   D. Use trees for preorder, postorder, and inorder expressions
   E. Develop preorder, postorder, and inorder expressions
   F. Translate trees  into preorder, postorder, and inorder expressions
   G. Translate preorder, postorder, and inorder expressions to trees
   H. Use tree transversal methods
   I. Evaluate preorder, postorder, and inorder expressions
   J. Evaluate preorder, postorder, and inorder trees
   K. Define spanning trees
   L. Create minimum and maximum spanning trees of graphs
   M. Create depth-first and breadth-first spanning trees of graphs

VIII. Boolean Algebra
   A. Use Boolean expressions and operations
   B. Create a Truth Table from a Boolean expression
   C. Represent Boolean Expression as sums of products
   D. Define logic gates and related properties
   E. Create Boolean expressions from circuits
   F. Use logic gates to include OR, AND, NOT, NOR, and NAND
   G. Create circuits using OR, AND, NOT, NOR, and NAND gates
   H. Use Karnaugh Maps to minimize circuits and Boolean expressions
   I. Use Quine-McCluskey method to minimize circuits and Boolean
expressions

IX. Grammars
   A. Define grammars and related properties
   B. Use Phrase-Structure grammars
   C. Use finite-state machines 

Content Outline and Competencies:

I. Programmable Logic Devices (PLD)
   A. Compare the characteristics of Programmable Logic Array (PLA), Field-Programmable Gate Array (FPGA), Complex Programmable Logic Device (CPLD) and other programmable logic devices.
   B. Evaluate circuit design considerations for each type of device.
   C. Appraise applications of CPLDs and FPGAs.

II. Introduction to VHDL Programming 
   A. Describe the programming structures in VHDL.
   B. Translate basic combinational digital circuits to VHDL code.
   C. Create VHDL files to model basic logic circuits. 
   D. Describe the process for implementing a more complex digital design with VHDL.

III. The VHDL Integrated Programming Environment
   A. Configure an industry-standard VHDL programming development environment.
   B. Access code library resources for VHDL coding.
   C. Create a hierarchical VHDL project incorporating new and existing VHDL resources.

IV. Combinational Design for Programmable Logic Devices
   A. Apply Computer-Aided Design (CAD) tools to optimize designs for a target device.
   B. Explain synthesis and optimization in the VHDL environment.
   C. Test combinational circuit performance in simulation and hardware implementations.

V. Sequential Design with VHDL
   A. Design a sequential logic circuit to meet functional specifications.
   B. Create the code within a VHDL project.
   C. Describe the types of simulation tools available for testing in the given development environment.
   D. Develop a test plan to evaluate the function of the given circuit.  
   E. Evaluate a sequential design using simulation tools in the VHDL environment.
 
VI. Implement Logic on Hardware
   A. Configure a given target device for programming and upload a tested program.
   B. Evaluate the performance of the circuit according to the test plan.

Content Outline and Competencies:

I. Object-Oriented Programming and Frameworks

   A. Discuss the history and objectives of C# and .NET.

   B. Explain and utilize the characteristics of object-oriented design.

   C. Utilize Visual Studio and explore an associated framework.

II. Object-Oriented Windows Solutions

   A. Discuss key elements of graphical user interfaces (GUI).

   B. Discuss issues related to GUI design.

   C. Design, develop, debug, and execute GUI desktop solutions.

   D. Employ common GUI controls.

III. Event-driven Programming

   A. Implement delegates.

   B. Implement event handlers.

   C. Apply combo box and list box classes in C# programs.

   D. Apply menus, tab controls, radio buttons, and check box classes in

C# programs.

IV. Advanced Object-Oriented Programming

   A. Utilize abstraction, encapsulation, inheritance, polymorphism in

object-oriented design.

   B. Explain the difference between composition and inheritance.

   C. Discuss why polymorphism is a common goal in .NET.

   D. Discuss multi-tier applications and component-based development.

   E. Utilize abstract and partial classes.

   F. Implement interfaces.

   G. Implement generics

V. Error Handling

   A. Explain exception classes.

   B. Employ standard exceptions and create custom exceptions.

   C. Employ exception handling techniques including catching and throwing

exceptions and using try, catch, and finally blocks.

   D. Experiment with the numerous types of errors and exceptions and

develop advanced techniques for debugging.

   E. Employ the debugger to find run-time errors.

VI. File Input and Output

   A. Utilize the System.IO namespace classes.

   B. Employ File and Directory classes.

   C. Employ FileInfo and DirectoryInfo classes.

   D. Apply stream classes to read and write data from text files in C#

programs.

   E. Read and write binary files.

VII. Data Structures and Accessing Data with ADO.NET, SQL, and LINQ

   A. Discuss common data structures such as lists, stacks, queues, and

trees.

   B. Utilize generics with a data structure to solve an applications

problem.

   C. Discuss data access technologies.

   D. Employ DataReader, DataSet and DataAdapter classes.

   E. Employ SQL to query databases.

   F. Utilize visual development tools for data access.

   G. Explain the use of LINQ.

VIII. Web Solutions

   A. Compare and contrast Windows versus Web development.

   B. Explain and employ ASP.NET.

   C. Utilize a variety of Web controls.

   D. Explain Web Services and their role in distributed applications.

   E. Discuss issues related to the development of mobile applications.

IX. C# Frameworks

   A. Discuss frameworks and software development kits (SDKs) - what they

are and when they are used.

   B. Employ a sample framework.

   C. Develop and use multimedia classes (e.g. images and sounds).

   D. Discuss applications that employ additional devices and hardware.

   E. Create an application using a sample framework or SDK.

Content Outline and Competencies:

I. Describe and practice principles of object oriented programming
   A. Write modular algorithms
   B. Practice good programming style
   C. Include effective documentation
   D. Create reusable objects

II. Develop programs using advanced topics
   A. Input data and output information using advanced I/O capabilities
   B. Allocate and deallocate memory with dynamic variables and operators:
new and delete
   C. Write recursive programs

III. Create and execute programs with advanced data structures
   A. Manage indexing, pointers, and indirect addressing
   B. Implement data structures by creating objects for:
      1. Stacks
      2. Queues
      3. Lists
      4. Trees
      5. Tables
   C. Compose algorithms for the implementation of the various data
structures

IV. Organize large programs
   A. Determine modularity and specification of interfaces
   B. Practice testing, error recovery, and use of dummy modules
   C. Implement performance evaluation and improvement of programs

Content Outline and Competencies:

I. Describe and practice principles of object oriented programming
   A. Write modular algorithms
   B. Practice good programming style
   C. Include effective documentation
   D. Create reusable objects

II. Develop programs using advanced topics
   A. Input data and output information using advanced I/O capabilities
   B. Write recursive programs

III. Create and execute programs with advanced data structures
   A. Manage arrays, vectors, iterators and enumerators
   B. Implement data structures by creating objects for:
      1. Stacks
      2. Queues
      3. Lists
      4. Trees
      5. Hash tables
   C. Compose algorithms for the implementation of the various data
structures

IV. Organize large programs
   A. Determine modularity and specification of interfaces
   B. Practice testing, error recovery, and use of dummy modules
   C. Implement performance evaluation and improvement of programs