Catalog Year

2020-2021

Degree

Minor

Credits

24

Locations

Mankato

Computer Science Minor

Program Requirements

Core

Limits, continuity, the derivative and applications, transcendental functions, L'Hopital's Rule, and development of the Riemann integral.

Prerequisites: Satisfy Placement Table in this section, MATH 115 or both MATH 112 and MATH 113 with “C” (2.0) or better.

Goal Areas: GE-04

Restricted Electives

Choose one option: -

CS Option -

This course provides conceptual and logical tools for students planning to major in a computing-based major. Programming in a high-level language such as C++, Python, or Java, and the development of skills in abstraction, problem-solving, and algorithmic thinking are emphasized.

Prerequisites: MATH 112 or MATH 113 or MATH 115 or MATH 121

This course is a continuation of CIS 121. Students develop a basic knowledge of programming skills and object-oriented concepts, and use fundamental data structures such as lists, stacks, queues, and trees.

Prerequisites: MATH 113 or MATH 115 or MATH 121; and CS 110 or CIS 121 or IT 210

This course builds on CS 122 (Data Structures) with coverage of advanced data structures and associated algorithms, including trees, graphs, hashing, searching, priority queues, and memory management. Formal proof techniques, the analysis of best, worst, and expected cases, and the development of efficient algorithms are emphasized. Use of effect-free programming, first-class functions, and higher-order operations such as map, reduce, and filter are explored.

Prerequisites: MATH 121 and CS 111 or CIS 122 or IT 214

EE/CE Option - This option is recommended for students majoring in electrical or computer engineering.

This course is a continuation of CIS 121. Students develop a basic knowledge of programming skills and object-oriented concepts, and use fundamental data structures such as lists, stacks, queues, and trees.

Prerequisites: MATH 113 or MATH 115 or MATH 121; and CS 110 or CIS 121 or IT 210

This course builds on CS 122 (Data Structures) with coverage of advanced data structures and associated algorithms, including trees, graphs, hashing, searching, priority queues, and memory management. Formal proof techniques, the analysis of best, worst, and expected cases, and the development of efficient algorithms are emphasized. Use of effect-free programming, first-class functions, and higher-order operations such as map, reduce, and filter are explored.

Prerequisites: MATH 121 and CS 111 or CIS 122 or IT 214

This introductory course covers digital systems topics including binary numbers, logic gates, Boolean algebra, circuit simplification using Karnaugh maps, flip-flops, counters, shift registers and arithmetic circuits. Problem solving methods, study skills and professional development will be addressed throughout the course.

Prerequisites: MATH 112

his course presents algorithmic approaches to problem solving and computer program design using the C language. Students will explore Boolean expressions, implement programs using control structures, modular code and file input/output, and interface with external hardware using robots and sensors.

Prerequisites: EE 106, EET 141

Unrestricted Electives

Choose 6 - 7 Credit(s).

Fundamentals of data mining and knowledge discovery. Methods include decision tree algorithms, association rule generators, neural networks, and web-based mining. Rule-based systems and intelligent agents are introduced. Students learn how to apply data-mining tools to real-world problems.

Prerequisites: CIS 121

An introduction to data communications and networks. The field encompasses local area networks, wide area networks, and wireless communication. Topics include digital signals, transmission techniques, error detection and correction, OSI model, TCP/IP model, network topologies, network protocols, and communications hardware.Spring

Prerequisites: CIS 223, EE 234

Basic introductory concepts and a history of the field of Artificial Intelligence (AI) are covered. Emphasis is placed on the knowledge representation and reasoning strategies used for AI problem solving. Solutions are found using the LISP programming language.Fall (ALT)

Prerequisites: CIS 223 or CS 230

This course studies historical and current concepts and implementations of computer operating systems. Basic operating systems topics include processes, interprocess communication, interprocess synchronization, deadlock, memory allocation, segmentation, paging, resource allocation, scheduling, file systems, storage, devices, protection, security, and privacy.Spring

Prerequisites: CIS 223 or EE 395