[PORTALNAME]

Course Criteria

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

  • CS 2500: Data Wrangling

    3.00 Credits
    Utah Tech University

    This course provides an introduction to Data Science by first giving a high-level overview of the general process and then providing depth in the first phase of the process, including acquiring and preparing large and complex datasets for analysis. Students will apply these concepts to real datasets using state-of-the-art development tools. The course will include class discussions and readings covering case studies relevant to data ethics. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Describe the common phases of data science. 2. Prepare solutions to acquire, clean, and transform raw datasets in preparation for analysis. 3. Experiment with advanced data science topics, such as mining and visualization. 4. Practice learned concepts using professional-grade development tools and libraries. 5. Evaluate case studies related to ethical, bias, and privacy issues in data science. Prerequisites: CS 1410 (Grade C or higher). FA
    ShareCS 2500 - Data Wrangling
    Favorite

  • CS 2810: Computer Organization and Architecture

    3.00 Credits
    Utah Tech University

    Required of students pursuing a Computer Science degree or emphasis, open to any student with a strong interest in computer programming. Covers digital hardware design and systems programming, including numeric representations, digital logic, processor architecture, instruction sets, assembly language, and other low-level programming topics. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Convert between number systems including binary, hexadecimal, octal, and decimal. 2. Debate and compare the design of computer instruction sets and assembly languages. 3. Compose low-level solutions to programming problems that interact directly with the operating system. 4. Generate structured assembly language solutions to algorithmic problems. Course fee required. Prerequisites: CS 1410 (Grade C or higher) and can be concurrently enrolled. FA, SP
    ShareCS 2810 - Computer Organization and Architecture
    Favorite
    Show comparable courses

  • CS 3005: Programming in C++

    3.00 Credits
    Utah Tech University

    For student pursuing degrees in Computer Science and Computer and Information Technologies, or any student with a strong interest in computer programming. Covers syntax and semantics of C++ programming language through completion of hands-on projects. The student must already be fluent in some other programming language. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Construct computer programs in C++, using functions, classes and STL elements. 2. Construct computer programs using stack, heap and static memory. 3. Construct computer programs in a statically typed language. 4. Construct and use unit tests. 5. Use version control to manage code. 6. Use memory checking and debugging tools. 7. Create larger programs than in previous course work. Course fee required. Prerequisites: CS 1410 (Grade C or higher). FA, SP
    ShareCS 3005 - Programming in C++
    Favorite
    Show comparable courses

  • CS 3150: Computer Networks

    3.00 Credits
    Utah Tech University

    A comprehensive introduction to the principles of computer networks from a developer's perspective, with emphasis on the design and implementation of the Internet, its protocols, and applications. Topics include network applications, network programming interfaces, layered network architectures, transport and congestion control protocols, routing and data link protocols, local area networks, and a selection of special topics. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Identify, interpret, and analyze the basic principles of computer networks, including switching, layering and abstraction, routing, and the various protocols that drive network behavior. 2. Explain and implement how applications use networks and the Internet to communicate using network programming interfaces. 3. Assemble limited components of common Internet applications such as email, video streaming, and peer-to-peer applications. 4. Construct portions of the Internet, including transport protocols and routing algorithms, and justify their design. Course fee required. Prerequisites: CS 2420 (Grade C or higher) AND CS 2810 (Grade C or higher). SP
    ShareCS 3150 - Computer Networks
    Favorite
    Show comparable courses

  • CS 3400: Operating Systems

    3.00 Credits
    Utah Tech University

    Can be used to fulfill a requirement for students pursuing a degree or emphasis in Computer Science, and open to other students. Covers operating systems design and implementation, including processes and threads, synchronization, virtual memory, and file systems. Course taught by arrangement. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Design the major components of an operating system. 2. Analyze the trade-offs between competing goals in system software projects, including safety, performance, convenience, and ease of future maintenance. 3. Build and modify complex software projects in teams. 4. Assess and criticize the design of modern and historical operating systems. Course fee required. Prerequisites: CS 2420 (Grade C or higher); AND CS 2810 (Grade C or higher); AND CS 3005 (Grade C or higher). FA
    ShareCS 3400 - Operating Systems
    Favorite
    Show comparable courses

  • CS 3410: Distributed Systems

    3.00 Credits
    Utah Tech University

    Can be used to fulfill a requirement for students pursuing a degree or emphasis in Computer Science, and open to other students. Covers design and implementation of network applications, including message passing, concurrency, synchronization, scalability, and partial failure. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Design and implement software solutions that span multiple computers across a network. 2. Analyze the tradeoffs between competing goals in system software projects, including safety, performance, convenience, and ease of future maintenance. 3. Build and modify complex software projects in teams. 4. Debate and differentiate the approaches and solutions to distributed systems problems taken by modern internet organizations. Course fee required. Prerequisites: CS 2420 (Grade C or higher); AND CS 2810 (Grade C or higher). SP
    ShareCS 3410 - Distributed Systems
    Favorite
    Show comparable courses

  • CS 3500: Game Development

    3.00 Credits
    Utah Tech University

    For students pursuing degrees in Computer Science or Computer Information Technology, or others with an interest in graphical interface design and implementation. Covers the theory and practice of constructing easy to use interfaces through programming graphical environment projects in a variety of languages and platforms. Course taught by arrangement. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: At the successful conclusion of this course, students will be able to: 1. Develop GUI software in a variety of environments. 2. Interview with local software companies with jargon and skill sets that are meaningful to them. 3. Debug software using at least one integrated development environment. 4. Profile software to find where it is running slowly. 5. Publish software using GIT. Course fee required. Prerequisites: CS 3005 (Grade C or higher). FA
    ShareCS 3500 - Game Development
    Favorite
    Show comparable courses

  • CS 3510: Algorithms

    3.00 Credits
    Utah Tech University

    Required of students pursuing a Computer Science degree or emphasis. Covers the analysis and design of algorithms and data structures, including graphs, greedy algorithms, divide and conquer algorithms, and dynamic programming. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Analyze and classify algorithms of various types, including divide-and-conquer algorithms, graph algorithms, dynamic programming, and linear programming. 2. Assess the run-time complexity of algorithms through analysis and measurement. 3. Evaluate and select suitable algorithms for programming problems. 4. Construct algorithmic solutions to complex problems using the full range of algorithmic approaches. Course fee required. Prerequisites: CS 2420 (Grade C or higher); AND CS 2810 (Grade C or higher); AND CS 3310 (Grade C or higher). SP
    ShareCS 3510 - Algorithms
    Favorite
    Show comparable courses

  • CS 3520: Programming Languages

    3.00 Credits
    Utah Tech University

    Required of students pursuing a Computer Science degree or emphasis. Covers the principles and concepts that characterize high-level computer programming languages, including function and data abstraction, and imperative, functional, logic and object-oriented programming techniques. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Compare major programming paradigms and appraising the impact each has on how programming problems are solved. 2. Differentiate between syntax and the underlying semantics that make up modern and historical languages. 3. Compose and construct software solutions from a wide range of fundamental language constructs. 4. Assess new languages as they emerge and determine their suitability for practical programming projects. Course fee required. Prerequisites: CS 2420 (Grade C or higher); AND CS 2810 (Grade C or higher). FA
    ShareCS 3520 - Programming Languages
    Favorite
    Show comparable courses

  • CS 3530: Computational Theory

    3.00 Credits
    Utah Tech University

    Required of students pursuing a Computer Science degree or emphasis. Covers the theory of computation, including finite-state automata, pushdown automata, Turing machines, and equivalent formalisms. Also introduces complexity theory. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Compare the capabilities of various computational models and formulating new models as needed to research new classes of problems. 2. Analyze formal systems with mathematical rigor and the appropriate formal notation. 3. Investigate computational problems and categorizing their algorithmic complexity. 4. Appraise and justify the limits of computational models and the real-world systems that rely on them. Course fee required. Prerequisites: CS 2420 (Grade C or higher); AND CS 2810 (Grade C or higher); and CS 2100 (Grade C or higher) or CS 3310 (Grade C or higher) (can be concurrently enrolled). FA
    ShareCS 3530 - Computational Theory
    Favorite
    Show comparable courses
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)