University of Minnesota Computer Science Pre Reqs Liberal Arts
Twin Cities campus
 | Twin Cities Campus Computer Science B.A.Computer Science and Engineering
Reckoner science concerns the report of the hardware, software, and theoretical aspects of high-speed computing devices and the awarding of these devices to a broad spectrum of scientific, technological, and business bug. The curriculum gives students a bones understanding of informatics. After completing a required set up of key courses, students tin arrange their subsequent work around one of several emphases inside calculator science. The program prepares students for a variety of industrial, governmental, and business positions involving the use of computers, or for graduate work in the field. Programme Delivery This program is bachelor:
Admission Requirements Students must complete v courses earlier access to the programme. Freshman and transfer students are usually admitted to pre-major status earlier admission to this major. A GPA above 2.0 is preferred for the following:
A 3.two technical GPA or to a higher place will guarantee access. Students applying to the major with below a iii.2 technical GPA will be considered for admission based on infinite bachelor in the program. Information on the Technical GPA can be found z.umn.edu/techgpa There are two entry sequences for introductory calculator science: [CSCI 1133 & CSCI 1933], or [(CSCI 1103 or CSCI 1113) & CSCI 1913]. Students who intend to major in Computer science should accept the 1133-1933 sequence. Students who have AP credit in computer science will receive credit for CSCI 1103 and must take CSCI 1913. Students who are in other majors and would like to transfer to the reckoner science program may choose either sequence. Please notation that the sequences cannot be mixed and matched. Students who take CSCI 1133 must accept CSCI 1933, and students who take either CSCI 1103 or CSCI 1113 must take CSCI 1913. For data about University of Minnesota admission requirements, visit the Part of Admissions website. Mathematics and Computer science Take a full of five courses for 20 credits. CSCI 1133 & 1933 is the recommended sequence. Sequences cannot be mixed and matched. See above note for more information. CSCI 2011 - Discrete Structures of Computer science (four.0 cr) Computer science Introductory Core Selection 1 CSCI 1133 - Introduction to Computing and Programming Concepts (4.0 cr) CSCI 1933 - Introduction to Algorithms and Data Structures (4.0 cr) CSCI 1103 - Introduction to Computer Programming in Coffee (4.0 cr) or CSCI 1113 - Introduction to C/C++ Programming for Scientists and Engineers (four.0 cr) CSCI 1913 - Introduction to Algorithms, Data Structures, and Program Development (iv.0 cr) General Requirements All students in baccalaureate degree programs are required to complete full general University and college requirements including writing and liberal education courses. For more than information about University-wide requirements, see the liberal educational activity requirements. Required courses for the major, minor or certificate in which a student receives a D form (with or without plus or minus) exercise not count toward the major, minor or document (including transfer courses). Program Requirements Students are required to consummate four semester(due south) of any second language. with a grade of C-, or better, or S, or demonstrate proficiency in the language(s) as defined past the department or higher. Students may complete no more than than one degree in the computer science program: a B.A. or a B.S. or a pocket-size. Commencement fall 2012, all incoming CLA freshmen must consummate the appropriate First Yr Feel course sequence. Specific information most this collegiate requirement tin can be found at: http://class.umn.edu/degree_requirements/index.html Major Courses STAT 3021 - Introduction to Probability and Statistics (three.0 cr) CSCI 2021 - Car Architecture and Organization (4.0 cr) CSCI 2033 - Uncomplicated Computational Linear Algebra (4.0 cr) CSCI 2041 - Avant-garde Programming Principles (4.0 cr) CSCI 4041 - Algorithms and Data Structures (iv.0 cr) CSCI 4061 - Introduction to Operating Systems (4.0 cr) Electives No more than 3 credits from CSCI 4970 or 59xx courses may count toward the constituent requirement. Take viii or more than credit(s) from the following: · CSCI 4xxx · CSCI 5xxx Senior Project CSCI 3081W - Program Pattern and Development [WI] (4.0 cr) Upper-sectionalisation Writing Intensive within the major Students are required to take i upper-division Writing Intensive course within the major. If that requirement has not been satisfied within the core major requirements, students must choose one course from the following list. Some of these courses may as well fulfill other major requirements. Take 0 - ane form(southward) from the following: · CSCI 3081W - Program Design and Development [WI] (iv.0 cr) | | | |
MATH 1271 - Calculus I (MATH)
| Credits: | iv.0 [max iv.0] |
| Class Equivalencies: | Math 1271/Math 1281/Math 1371/ |
| Typically offered: | Every Autumn, Spring & Summer |
Differential calculus of functions of a single variable, including polynomial, rational, exponential, and trig functions. Applications, including optimization and related rates problems. Single variable integral calculus, using anti-derivatives and uncomplicated substitution. Applications may include surface area, book, piece of work problems. prereq: 4 yrs high school math including trig or satisfactory score on placement test or grade of at to the lowest degree C- in [1151 or 1155]
MATH 1371 - CSE Calculus I (MATH)
| Credits: | iv.0 [max 4.0] |
| Course Equivalencies: | Math 1271/Math 1281/Math 1371/ |
| Typically offered: | Every Autumn & Spring |
Differentiation of unmarried-variable functions, basics of integration of single-variable functions. Applications: max-min, related rates, area, curve-sketching. Use of calculator, cooperative learning. prereq: CSE or pre-bioprod concurrent registration is required (or immune) in biosys engn (PRE), background in [precalculus, geometry, visualization of functions/graphs], instr consent; familiarity with graphing calculators recommended
MATH 1571H - Honors Calculus I (MATH)
| Credits: | four.0 [max 4.0] |
| Form Equivalencies: | Math 1271/Math 1281/Math 1371/ |
| Grading Ground: | A-F only |
| Typically offered: | Every Autumn |
Differential/integral calculus of functions of a single variable. Emphasizes hard trouble-solving rather than theory. prereq: Honors student and permission of University Honors Program
MATH 1272 - Calculus II
| Credits: | 4.0 [max iv.0] |
| Class Equivalencies: | Math 1272/Math 1282/Math 1372/ |
| Typically offered: | Every Autumn, Jump & Summer |
Techniques of integration. Calculus involving transcendental functions, polar coordinates. Taylor polynomials, vectors/curves in space, cylindrical/spherical coordinates. prereq: [1271 or equiv] with class of at to the lowest degree C-
MATH 1372 - CSE Calculus II
| Credits: | 4.0 [max four.0] |
| Form Equivalencies: | Math 1272/Math 1282/Math 1372/ |
| Typically offered: | Every Spring |
Techniques of integration. Calculus involving transcendental functions, polar coordinates, Taylor polynomials, vectors/curves in space, cylindrical/spherical coordinates. Use of calculators, cooperative learning. prereq: Grade of at to the lowest degree C- in [1371 or equiv], CSE or pre-Bioprod/Biosys Engr
MATH 1572H - Honors Calculus Ii
| Credits: | 4.0 [max four.0] |
| Course Equivalencies: | Math 1272/Math 1282/Math 1372/ |
| Grading Basis: | A-F only |
| Typically offered: | Every Spring |
Continuation of 1571. Infinite series, differential calculus of several variables, introduction to linear algebra. prereq: 1571H, honors student, permission of University Honors Program
CSCI 2011 - Discrete Structures of Computer Science
| Credits: | 4.0 [max 4.0] |
| Grade Equivalencies: | CSci 2011/CSci 2011H |
| Typically offered: | Every Fall & Spring |
Foundations of discrete mathematics. Sets, sequences, functions, big-O, propositional/predicate logic, proof methods, counting methods, recursion/recurrences, relations, trees/graph fundamentals. prereq: MATH 1271 or MATH 1371 or instr consent
CSCI 1133 - Introduction to Calculating and Programming Concepts
| Credits: | 4.0 [max iv.0] |
| Grade Equivalencies: | CSci 1133/CSci 1133H |
| Typically offered: | Every Fall, Jump & Summer |
Cardinal programming concepts using Python language. Problem solving skills, recursion, object-oriented programming. Algorithm development techniques. Use of abstractions/modularity. Data structures/abstract data types. Develop programs to solve real-world bug. prereq: concurrent registration is required (or allowed) in MATH 1271 or concurrent registration is required (or allowed) in MATH 1371 or concurrent registration is required (or allowed) in MATH 1571H or instr consent
CSCI 1933 - Introduction to Algorithms and Data Structures
| Credits: | iv.0 [max 4.0] |
| Course Equivalencies: | CSci 1902/CSci 1933/CSci 1933H |
| Typically offered: | Every Fall, Jump & Summer |
Advanced object oriented programming to implement abstract data types (stacks, queues, linked lists, hash tables, binary trees) using Java linguistic communication. Inheritance. Searching/sorting algorithms. Basic algorithmic assay. Apply of software development tools. Weekly lab. prereq: 1133 or instr consent
CSCI 1103 - Introduction to Calculator Programming in Java
| Credits: | 4.0 [max 4.0] |
| Typically offered: | Every Fall |
Fundamental programming concepts/software evolution using Java linguistic communication. Trouble solving skills. Algorithm development techniques. Use of abstractions/modularity. Data structures/abstract data types. Substantial programming projects. Weekly lab.
CSCI 1113 - Introduction to C/C++ Programming for Scientists and Engineers
| Credits: | 4.0 [max 4.0] |
| Typically offered: | Every Fall, Spring & Summertime |
Programming for scientists/engineers. C/C++ programming constructs, object-oriented programming, software development, fundamental numerical techniques. Exercises/examples from various scientific fields. prereq: Math 1271 or Math 1371 or Math 1571H or instr consent
CSCI 1913 - Introduction to Algorithms, Data Structures, and Program Development
| Credits: | 4.0 [max 4.0] |
| Typically offered: | Every Fall, Jump & Summer |
Advanced object oriented programming to implement abstract data types(stacks, queues, linked lists, hash tables, binary trees) using Java language. Searching/sorting algorithms. Basic algorithmic analysis. Scripting languages using Python language. Substantial programming projects. Weekly lab. prereq: (EE major and EE 1301) or (CmpE major and EE 1301) or 1103 or 1113 or instr consent
STAT 3021 - Introduction to Probability and Statistics
| Credits: | three.0 [max 3.0] |
| Typically offered: | Every Fall, Spring & Summertime |
This is an introductory course in statistics whose primary objectives are to teach students the theory of elementary probability theory and an introduction to the elements of statistical inference, including testing, estimation, and confidence statements. prereq: Math 1272
CSCI 2021 - Car Architecture and Organization
| Credits: | four.0 [max 4.0] |
| Typically offered: | Every Fall & Leap |
Introduction to hardware/software components of computer organisation. Data representation, boolean algebra, car-level programs, education fix architecture, processor organization, memory hierarchy, virtual memory, compiling, linking. Programming in C. prereq: 1913 or 1933 or instr consent
CSCI 2033 - Elementary Computational Linear Algebra
| Credits: | four.0 [max 4.0] |
| Typically offered: | Every Fall & Bound |
Matrices/linear transformations, bones theory. Linear vector spaces. Inner product spaces. Systems of linear equations, Eigenvalues, atypical values. Algorithms/computational matrix methods using MATLAB. Use of matrix methods to solve multifariousness of computer science bug. prereq: [MATH 1271 or MATH 1371], [1113 or 1133 or cognition of programming concepts]
CSCI 2041 - Avant-garde Programming Principles
| Credits: | 4.0 [max iv.0] |
| Typically offered: | Every Fall & Spring |
Principles/techniques for creating correct, robust, modular programs. Computing with symbolic data, recursion/induction, functional programming, impact of evaluation strategies, parallelism. Organizing information/computations around types. Search-based programming, concurrency, modularity. prereq: [1913 or 1933], 2011
CSCI 4041 - Algorithms and Information Structures
| Credits: | 4.0 [max four.0] |
| Grade Equivalencies: | CSci 4041/CSci 4041H |
| Typically offered: | Every Autumn & Bound |
Rigorous analysis of algorithms/implementation. Algorithm assay, sorting algorithms, binary trees, heaps, priority queues, heapsort, balanced binary search trees, AVL trees, hash tables and hashing, graphs, graph traversal, single source shortest path, minimum cost spanning trees. prereq: [(1913 or 1933) and 2011] or instr consent; cannot exist taken for grad CSci cr
CSCI 4061 - Introduction to Operating Systems
| Credits: | iv.0 [max 4.0] |
| Course Equivalencies: | CSci 4061/INet 4001 |
| Typically offered: | Every Autumn & Spring |
Processes/threads, process coordination, interprocess communication, asynchronous events, retentivity management/file systems. Systems programming projects using operating system interfaces and plan development tools. prereq: 2021 or EE 2361; CS upper div, CS pocket-sized, CompE upper div., EE upper div., EE grad, ITI upper div., Univ. honors educatee, or dept. permission; no cr for grads in CSci.
CSCI 3081W - Program Design and Evolution (WI)
| Credits: | four.0 [max four.0] |
| Grade Equivalencies: | CSci 3081W/CSci 4018W/CSci4089 |
| Typically offered: | Every Fall & Spring |
Principles of programming design/analysis. Concepts in software development. Uses a programming project to illustrate key ideas in plan design/development, data structures, debugging, files, I/O, testing, and coding standards. prereq: [2021, 2041]; CS upper div, CS grad, or dept. permission
CSCI 3081W - Programme Design and Development (WI)
| Credits: | 4.0 [max 4.0] |
| Form Equivalencies: | CSci 3081W/CSci 4018W/CSci4089 |
| Typically offered: | Every Fall & Spring |
Principles of programming blueprint/analysis. Concepts in software development. Uses a programming project to illustrate primal ideas in program design/development, information structures, debugging, files, I/O, testing, and coding standards. prereq: [2021, 2041]; CS upper div, CS grad, or dept. permission
Source: https://onestop2.umn.edu/pcas/viewCatalogProgram.do?programID=127&strm=1163&campus=UMNTC
0 Response to "University of Minnesota Computer Science Pre Reqs Liberal Arts"
Post a Comment