This is an archived copy of the 2013 Catalog. To access the most recent version of the catalog, please visit http://catalog.jccc.edu.

Information Systems Technology, A.S.

The national and regional job outlook and earnings for careers in information technology continue to be strong. Employees in this sector may possess a diverse or concentrated background in areas such as software and hardware development, mobile computing, data storage and analysis, information security, system administration and integration, computer networking, mathematics and science.

Students completing the Associate of Science (AS) emphasis in Information Systems Technology will be prepared with a diverse set of skills that include the fundamentals of software development. They can then transfer credits seamlessly to the University of Kansas, Edwards campus, to complete a Bachelor of Science in Information Technology in two additional years. Completion of the AS degree may help students obtain internships or entry-level jobs as they complete their bachelor's degree.

Cultural Diversity Course Requirement at JCCC

(Major Code 2940; State CIP Code 24.0101)

Associate of Science

First Semester

CS 134Programming Fundamentals4
ACCT 121Accounting I3
SPD 121Public Speaking3
MATH 171College Algebra*3
ENGL 121Composition I*3
Total Hours16

Second Semester

ENGL 122Composition II*3
CS 200Concepts of Programming Algorithms Using C++*4
CIS 204UNIX Scripting and Utilities*3
BIOL 135Principles of Cell and Molecular Biology4-5
or CHEM 124
  & CHEM 125
General Chemistry I Lecture*
   and General Chemistry I Lab
Humanities Elective ^3
Note: Ethics is recommended as one of the two humanities electives. Humanities electives chosen must transfer to KU, and one of the humanities electives must satisfy the JCCC cultural diversity requirement.
Total Hours17-18

^

Humanities Elective

Third Semester

CIS 235Object-Oriented Programming Using C++*4
CS 210Discrete Structures I*3
CIS 260Database Management*4
PSYC 130Introduction to Psychology3
ECON 132Survey of Economics3
Total Hours17

Fourth Semester

CS 250Basic Data Structures using C++*4
CS 211Discrete Structures II*3
PHYS 130General Physics I*5
Health and/or Physical Education Elective ^1
Humanities Elective ^^3
Note: Ethics recommended as one of the two humanities electives. Humanities electives chosen must transfer to KU, and one of the humanities electives must satisfy the JCCC cultural diversity requirement.
Total Hours16

^

 Health and/or Physical Education Elective

^^

 Humanities Elective

Total Program Hours: 66-67

Courses

CS 134   Programming Fundamentals (4 Hours)

In this introductory course, students will create interactive computer applications that perform tasks and solve problems. Students will utilize fundamental logic, problem-solving techniques and key programming concepts to design, develop and test modular applications written in an object-oriented programming language. 3 hrs. lecture, 2 hrs. lab /wk.

CS 200   Concepts of Programming Algorithms Using C++ (4 Hours)

Prerequisite: CIS 134 or CS 134 or ENGR 171 or equivalent experience

This course emphasizes programming methodology and problem solving. Algorithm design and development, data abstraction, good programming style, testing and debugging will be presented. An appropriate block-structured high-level programming language will be studied and used to implement algorithms. 3 hrs. lecture, 2 hrs. lab by arrangement/wk. Four-credit-hour CS courses have two hours of open lab per week.

CS 200H   HON: Concepts/Prog. Algorithms (1 Hour)

One-credit hour honors contract is available to qualified students who have an interest in a more thorough investigation of a topic related to this subject. An honors contract may incorporate research, a paper, or project and includes individual meetings with a faculty mentor. Student must be currently enrolled in the regular section of the courses or have completed it the previous semester. Contact the Honors Program Office, COM 201, for more information.

CS 201   Concepts of Programming Algorithms using C# (4 Hours)

Prerequisite: CIS 134 or CS 134 or ENGR 171 or equivalent experience

This course emphasizes programming methodology and problem-solving using C#. Algorithm design and development, data abstraction, good programming style, testing and debugging will be presented. 3 hrs. lecture, 1.5 hrs. lab/wk. Four credit hours CS courses have two hours of open lab per week.

CS 205   Concepts of Programming Algorithms using Java (4 Hours)

Prerequisite: CIS 134 or CS 134 or ENGR 171 or equivalent experience

This course emphasizes programming methodology and problem-solving using Java. Algorithm design and development, data abstraction, good programming style, testing and debugging will be presented. 3 hrs. lecture, 1.5 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per week.

CS 210   Discrete Structures I (3 Hours)

