05-16-2019, 12:28 PM
(This post was last modified: 05-16-2019, 12:28 PM by bluebooger.)
http://www2.acenet.edu/credit/?fuseactio...CE=1008350
================================
Computer Science 201: Data Structures & Algorithms (Computer Science 201)
ACE Course Number: 0217
Learning Outcome: Upon completion of the course, the student will be able to define object-oriented principles of design; design abstract data types; analyze various algorithms using the Big-O notation; explain and develop recursive algorithms; explain how search and sorting algorithms work; explain how stacks, queues and linked lists work; explain how trees, hash tables and graphs work; explain maps, graphs, and text processing; and explain memory management.
Instruction: The methods of instruction include audiovisual materials. The general course topics include basics of Java; object-oriented design fundamentals; core data structures; analyzing algorithms; recursion and recursive algorithms; stacks, queues and lists in Java; list and iterator abstract data types; trees in data structure; priority queues in Java; maps and hash tables in data structures; search trees and types; sorting and selection in Java; text processing; graph data structures; and memory management.
Assessment: The methods of assessment include an application assignment, quizzes, and a final examination with a minimum passing score of 70 percent.
Credit Recommendation: In the lower-division baccalaureate/associate degree category, 3 semester hours in computer information systems, information technology, or computer science (3/19).
================================
Computer Science 109: Introduction to Programming (Computer Science 109)
ACE Course Number: 0214
Learning Outcome: Upon completion of the course, the student will be able to design a program using flowcharts and pseudocode; write a simple program that includes best practices and documentation/comments; write conditional statements and loops; define and create arrays; write statements that display output and gather input; define functions and create functions in a program; explain the tenets of object-oriented programming (OOP) and create classes, objects and methods; and create data structures and abstract data types (ADT).
Instruction: The methods of instruction include audiovisual materials. The general course topics include computer programming basics; built-in data types for programming; conditionals and loops in programming; arrays in programming; input and output in programming; functions and modules in programming; object-oriented programming overview; algorithmic analysis, sorting and searching; stacks and queues for data structures; and tables, maps and graphs in programming.
Assessment: The methods of assessment include quizzes and a final examination with a minimum passing score of 70 percent.
Credit Recommendation: In the lower-division baccalaureate/associate degree category, 3 semester hours in fundamentals of programming, programming I, or introduction to programming (3/19).
================================
================================
Computer Science 201: Data Structures & Algorithms (Computer Science 201)
ACE Course Number: 0217
Learning Outcome: Upon completion of the course, the student will be able to define object-oriented principles of design; design abstract data types; analyze various algorithms using the Big-O notation; explain and develop recursive algorithms; explain how search and sorting algorithms work; explain how stacks, queues and linked lists work; explain how trees, hash tables and graphs work; explain maps, graphs, and text processing; and explain memory management.
Instruction: The methods of instruction include audiovisual materials. The general course topics include basics of Java; object-oriented design fundamentals; core data structures; analyzing algorithms; recursion and recursive algorithms; stacks, queues and lists in Java; list and iterator abstract data types; trees in data structure; priority queues in Java; maps and hash tables in data structures; search trees and types; sorting and selection in Java; text processing; graph data structures; and memory management.
Assessment: The methods of assessment include an application assignment, quizzes, and a final examination with a minimum passing score of 70 percent.
Credit Recommendation: In the lower-division baccalaureate/associate degree category, 3 semester hours in computer information systems, information technology, or computer science (3/19).
================================
Computer Science 109: Introduction to Programming (Computer Science 109)
ACE Course Number: 0214
Learning Outcome: Upon completion of the course, the student will be able to design a program using flowcharts and pseudocode; write a simple program that includes best practices and documentation/comments; write conditional statements and loops; define and create arrays; write statements that display output and gather input; define functions and create functions in a program; explain the tenets of object-oriented programming (OOP) and create classes, objects and methods; and create data structures and abstract data types (ADT).
Instruction: The methods of instruction include audiovisual materials. The general course topics include computer programming basics; built-in data types for programming; conditionals and loops in programming; arrays in programming; input and output in programming; functions and modules in programming; object-oriented programming overview; algorithmic analysis, sorting and searching; stacks and queues for data structures; and tables, maps and graphs in programming.
Assessment: The methods of assessment include quizzes and a final examination with a minimum passing score of 70 percent.
Credit Recommendation: In the lower-division baccalaureate/associate degree category, 3 semester hours in fundamentals of programming, programming I, or introduction to programming (3/19).
================================
![[-]](https://www.degreeforum.net/mybb/images/collapse.png)
