Skip to Content

Course Search Results

  • 3.00 Credits

    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.
  • 3.00 Credits

    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
  • 3.00 Credits

    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
  • 3.00 Credits

    Required of students pursuing degrees in Computer Science, Software Engineering, and others within the Computing department. Open to any student with an interest in counting theory and applications. Covers mathematical reasoning, combinatorial analysis, sets, permutations, relations, computational complexity, and Boolean logic through homework and programming assignments. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Apply the principles of logic and set theory to solve computational and combinatorial problems. [CS/SE PLO #2]2. Enumerate discrete structures of a given kind and size via the use of combinations, permutations, and other combinatorial constructs. [CS/SE PLO #2]3. Solve complex problems by reducing them into simpler sub-problems and finding patterns. [CS/SE PLO #5]4. Implement software related to discrete math topics, including a modern cryptography system such as RSA. [CS/SE PLO #1, #2, #3] Prerequisites: CS 1410 (Grade C or higher). FA, SP
  • 3.00 Credits

    This course offers a beginner-friendly introduction to the fundamental concepts and applications of machine learning using public libraries. Designed for students with no prior experience in the topic. Open to all students with a general interest in machine learning and artificial intelligence. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Grasp the foundational concepts of machine learning. 2. Explore real-world applications of machine learning using public libraries. 3. Gain hands-on experience by applying foundational machine learning concepts to practical scenarios. 4. Develop the ability to communicate machine learning concepts and results. Prerequisites: CS 1400 (Grade C or higher). SP
  • 3.00 Credits

    Required of students pursuing a Computer Science, Software Engineering, and others within the Computing department. 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, algorithm analysis, and NP-Complete using the context of several algorithms including sorting, searching, SAT, Traveling Salesperson, factoring, etc. **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, Graphs, and more. 3. Demonstrate a working knowledge of Big-O complexity and Algorithm Analysis. 4. Implement several recursive algorithms. 5. Implement and analyze several sorting algorithms. Course fee required. Prerequisites: CS 1410 (Grade C or higher). FA, SP
  • 3.00 Credits

    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
  • 3.00 Credits

    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
  • 3.00 Credits

    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
  • 3.00 Credits

    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