Prerequisites: MATH 171 or both MATH 116 and CIS 134 or CS 134 or appropriate math assessment scores

Upon successful completion of this course, the student should be able to use fundamental discrete mathematics as it relates to computers and computer applications. The student will be exposed to a variety of discrete mathematical topics. The course will include fundamental mathematical principles, combinatorial analysis, mathematical reasoning, graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk.

CS 210H   HON: Discrete Structures I (1 Hour)

One-credit hour honors contract is available to qualified students who have an interest in a more thorough investigation of a topic related to this subject. An honors contract may incorporate research, a paper, or project and includes individual meetings with a faculty mentor. Student must be currently enrolled in the regular section of the courses or have completed it the previous semester. Contact the Honors Program Office, COM 201, for more information.

CS 211   Discrete Structures II (3 Hours)

Prerequisite: CS 210

Upon successful completion of this course, the student should be able to use fundamental discrete mathematics as it relates to computers and computer applications. The student will experiment with a variety of discrete mathematical topics. The course will include fundamental mathematical principles, combinatorial analysis, mathematical reasoning, graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk.

CS 211H   HON: Discrete Structures II (1 Hour)

One-credit hour honors contract is available to qualified students who have an interest in a more thorough investigation of a topic related to this subject. An honors contract may incorporate research, a paper, or project and includes individual meetings with a faculty mentor. Student must be currently enrolled in the regular section of the courses or have completed it the previous semester. Contact the Honors Program Office, COM 201, for more information.

CS 225   Digital Logic with VHDL (2 Hours)

Prerequisite: ELEC 125

This course introduces students to the Very High Speed Integrated Circuit Hardware Descriptive Language (VHDL) used to implement digital logic designs with programmable logic devices. Students will learn the different types of programmable logic devices and how to use an industry-standard programming environment to code designs with VHDL. 1hr. lecture & 2 hrs. instuctional lab/wk.

CS 236   Object-Oriented Programming Using C# (4 Hours)

Prerequisite: CS 201

This course prepares students to develop object-oriented, C# applications that solve a variety of problems. Students will apply object-oriented concepts including inheritance, function overloading, and polymorphism and will utilize available classes as well as design their own. Event-driven programming, Windows applications, web development, common data structures, database access, and frameworks will be presented. 3 hrs. lecture, 2 hrs. instructional lab/wk.

CS 250   Basic Data Structures using C++ (4 Hours)

Prerequisite: CS 200 - Prerequisite or corequisite: CS 210 for students transferring to most four-year computer science programs

This course will cover advanced programming topics using C++. Files, recursion, data structures and large program organization will be implemented in projects using object-oriented methodology. Students will write programs using the concepts covered in the lecture. 3 hrs. lecture, 2 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per week.

CS 250H   HON: Basic Data Structures (1 Hour)

One-credit hour honors contract is available to qualified students who have an interest in a more thorough investigation of a topic related to this subject. An honors contract may incorporate research, a paper, or project and includes individual meetings with a faculty mentor. Student must be currently enrolled in the regular section of the courses or have completed it the previous semester. Contact the Honors Program Office, COM 201, for more information.

CS 255   Basic Data Structures using Java (4 Hours)

Prerequisite: CS 205

This course will cover advanced programming topics using Java. Files, recursion, data structures and large program organization will be implemented in projects using object-oriented methodology. Students will write programs using queues, stacks, lists and other concepts covered in the lecture. 3 hrs. lecture, 1.5 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per week.

CS 134

  • Title: Programming Fundamentals
  • Number: CS-134
  • Effective Term: Fall 2013
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 2

Description:

In this introductory course, students will create interactive computer applications that perform tasks and solve problems. Students will utilize fundamental logic, problem-solving techniques and key programming concepts to design, develop and test modular applications written in an object-oriented programming language. 3 hrs. lecture, 2 hrs. lab /wk.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Describe software development careers and types of software applications.
  2. Describe internal and external data representation.
  3. Apply different problem-solving techniques.
  4. Write computer programs that utilize fundamental statements and processes.
  5. Break solutions into more manageable code using functions and methods.
  6. Create solutions using object-oriented methodology.
  7. Write computer programs that respond to events.

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.

Method of Evaluation and Competencies:

Students will complete a minimum of 20 computer programs and complete at least two major exams.
Labs and Projects            20-60%
Assignments and Exercises    10-40%
Quizzes and Exams            20-60%                                             
                               100%
