Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.
  • 2.00 Credits

    An introduction to basic topics needed to succeed in Computer Science combined with the course material covered in 4003-231. These topics include general problem solving and computing skills, such as the use of the operating system, text-based and graphical interfaces and the use of tools such as editors and fi le managers. This course satisfi es the prerequisite for 4003-232, Computer Science 2. (Departmental approval required) Class 5, Lab 2, Credit 6
  • 1.00 Credits

    The goal of this course is to introduce the student to the science of computing. The student will learn about the basic elements of computing, including problem decomposition, design and implementation of solutions, testing those solutions and integrating pieces of solutions together. Object-oriented technology is used as a means to an end to design solutions and actually implement them in software. Java is the language used; it is an object-oriented programming language that was designed for developing large systems from reusable components. Programming assignments-labs and post-labs are an integral part of the course. Class 4, Lab 2, Credit 4
  • 2.00 Credits

    This course continues the Java-based introduction to basic computer science concepts begun in Computer Science 1. Essentially, this course covers the use of object-oriented programming to design and implement software solutions. Students will learn how to implement a solution to a problem by reusing existing components and creating new components using inheritance. Other topics include; exception handling, fi les/streams, collections, threads and thread synchronization, graphical user interfaces (GUI's), networking, and event-driven programming. Programming projects-labs and projects are an integral part of the course. (4003-231) Class 3, Lab 2, Credit 4
  • 3.00 Credits

    This course is the third course in the computer science introductory sequence and builds upon the computer science foundations and design principles presented in Computer Science 1 and Computer Science 2. Students will learn how to use linear data structures, such as stacks, queues, and lists and nonlinear data structures, such as trees and graphs, and will also be introduced to the design and analysis of algorithms. Students will learn how to analyze the effi ciency of basic sorting, searching, and hashing algorithms, and acquire an understanding of how recursion works. Object-oriented programming will be used to design solutions and implement them as Java programs. Programming assignments-labs and projects are an integral part of the course. (4003-232) Class 3, Lab 2, Credit 4
  • 2.00 Credits

    An accelerated course that covers material from Computer Science I and II. This course provides the foundation for the object-oriented programming (OOP) paradigm that is used throughout following courses in the curriculum. OOP is discussed conceptually and demonstrated using the Java programming language. Topics include class design and implementation, linear containers, inheritance, exceptions, fi les and analysis of searching and sorting methods. Students will be introduced to the essential tools needed in their course work. Laboratory programming assignments are an integral part of the course and a larger programming project is assigned in the second half of the course. (Departmental approval required) Class 3, Lab 2, Credit 4
  • 2.00 Credits

    A second accelerated course that covers material from Computer Science II and III. This course continues the data structure coverage begun in Honors Computer Science I. It then introduces many of the contemporary programming techniques in use in current programs. Topics include trees, graphs, multi-threaded programming, thread synchronization, network distributed programming, graphical user interfaces and event-driven programming. Laboratory and project programming assignments are an integral part of the course. (C or better in 234) Class 3, Lab 2, Credit 4
  • 3.00 Credits

    This accelerated course covers material from Computer Science 1, 2 and 3 and provides the foundation for all subsequent Computer Science courses. This course covers modern software development techniques and introduces essential software tools. Topics include the Java collection and fi le input/output frameworks, graphs, multi-threaded programming, network distributed programming, graphical user interfaces, and event-driven programming. Laboratory and project programming assignments are an integral part of the course. (Department approval required)
  • 2.00 Credits

    This course introduces the student to the object-oriented paradigm, the computer science workstation environment, and the Java language. Topics include class design and implementation, inheritance, exceptions, fi les, threads, swing, and network programming. Students work individually and in small groups on programming assignments, which are an integral part of the course. This course is intended for students with previous programming experience and a background in data structures. Open only to transfer students. Not to be taken as a Computer Science elective. (Departmental approval required) Class 4, Lab 2, Credit 5
  • 3.00 Credits

    An introduction to classical algorithms used in the solution of numerical problems encountered in science and engineering. The C language will be introduced as a tool for implementing these algorithms. Topics include an introduction to C, computer number representation and round off error, algorithms for fi nding roots of nonlinear equations, interpolation, numerical differentiation and integration, function approximation and data fi tting, solutions to systems of linear equations, and general matrix manipulation. This course is restricted to Computer Engineering and Software Engineering students. (4003-334) Credit 3
  • 4.00 Credits

    An introduction to classical algorithms used in the solution of numerical problems encountered in science and engineering. The C language will be introduced as a tool for implementing these algorithms. Topics include an introduction to C, algorithms for solving linear algebraic equations, non-linear algebraic equations, interpolation, numerical differentiation and integration, and general matrix manipulation. Programming projects will be required. (4003-334) Class 4, Credit 4
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)
Privacy Statement   |   Terms of Use   |   Institutional Membership Information   |   About AcademyOne   
Copyright 2006 - 2024 AcademyOne, Inc.