Brigham Young University Homepage

Undergraduate Catalog

2012 - 2013

Minor in Computer Science Teaching
(18–19 hours)



This minor is designed to prepare students to teach in public schools. A teaching minor may only be received by students graduating with a teaching major. In order to graduate with this minor, students are required to complete Utah State Office of Education licensing requirements. To view these requirements go to http://education.byu.edu/ess/licensing.html or contact Education Student Services, 120 MCKB, (801) 422-3426.

Program Requirements

  1. Grades below C- in professional education courses or content courses will not be accepted in the teaching major or teaching minor. Teacher candidates must have a cumulative 2.85 GPA in teaching major and teaching minor courses to qualify for student teaching.
  2. Complete the following:
      C S 124 : (C S-EC En) Introduction to Computer Systems. (3:3:2)(Credit Hours:Lecture Hours:Lab Hours)
      C S 124 : (C S-EC En) Introduction to Computer Systems. (3:3:2)(Credit Hours:Lecture Hours:Lab Hours)
      WHEN TAUGHT:Fall; Winter; Spring; Summer
      PREREQUISITE: C S 142 or concurrent enrollment.
      DESCRIPTION: How a computer works, from hardware to high-level programming. Logic circuits, computer instructions, assembly language, binary arithmetic, C programming, program translation, data structures, and algorithm analysis.

      Course Outcomes


      C S 142 : Introduction to Computer Programming. (3:3:0)(Credit Hours:Lecture Hours:Lab Hours)
      C S 142 : Introduction to Computer Programming. (3:3:0)(Credit Hours:Lecture Hours:Lab Hours)
      WHEN TAUGHT:Fall; Winter; Spring; Summer
      PREREQUISITE: Knowledge of algebra.
      DESCRIPTION: Introduction to object-oriented program design and development. Principles of algorithm formulation and implementation.

      Course Outcomes


      C S 235 : Data Structures and Algorithms. (3:3:0)(Credit Hours:Lecture Hours:Lab Hours)
      C S 235 : Data Structures and Algorithms. (3:3:0)(Credit Hours:Lecture Hours:Lab Hours)
      WHEN TAUGHT:Fall; Winter; Spring; Summer
      PREREQUISITE: C S 142
      DESCRIPTION: Fundamental data structures and algorithms of computer science; basic algorithm analysis; recursion; sorting and searching; lists, stacks, queues, trees, hashing; object-oriented data abstraction.

      Course Outcomes


      C S 236 : Discrete Structures. (3:3:0)(Credit Hours:Lecture Hours:Lab Hours)
      C S 236 : Discrete Structures. (3:3:0)(Credit Hours:Lecture Hours:Lab Hours)
      WHEN TAUGHT:Fall; Winter; Summer
      PREREQUISITE: C S 235
      DESCRIPTION: Introduction to grammars and parsing; predicate and propositional logic; proof techniques; sets, functions, relations, relational data model; graphs and graph algorithms.

      Course Outcomes


      C S 240 : Advanced Programming Concepts. (4:3:1)(Credit Hours:Lecture Hours:Lab Hours)
      C S 240 : Advanced Programming Concepts. (4:3:1)(Credit Hours:Lecture Hours:Lab Hours)
      WHEN TAUGHT:Fall; Winter; Spring; Summer
      PREREQUISITE: C S 236
      DESCRIPTION: Advanced software development with an object-oriented focus. Development and testing of several 1500 to 2000 line modules from formal specifications. UNIX and C++ environment.

      Course Outcomes


  3. Complete one additional computer science course with the approval of the Computer Science Department undergraduate coordinator.

*Hours include courses that may fulfill university core requirements.



Show all Computer Science Courses