Criteria for grade:
   A = 90%
   B = 80%
   C = 70%
   D = 60%
   F = less than 60%

Caveats:

Students must be proficient in keyboarding and in performing tasks with a Windows or Macintosh operating system. Operating system and office application courses are available in CPCA and CIS to enhance these skills.

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 200

  • Title: Concepts of Programming Algorithms Using C++*
  • Number: CS-200
  • Effective Term: Spring 2009
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 2

Description:

Prerequisite: CIS 134 or CS 134 or ENGR 171 or equivalent experience

This course emphasizes programming methodology and problem solving. Algorithm design and development, data abstraction, good programming style, testing and debugging will be presented. An appropriate block-structured high-level programming language will be studied and used to implement algorithms. 3 hrs. lecture, 2 hrs. lab by arrangement/wk. Four-credit-hour CS courses have two hours of open lab per week.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Solve problems using a disciplined approach to algorithm development.
  2. Use a block-structured high-level programming language.
  3. Create, test and debug programs using an integrated programming language development system.
  4. Describe and use well-known algorithms and data structures.
  5. Code and document using commonly accepted programming standards.
  6. Identify the major hardware and software components of a computer system, their relationship to one another, and the roles of these components within the system.
  7. Demonstrate an understanding of procedural and data abstraction. 

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 

Method of Evaluation and Competencies:

   A minimum of three Examinations         70% of grade
   A minimum of seven Programming projects 30% of grade
                                          100%
Grade Criteria:

A = 90%
B = 80%     
C = 70%     
D = 60%     
F = less than 60%

Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 200H

No information found.

CS 201

  • Title: Concepts of Programming Algorithms using C#*
  • Number: CS-201
  • Effective Term: Spring 2009
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 1.5

Description:

Prerequisite: CIS 134 or CS 134 or ENGR 171 or equivalent experience

This course emphasizes programming methodology and problem-solving using C#. Algorithm design and development, data abstraction, good programming style, testing and debugging will be presented. 3 hrs. lecture, 1.5 hrs. lab/wk. Four credit hours CS courses have two hours of open lab per week.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Solve problems using a disciplined approach to object development.
  2. Create, test and debug programs using the C# programming language
  3. Describe and use well-known algorithms and data structures.
  4. Code and document using commonly accepted programming standards.
  5. Demonstrate an understanding of procedural and data abstraction.

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

Method of Evaluation and Competencies:

Three Examinations            70% of grade
Seven Programming Projects    30% of grade
                             100%

Grading Criteria:

A = 90 - 100%
B = 80 - 89%
C = 70 - 79%
D = 60 - 69%
F =  0 - 59%


Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 205

  • Title: Concepts of Programming Algorithms using Java*
  • Number: CS-205
  • Effective Term: Spring 2010
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 1.5

Description:

Prerequisite: CIS 134 or CS 134 or ENGR 171 or equivalent experience

This course emphasizes programming methodology and problem-solving using Java. Algorithm design and development, data abstraction, good programming style, testing and debugging will be presented. 3 hrs. lecture, 1.5 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per week.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Solve problems using a disciplined approach to object development.
  2. Create, test and debug programs using the Java programming language.
  3. Describe and use well-known algorithms and data structures.
  4. Code and document using commonly accepted programming standards.
  5. Demonstrate an understanding of procedural and data abstraction. 

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

Method of Evaluation and Competencies:

   A minimum of three Examinations            70% of grade
   A minimum of seven Programming Projects    30% of grade
                                             100%
Grade Criteria:
A = 90%
B = 80%     
C = 70%     
D = 60%     
F = less than 60%

Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 210

  • Title: Discrete Structures I*
  • Number: CS-210
  • Effective Term: Spring 2010
  • Course Type: Transfer
  • Credit Hours: 3
  • Contact Hours: 3
  • Lecture Hours: 3
  • Lab Hours:

Description:

Prerequisites: MATH 171 or both MATH 116 and CIS 134 or CS 134 or appropriate math assessment scores

