• COOP 1800R: Cooperative Work Experience (ALCE)

  1.00 - 3.00 Credits

  Utah Tech University (formerly Dixie State University)

  
  The Cooperative Education, COOP 1800 course provides a beneficial three-way partnership between employer, student, and Utah Tech University. This course provides the opportunity to apply classroom learning to practical problems on the job, allowing students to work within a professional environment. Students learn the competitive nature of the job market and what is needed to prepare for career opportunities. Students also gain a competitive edge in the new graduate job market by demonstrating work experience. This course is designated as an Active Learning Civic Engagement (ALCE) course. Students will be working to make a difference in the civic life of our community through both political and nonpolitical processes. Repeatable up to 6 credits. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Demonstrate learning through original and creative work related goals. 2. Demonstrate growth through group discussions and completed goals. 3. Use appropriate strategies and tools to analyze, develop and establish student knowledge. 4. Develop the ability to think creatively and critically. Prerequisite: Must have employment and Cooperative Education Coordinator permission; to repeat course employment must be tied to academic major. FA, SP, SU
  ShareCOOP 1800R - Cooperative Work Experience (ALCE)

• CS 1030: Problem Solving with Computers

  3.00 Credits

  Utah Tech University (formerly Dixie State University)

  
  For any student interested in how computers are used to solve problems. This course will introduce the use of computers in problem solving including problem decomposition and algorithm construction. Students will be required to complete simple programming projects. Offered based upon sufficient student need. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Read and write small computer programs and a simple web page. 2. Communicate through discussion and writing about data and its effect on daily life. 3. Work with peers in creating, writing, and evaluating computer programs. Course fee required.
  ShareCS 1030 - Problem Solving with Computers

• CS 1400: Fundamentals of Programming

  3.00 Credits

  Utah Tech University (formerly Dixie State University)

  
  Required of all students pursuing Computer and Information Technology degrees. Open to all students with a general interest in computer programming. Covers structured programming techniques and the syntax of a high level programming language through completion of programming projects of increasing difficulty. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Read and write small computer programs. 2. Use language components such as variables, conditionals, and lists. 3. Decompose small problems. Course fee required. Prerequisites: CS 1030 (Grade C or higher); OR MATH 1010 or higher MATH course (Grade C or higher); OR ACT math score of 23 or higher or equivalent placement score within two years of enrollment in this course. FA, SP, SU
  ShareCS 1400 - Fundamentals of Programming

• CS 1410: Object Oriented Programming

  3.00 Credits

  Utah Tech University (formerly Dixie State University)

  
  Required of all students pursuing Computer and Information Technology degrees, open to all students with a general interest in computer programming. Introduces object oriented programming techniques through completion of programming projects of increasing difficulty. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Construct computer programs in a modern development environment using standard tools. 2. Develop solutions using a range of programming constructs, including control structures, functions, input/output, classes and objects, and data collections. 3. Design and implement programs from English descriptions. 4. Demonstrate the use of correct syntax and semantics in a high-level programming language. Course fee required. Prerequisites: CS 1400 (Grade C or higher). FA, SP
  ShareCS 1410 - Object Oriented Programming

• CS 2420: Introduction to Algorithms and Data Structures

  3.00 Credits

  Utah Tech University (formerly Dixie State University)

  
  Required of students pursuing a Computer Science or Information Technology degree or emphasis, open to any student with a strong interest in computer programming. Covers the design and use of common data structures, lists, stacks, queues, trees, hash tables, and graphs through completion of several challenging programming projects. Introduces computational complexity and algorithm analysis. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Discuss the basic principles of many software data structures, including efficiencies and tradeoffs. 2. Implement and use several data structures, including Binary Search Trees, Hash Tables, and Graphs. 3. Demonstrate a working knowledge of Big-O complexity. 4. Demonstrate a working knowledge of Algorithm Analysis. 5. Parse mathematical expressions into a functioning graphics calculator. 6. Implement several recursive algorithms. 7. Implement and analyze several sorting algorithms. Course fee required. Prerequisites: CS 1410 (Grade C or higher). FA, SP
  ShareCS 2420 - Introduction to Algorithms and Data Structures

• CS 2450: Software Engineering

  3.00 Credits

  Utah Tech University (formerly Dixie State University)

  
  Required of students pursuing a Computer Science degree or emphasis, open to any student with a strong interest in computer programming. Covers current software engineering theory and practice through completion of a challenging team project. Dual listed with SE 2450 (students may take only one course for credit). **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Explain the software engineering knowledge, skills, and professional standards necessary to begin practice as a software engineer. 2. Apply and compare appropriate theories, models, and techniques that provide a basis for the software development lifecycle. 3. Construct reliable software artifacts, both individually and as part of a team. 4. Evaluate trade-offs in software engineering practices and determine appropriate balances in project decision making. 5. Employ new models, techniques, and technologies as they emerge and appreciate the necessity of such continuing professional development. Course fee required. Prerequisites: CS 1410 (Grade C or higher). FA, SP
  ShareCS 2450 - Software Engineering

• CS 2500: Data Wrangling

  3.00 Credits

  Utah Tech University (formerly Dixie State 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, SP
  ShareCS 2500 - Data Wrangling

• CS 2810: Computer Organization and Architecture

  3.00 Credits

  Utah Tech University (formerly Dixie State 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). FA, SP
  ShareCS 2810 - Computer Organization and Architecture

• CS 3005: Programming in C++

  3.00 Credits

  Utah Tech University (formerly Dixie State 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++

• CS 3150: Computer Networks

  3.00 Credits

  Utah Tech University (formerly Dixie State 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