Upon successful completion of this course, the student should be able to use fundamental discrete mathematics as it relates to computers and computer applications. The student will be exposed to a variety of discrete mathematical topics. The course will include fundamental mathematical principles, combinatorial analysis, mathematical reasoning, graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Apply the mathematical tools and techniques basic to and needed for most courses in computer science
  2. Develop the ability to reason precisely using discrete mathematics models
  3. Apply the relationship between discrete mathematics and computer science
  4. Apply the elements of logic to computer science
  5. Write the truth table of a proposition
  6. Demonstrate how a proposition is used in computer science
  7. Apply combinatorial circuits and their use in computer science
  8. Demonstrate how to simplify Boolean expressions and their use in computer science
  9. Apply the elements of set theory and related topics to computer science
  10. Demonstrate Cartesian product and their use in computer science
  11. Demonstrate sequences and their use in computer science
  12. Demonstrate mathematical induction and its use in computer science
  13. Demonstrate matrices and their use in computer science
  14. Demonstrate graphs and their use in computer science
  15. Demonstrate trees and their use in computer science
  16. Demonstrate proofs and arguments and their use in computer science  

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


Method of Evaluation and Competencies:

A minimum of 4 examinations            at least 60%
A minimum of 10 quizzes                at least 10%
A minimum of 10 homework assignments   at least 10%
                                               100%
Grade Criteria:
A = 90%
B = 80%     
C = 70%     
D = 60%     
F = less than 60%


Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 210H

No information found.

CS 211

  • Title: Discrete Structures II*
  • Number: CS-211
  • Effective Term: Spring 2010
  • Course Type: Transfer
  • Credit Hours: 3
  • Contact Hours: 3
  • Lecture Hours: 3
  • Lab Hours:

Description:

Prerequisite: CS 210

Upon successful completion of this course, the student should be able to use fundamental discrete mathematics as it relates to computers and computer applications. The student will experiment with a variety of discrete mathematical topics. The course will include fundamental mathematical principles, combinatorial analysis, mathematical reasoning, graphs and trees, and Boolean logic circuits. 3 hrs. lecture/wk.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Use the mathematical tools and techniques basic to and needed for most courses in computer science
  2. Use logic and truth tables
  3. Use sets and apply set operations
  4. Use functions
  5. Use integer and mod arithmetic
  6. Apply matrix operations
  7. Develop discrete proofs including mathematical induction
  8. Develop and use recursive algorithms
  9. Use combinatorial analysis
  10. Use recurrence relations
  11. Use relations and apply their properties
  12. Use elementary database principles
  13. Represent relations with matrices
  14. Use Hasse diagrams to illustrate partial orderings
  15. Use the principles of graph theory
  16. Use the principles of trees
  17. Use logic, Boolean expressions and circuits and minimize each
  18. Use simple grammar applications 

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 

Method of Evaluation and Competencies:

A minimum of 3 examinations            50%
A minimum of 25 homework assignments   41.66%
A minimum of 5 quizzes                  8.33%
                                      100%
Grade Criteria:
A = 90%
B = 80%     
C = 70%     
D = 60%     
F = less than 60%

Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 211H

No information found.

CS 225

  • Title: Digital Logic with VHDL*
  • Number: CS-225
  • Effective Term: Fall 2013
  • Course Type: Career
  • Credit Hours: 2
  • Contact Hours: 3
  • Lecture Hours: 1
  • Lab Hours: 2

Description:

Prerequisite: ELEC 125

This course introduces students to the Very High Speed Integrated Circuit Hardware Descriptive Language (VHDL) used to implement digital logic designs with programmable logic devices. Students will learn the different types of programmable logic devices and how to use an industry-standard programming environment to code designs with VHDL. 1hr. lecture & 2 hrs. instuctional lab/wk.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Evaluate the differences between various programmable logic devices to determine appropriate application.
  2. Explain how VHDL programming structures are used to implement digital logic on programmable logic devices.
  3. Demonstrate the organization and operation of an industry-standard VHDL programming environment.
  4. Design an optimized solution to a combinational digital circuit problem appropriate to a given target device.
  5. Create VHDL projects for a sequential digital circuit and implement on a target device.
  6. Demonstrate the design functionality on the hardware device in a lab environment.

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.

Method of Evaluation and Competencies:

Quizzes/Tests  30-60% of grade
Assignments/Projects  30-60% of grade
Participation/Discussion  0-20% of grade
Total  100% of grade

Grade Criteria:
A = 90-100%
B = 80-89%
C = 70-79%
D = 60-69%
F = less than 60%

Caveats:

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 236

  • Title: Object-Oriented Programming Using C#*
  • Number: CS-236
  • Effective Term: Spring 2012
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 2

Description:

Prerequisite: CS 201

This course prepares students to develop object-oriented, C# applications that solve a variety of problems. Students will apply object-oriented concepts including inheritance, function overloading, and polymorphism and will utilize available classes as well as design their own. Event-driven programming, Windows applications, web development, common data structures, database access, and frameworks will be presented. 3 hrs. lecture, 2 hrs. instructional lab/wk.

Course Fees:

None

Supplies:

Refer to Instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Design object-oriented solutions for console applications, Windows Forms applications, and Web-based applications and select appropriate technology stacks.
  2. Develop, debug, build, and execute a variety of C# applications.
  3. Employ event-driven programming, event handlers, and the .NET library of classes.
  4. Develop applications that use C# to read and write information from text files.
  5. Employ ADO.NET to create Web Services and Web applications.
  6. Apply basic SQL (Structure Query Language) commands to interact with relational database management systems.
  7. Employ common data structures in C# programs.
  8. Employ a C# framework to create object-oriented C# applications.
  9. Explain related technologies such as LINQ (Language Integrated Query), WPF (Windows Presentation Foundation), WCF (Windows Communication Foundation) and how they support object-oriented solutions.
  10. Apply the principles of object-oriented design to solve current problems.

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.

Method of Evaluation and Competencies:

Assessment Type        Weight
Minimum of 2 exams     30-50
Quizzes                20-30%
Minimum of 5 projects  20-30%
Lab Assignments        10-20%
Total                  100%
Grading Scale:
90-100% = A
80-89% = B
70-79% = C
60-69% = D

Caveats:

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 250

  • Title: Basic Data Structures using C++*
  • Number: CS-250
  • Effective Term: Spring 2010
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 2

Description:

Prerequisite: CS 200 - Prerequisite or corequisite: CS 210 for students transferring to most four-year computer science programs

This course will cover advanced programming topics using C++. Files, recursion, data structures and large program organization will be implemented in projects using object-oriented methodology. Students will write programs using the concepts covered in the lecture. 3 hrs. lecture, 2 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per week.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Develop discipline in object oriented program design, in style and expression, and in debugging and testing.
  2. Develop techniques to write large programs.
  3. Write programs using advanced I/O.
  4. Write programs with dynamic variables
  5. Create recursive programs
  6. Create programs incorporating lists, stacks, queues, trees and other data structures. 

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

Method of Evaluation and Competencies:

A minimum of 5 Projects 50%
A minimum of 3 Exams    50%
   Total               100%

Grading Criteria:

A  =  90 - 100%
B  =  80 -  89%
C  =  70 -  79%
D  =  60 -  69%
F  =   0 -  59% 

Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.

CS 250H

No information found.

CS 255

  • Title: Basic Data Structures using Java*
  • Number: CS-255
  • Effective Term: Spring 2010
  • Course Type: Transfer
  • Credit Hours: 4
  • Contact Hours: 5
  • Lecture Hours: 3
  • Lab Hours: 1.5

Description:

Prerequisite: CS 205

This course will cover advanced programming topics using Java. Files, recursion, data structures and large program organization will be implemented in projects using object-oriented methodology. Students will write programs using queues, stacks, lists and other concepts covered in the lecture. 3 hrs. lecture, 1.5 hrs. lab/wk. Four-credit-hour CS courses have two hours of open lab per week.

Course Fees:

None

Supplies:

Refer to the instructor's course syllabus for details about any supplies that may be required.

Objectives

  1. Exhibit discipline in object oriented program design, in style and expression, and in debugging and testing.
  2. Demonstrate techniques in writing large programs.
  3. Write programs using advanced I/O.
  4. Write programs with dynamic variables
  5. Create recursive programs
  6. Create programs incorporating lists, stacks, queues, trees and other data structures. 

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


Method of Evaluation and Competencies:

A minimum of 5 projects 50%
A minimum of 3 exams    50%
   Total               100%

Grading Criteria:

A = 90 - 100% 
B = 80 - 89% 
C = 70 - 79% 
D = 60 - 69% 
F =  0 - 59% 

Caveats:

None

Student Responsibilites:

Disabilities:

If you are a student with a disability, and if you will be requesting accommodations, it is your responsibility to contact Access Services. Access Services will recommend any appropriate accommodations to your professor and his/her director. The professor and director will identify for you which accommodations will be arranged.

JCCC provides a range of services to allow persons with disabilities to participate in educational programs and activities. If you desire support services, contact the office of Access Services for Students With Disabilities (913) 469-8500, ext. 3521 or TDD (913) 469-3885. The Access Services office is located in the Success Center on the second floor of the Student Center.