RE QUIRE MENTS FOR THE BACHE LOR OF SCI ENCE IN COM PUTER SCI ENCE/MASTER OF SCIENCE B.S. Por tion of the Pro gram Ac cred ited by the Com put ing Ac cred i ta tion Com mis sion of ABET, http://www.abet.org

COLLEGE OF ENGINEERINGTHE UNI VER SITY OF OKLAHOMA

For Stu dents En ter ing the Oklahoma State System

for Higher Ed u ca tion Summer 2015 through

Spring 2016

GEN ERAL RE QUIRE MENTS Com puter Sci ence A235

Bach e lor of Sci ence in Computer Sci ence/Mas ter of Science (Com puter Sci ence)

F235 Q146

To tal Credit Hours . . . . . . . . . . . . . . . . . . . . . 138-142•Min i mum Re ten tion/Grad u a tion Grade Point Av er ages:Over all - Com bined and OU . . . . . . . . . . . . . . . . . . . 3.25Ma jor - Com bined and OU . . . . . . . . . . . . . . . . . . . . 3.25Cur ric u lum - Com bined and OU . . . . . . . . . . . . . . . . . 3.25A min i mum grade of C is re quired for each course in the cur ric u lum.

OU en cour ages stu dents to com plete at least 29 hours of ap pli ca ble coursework each year to have the op por tu nity to grad u ate in five years.

Year FIRST SE MES TER Hours SEC OND SE MES TER Hours

FRES

HM

AN

ENGL 1113, Prin. of Eng lish Com po si tion (Core I) MATH 1914, Dif fer en tial and In te gral Cal cu lus I (Core I)P SC ENGR

1113, Amer i can Fed eral Gov ern ment (Core III) 1411, Fresh man En gi neer ing Ex pe ri ence

§C S 1323, Intro. to Com puter Pro gram ming†Ap proved Elec tive: Ar tis tic Forms (Core IV)

343133

ENGL 1213, Prin. of Eng lish Com po si tion (Core I), or EXPO 1213, Ex pos i tory Writ ing (Core I)MATH 2924, Dif fer en tial and In te gral Cal cu lus IIC S 2334, Pro gram ming Struc tures & Ab strac tions

#†Ap proved Elec tive: Nat u ral Sci ence (Core II)#Open Elec tive

3

44

3-50-2

TO TAL CREDIT HOURS 17 TO TAL CREDIT HOURS 16

SOPH

OM

OR

E MATH 2934, Dif fer en tial and In te gral Cal cu lus IIIC S 2603, Applied Logic for Hard ware & Soft ware PHYS 1311, Gen eral Phys ics Lab IPHYS 2514, Gen eral Physi cs for En gi neeri ng & Sci ence

Ma jors (Core II)†Ap proved Elec tive: So cial Sci ence (Core III)

43

0-14

3

C SC SC S

2813, Dis crete Structures 2413, Data Struc tures2613, Com puter Or ga ni za tion

#†Ap proved Elec tive: Nat u ral Sci ence (Core II)

#Open Elec tive

333

3-5

0-2

TO TAL CREDIT HOURS 14-15 TO TAL CREDIT HOURS 14

JUN

IOR

MATH 3113, Intro. to Or di nary Dif fer en tial Equa tions, or MATH 3413, Phys i cal Math e mat ics ICOMM 2613, Pub lic Speak ing

3113, Intro. to Op er at ing Sys temsC S C S C S

3202, Soft ware Re quire ments & Spec i fi ca tions 3823, The ory of Com pu ta tion

3

3323

3153, Tech ni cal Writ ing, orENGL B C 2813, Busi ness Com mu ni ca tion§MATH 3333, Lin ear Al ge bra

3053, Hu man Com puter In ter ac tionC S C S 3323, Prin ci ples of Pro gram ming Lan guages1 of the fol low ing 3 courses:

MATH 4753, Ap plied Sta tis ti cal Meth ods, orISE 3293, Ap plied En gi neer ing Sta tis tics, or

MATH 4743, Intro. to Math e mati cal Sta tis tics

3

333

3

TO TAL CREDIT HOURS 14 TO TAL CREDIT HOURS 15

SEN

IOR

†Approved Elective: Western Civ. & Culture (Core IV)

4263, Soft ware En gi neer ing I4413, Al go rithm Anal y sis4513, Da ta base Man age ment Sys tems

C S C S C SC S G4000/5000 Ap proved Elect ive, or MATH 4073, Nu mer i cal Anal y sis

3333

3

HIST 1483, U.S., 1492-1865, or 1493, U.S., 1865-Pres ent (Core IV)

C S C S‡C S

4273, Soft ware En gi neer ing II (Cap stone) G4000/5000 Ap proved Elec tive Ap proved Elec tive

†Ap proved Elec tive: Non-West ern Cul ture (Core IV)

3

3333

TO TAL CREDIT HOURS 15 TO TAL CREDIT HOURS 15Stu dents are el i gi ble for grad u ate sta tus upon grad u a tion with the Bach e lor of Sci ence in Com puter Sci ence.

FIFT

H

YEA

R G5000-level Approved ElectiveG5000-level Approved ElectiveG5000-level C S Elective

333

G5000-level Ap proved Elect ive5000-level C S ElectivesC S 5990 or C S seminar course

33-6

TO TAL CREDIT HOURS 9 TO TAL CREDIT HOURS 9-12Students may enter the accelerated program based on the undergraduate degree pattern offered in the year they first enrolled in the Oklahoma State System of Higher Education or later. NOTE: Engi neer ing trans fer stu dents may take ENGR 3511 in place of ENGR 1411.Courses designated as Core I, II, III, IV or Capstone are part of the General Education curriculum. Students must complete a minimum of 40 hours of General Education courses, chosen from the approved list.†To be cho sen from the University-Wide General Education Approved Course List. Three of these 12 hours must be up per-di vi sion (3000-4000). See list in the Class Sched ule.Stu dents must suc cess fully com plete pre req ui site courses (with a mini mum C grade) bef ore pro ceed ing to the next course.• Two college- level courses in a sin gle for eign lan guage are re quired; this may be sat is fied by suc cess ful com ple tion of 2 years in a sin gle for eign lan guage in high school. Stu dents who must take for eign

language at the Uni ver sity will have an ad di tional 6-10 hours of course work.#At least one of the Nat u ral Sci ence courses must be a non-Phys ics course. The num ber of cred its in Core II nat u ral sci ence and open elec tives must be 14 credit hours or more. All sci ence courses

must be for sci ence or en gi neer ing ma jors.

‡To be cho sen from C S 4013, 4323, 4513, 4613, 4973 or any C S 5000-level course.An other lab o ra tory sci ence Core II course may be sub sti tuted for PHYS 1311.At least one of these three MATH courses must be com pleted.Stu dents must choose the foll ow ing for these four elect ives: one The ory elec tive; two Sys tems elec tives; and one Ap pli ca tions elec tives. No more than one of these courses may be at the 4000-level. Courses for the areas are from the approved list from the School of Computer Science.No more than two enrollments (six hours) in 5970, “Graduate Seminar” courses are allowed.§ Hon ors Col lege stu dents may sub sti tute C S 3960 for ENGL 3153/B C 2813 and C S 3980 for an ap proved C S elec tive. Both C S 3960 and 3980 must be com pleted.The sis op tion re quires a to tal of 9 hours of 5000-level elec tives, which must in clude six hours of C S 5980. Non-the sis op tion re quires a to tal of 12 hours of 5000-level elec tives.MATH 1823, 2423, 2433, and 2443 se quence can be sub sti tuted for MATH 1914, 2924, and 2934.

3-14

3

Com puter Sci ence-BS/MS—A235/F235 Q146—Page 2COURSES IN COM PUTER SCI ENCE (C S)1323 In tro duc tion to Com puter Pro gram ming. Pre req ui site: Math e mat ics 1523 or concurrent enrollment, or placement into Mathematics 1743 or Mathematics 1823 or higher. In tro duc tion to the de sign and im ple men ta tion of com puter soft ware with an em pha sis on ab strac tion and pro gram or ga ni za tion. (F, Sp)2334 Pro gram ming Struc tures and Ab strac tions. Pre req ui site: 1323 and Math e mat ics 1523 or higher. The design and implementation of computer programs using disciplined methodologies. Use of ab stract data types such as stacks, queues, lists, sets, maps. Software reuse through encapsulations, composition, aggregation, inheritance, polymorphism, and generics. Structured approached to graphical user interface development and error handling. Binary and character based file processing. A pro gram design tool will be used. Introduction to ethics in computer science, including philosophical ethics theories. Discussion of intellectual property rights and privacy. (F, Sp)2413 Data Structures. Pre req ui site: 2334 and Mathematics 1823 or 1914; and 2813 or Mathemati cs 2513, or con cur rent en roll ment in 2813 or Math e mati cs 2513. Rep re sen ta tion, analysis and im ple men ta tion of widely used data structures and associated algo rithms. Discussion of algo rithms employ ing data struc tures with anal y sis. Writ ten com mu ni ca tions required in some projects. Discus sion of eth i cal issues includ ing computer crime, abuse, and hacker ethics. Tools and tech niques used in writing secure appli ca tions will also be discussed. Windows operat ing system will be used. A debug ging tool will be used. (F, Sp)2603 Applied Logic for Hardware and Software. Prerequisite: 1323 and Mathemat ics 1823 or1914 with a C or better. Applications of logic in the analysis of hardware and software components. Top ics include prop o sitional and predicate calculus, Boolean algebra, combinational and sequen tial circuits, num ber sys tems and cir cuits for arith me tic, sets, in duc tive def i ni tions, proof techniques includ ing natu ral deduction, equational rea son ing and mathematical induction. (F, Sp) 2613 Computer Organiza tion. Pre req ui site: 2603. An in tro duc tion to the ar chi tec ture, organization and de sign of uniprocessor-based com puter systems. Top ics include pro cessor, control and memory de sign and or ga ni za tion, pipelining and vec tor pro cess ing, com puter arithmetic, I/O orga ni za tion, and com puter sys tems se cu rity. (F, Sp)2813 Discrete Structures. Prerequisite: 2603 or Electrical and Computer Engi neer ing 2213 or 2214. Introduction to the theory of discrete structures useful in computer science. Topics include combinatorics, relations, func tions, computational complexity, recurrences, and graph theory. (F, Sp) 3053 Hu man Computer In ter ac tion. Pre req ui site: 2413 and 2813 or Mathemat ics 2513. An introduction to human-computer in ter ac tion and graph i cal user in ter faces. Top ics include principles of human-com puter inter ac tion, hu man cog ni tive abil i ties, interface anal y sis and design, win dow systems, and so cial im pli ca tions of com put ing. Cur rent in ter face pro gram ming tools will be described and used. Oral presentations are required for some assign ments. (Sp) 3113 In tro duc tion to Op er at ing Sys tems. Pre req ui site: 2413 and 2813 or Math e mat ics 2513, and either 2613 or Elect rical and Computer Engineering 3223. An introduction to the major concepts (including memory management, process management, information management, and com puter secu rity) and tech niques of de sign ing and imple ment ing operat ing systems. Class projects re quire the design of medium-scale software systems. The Unix operating system will be used. A performance evaluation tool will be used. (F)3202 Software Requirements and Specifications. Prerquisite: 2413 and 2813 or Mathematics 2513. Students gain technical and non-technical professional skills by performing requirements engineering, and learn the tools, techniques, and methods for modeling software systems. Topics include requirements elicitation, prototyping, functional and non-fundctional requirements, and tracking. Students practice written and oral communication skills in eliciting and documenting requirements from users, consider the impact of computing on individuals, organizations, and society in the creation of requirements and specifications for a computational system, and demonstrate their ability to engage in lifelong learning by gaining background in a domain outside of their own. (F) 3323 Prin ci ples of Pro gramming Lan guages. Prerequisite: C S 2413, and C S 2813 or MATH 2513, and ENGL 3153 or BC 2813 as a prerequisite or concurrent enrollment. Study of the theoretical foundations and principles that form the basis of programming language design; introduction to the functional programming paradigm. (Sp) 3823 Theory of Computation. Prerequisite: CS 2813 or CS 5005 or MATH 2513. Introduction to abstract machine theory and formal language theory. Topics include Turing machines, finite/pushdown automata, deterministic versus nondeterministic computations, context-free grammars, and mathematical properties of these systems. (F) G4013 Ar ti fi cial In tell i gence (Slashlisted with 5013). Prerequisite: CS 2413 or CS 5005, and CS 2813 or CS 4005 or MATH 2513. Study of the methods of search, knowledge representation, heuristics, and other aspects of automating the solution of problems requiring intelligence. No student may earn credit for both 4013 and 5013. (Sp) 4023 In tro duc tion to In tel li gent Ro bot ics (Slashlisted with 5023). Pre req ui site: 2413, and 2813 or Math e mat ics 2513. His tory of in tel li gent ro bot ics; func tional mod els ap proach; re ac tive robots; ethology for ro bot ics; ar chi tect ures and meth od ol o gies; im ple men tat ion; sens ing; hy brid de lib er a tive/reac tive ro bot ics; multi-ro bot sys tems; nav i ga tion; top o log i cal path plan ning; met ric path plan ning; localization and map ping. No stu dent may earn credit for both 4023 and 5023. (F) 4033 Ma chine Learn ing. (Slashlisted with 5033). Pre req ui sites: 2413 and 2813 or Math e mat ics 2513, and Math e mat ics 4753 or En gi neer ing 3293 or In dus trial En gi neer ing 3293 or Math e mat ics 4743, and Mathematics 3333. Top ics in clude de ci sion trees, re la tional learn ing, neu ral net works, Bayesian learn ing, reinforce ment learn ing, mul ti ple-in stance learn ing, fea ture se lec tion, learn ing ap pro pri ate rep re sen ta tions, clustering, and ker nel meth ods. No stu dent may earn credit for both 4033 and 5033. (F)4053 Com puter Graphics (Slashlisted with 5053). Pre req ui site: 2413 and 2813 or Mathe mat ics 2513,and Math e mat ics 3333. An in tro duc tion to com puter graphics. Top ics include co or di nate sys tems, trans for ma tions, ren der ing in both two and three di men sions, and graphi cal pro gram ming. No stu dent may earn credit for both 4053 and 5053. (F) 4073 Computer Game Development. Prerequisite: 3113, 4053, Mathematics 3333, and Physics 2514. Introduction to the process of developing, maintaining, enhancing, adapting, or refactoring a computer based game. Students will work in project teams using an existing game engine. A software development process will be used. Software development tools will be used. Students will practice oral and written communication skills. (Irreg.)4113 Op er at ing Syst ems The ory (Slashlisted with 5113). Pre req ui site: 3113 and Mathemat ics 4753 or In dus trial En gi neer ing 3293 or Math e mat ics 4743 or En gi neer ing 3293. Continu a tion of study from 3113. Ad vanced top ics and ex am ples and sim u la tion tech niques used in per for mance eval u a tion. No stu dent may earn credit for both 4113 and 5113. (Sp) 4133 Data Net works (Slashlisted with 5133). Pre req ui site: 3113 or per mis sion of in struct or. Compre hen sive treat ment of data net work ing prin ci ples in clud ing: lay ered pro to col de sign and their func tions, tools for per for mance anal y sis, multi-ac cess com mu ni ca tion, rout ing and flow control. No stu dent may earn credit for both 4133 and 5133. (F)

4263 Soft ware En gi neer ing I. Prerequisite: C S 3323 and COMM 2613 and ENGL 3153 or B C 2813, and Computer Science major or minor. No students may obtain credit for CS 4263 and CS 5213. Methods and tools for software specification, design, and documentation. Emphasis on architectural modularity, encapsulation of software objects, and software development processes such as design review, code inspection, and defect tracking. Students working in teams apply these ideas to design and document software products. Study of professional ethics, responsibility, and liability. (F) †G4273 Soft ware En gi neeri ng II. Prerequisite: C S 3053 and C S 4263 and C S major or C S minor. No student may obtain credit for CS 4273 and CS 5213. Methods and tools for software development, testing, and delivery. Emphasis on data abstraction and reusable components. Students working in teams implement a significant software product, including design documents, user's guide, and process reports, using methods and processes studied in Software Engineering I. Students will practice oral and written communication skills. (Sp) G4323 Com piler Con struc tion. Pre req ui site: 2413 and 3823. In tro duc tion to the the ory and implemen ta tion of pro gram ming lan guage com pil ers and in ter pret ers. Class pro jects re quire the design of me dium scale soft ware sys tems. (Sp)G4413 Al go rithm Anal y sis. Prerequisite: CS 2413 or CS 5005, and CS 2813 or CS 4005 or MATH 2513. Design and analysis of algorithms and measurement of their complexity. (F) 4433 Com pu tat ional Meth ods in Dis crete Op ti mi za tion (Slashlisted with 5433). Pre req ui site: Mathemat ics 3333 and 4413 or con cur rent en roll ment in 4413. Lin ear pro gram ming: sim plex method for LP prob lems, de gen er acy and anticycling strat e gies, du al ity the ory and com ple men tary slackness con di tions, re vised sim plex method, sen si tiv ity anal y sis and sim plex method for gen eral LP prob lems. Net work op ti mi zat ion: the trans ship ment prob lem, net work sim plex method, short est path al go rithms, the maxi mum flow probl em, and the pri mal dual method. No stu dent may earn credit for both 4433 and 5433. (F)G4513 Da ta base Man age ment Sys tems. Prerequisite: CS 2413 or CS 5005, and CS 2813 or CS 4005 or MATH 2513. The design and implementation of a DBMS including data models, query languages, entity-relationship diagrams, functional dependencies, normalization, storage structures, access methods, query processing, transaction management, web-enabled applications, and administration. The impact of databases on individuals, organizations, and society, and legal and professional responsibilities including security and privacy will be discussed. A commercial DBMS is used. Students practice written communication skills. (F) G4613 Com puter Ar chi tec ture (Crosslisted with Elec tri cal and Com puter En gi neer ing 4613). Prereq ui site: 2613 or Elec tri cal and Com puter En gi neer ing 3223, or 4004. Cov ers ba sic con cepts of computer sys tem de sign and com mu ni ca tion be tween com po nents, along with cur rent and historical ex am ples of com puter ar chi tec ture. (F, Sp)4743 Sci en tific Com puti ng I (Slashlisted with 5743). Prerequisite: MATH 3333. Interaction between applications, architectures, and algorithms. Review of linear algebra, serial, pipelined vector processors, cluster of processors. Measures of proformance of parallel algorithms. Parallel algorithms for the solution of linear systems. No student may earn credit for both 4743 and 5743. (F) 4823 Cryptography (Slashlisted with 5823). Prerequisite: 3823 and 4413. Elementary number theory, time complexity for doing arithmetic, finite fields, RSA, discrete logarithm and Diffie-Hellman, zero-knowledge protocols and oblivious transfer. Basic elliptic curve cryptosystems, elliptic curve factorization and primality proving. No student may earn credit for both 4823 and 5823. (Sp) 4973 Spe cial Top ics. Pre req ui site: 2413 and per mis sion of in struc tor. May be re peated with change of sub ject mat ter; max i mum credit nine hours. A spe cial top ics course ne ces si tated by the rapidly chang ing na ture of com puter sci ences. Top ics of fered un der this num ber will be ac cepted as approved Com puter Sci ence elec tives for Com puter Sci ence ma jors. (Irreg.)

COURSES IN EN GI NEER ING (ENGR)1411 Freshman Engineering Experience. Prerequisite: declared major in Engineering or permission of instructor. Required of all entering freshmen with a declared Engineering major. Lecture hours cover a variety of topics including: majors and minors; career planning; advising; and extra-curricular activities. Students also work on multi-disciplinary engineering projects in smaller groups during the lab hour. (F)

COURSES IN MATH E MAT ICS (MATH)1914 Dif fer en tial and In te gral Cal cu lus I. Pre req ui site: sat is fac tory score on the place ment test or, for incom ing fresh men di rect from high school, sat is fac tory score on the ACT/SAT. Du pli cates three hours of 1823 and one hour of 2423. Lim its and con ti nu ity, dif fer en ti a tion, ap pli ca tions of differentiation to op ti mi za tion and curve sketch ing, in te gra tion, the fun da men tal the o rem of calculus, the sub sti tution rule, ap pli ca tions of in te gra tion to com pu ta tion of areas. (F, Sp, Su) [I-M] 2924 Dif fer en tial and Inte gral Cal cu lus II. Pre req ui site: 1914 with a grade of C or better. Duplicates two hours of 2423 and two hours of 2433. Fur ther ap pli ca tions of in te gra tion, the nat u ral logarith mic and ex po nen tial func tions, in de ter mi nate forms, tech niques of integVectors ra tion, improper integrals, para met ric curves and po lar co or di nates, in fi nite se quences and se ries. (F, Sp, Su) 2934 Dif fer en tial and In te gral Cal cu lus III. Pre req ui site: 2924 with a grade of C or better. Duplicates one hour of 2433 and three hours of 2443. Vec tors and vec tor func tions, func tions of several vari ables, par tial dif fer en ti a tion and gra dients, mul ti ple in te gra tion, line and sur face integrals, Green-Stokes-Gauss theorems. (F, Sp, Su)†G3113 In tro duc tion to Or di nary Dif fer en tial Equa tions. Pre req ui site: MATH 2423 or MATH 2924. Duplicates two hours of 3413. First or der or di nary dif fer en tial equa tions, lin ear dif fer en tial equations with con stant co ef fi cients, two-by-two lin ear sys tems, Laplace trans for ma tions, phase planes and sta bil ity. (F, Sp, Su)†G3333 Linear Algebra I. Prerequisite: MATH 2433 or MATH 2934 or permission of instructor. Systems of linear equations, determinants, finite dimensional vector spaces, linear transformations and matrices, characteristic values and vectors. (F, Sp, Su)†G3413 Physical Mathematics I. Prerequisite: MATH 2443 or MATH 2934 or concurrent enrollment. Complex numbers and functions. Fourier series, solution methods for ordinary differential equations and partial differential equations, Laplace transforms, series solutions, Legendre’s equation. Duplicates two hours of 3113. (F)G4073 Nu mer i cal Anal y sis. Pre req ui site: 3113 or 3413. So lu tion of lin ear and non lin ear equations, ap prox i ma tion of func tions, nu mer i cal in te gra tion and dif fer en ti a tion, in tro duc tion to analysis of con ver gence and er rors, pit falls in au to matic com pu ta tion, one-step meth ods in the solutions of ordinary differential equations. (F)4743 In tro duc tion to Math e mat i cal Sta tis tics (Slashlisted with 5743). Pre req ui site: 4733. Mathemat i cal de vel op ment of ba sic con cepts in sta tis tics: es ti ma tion, hy poth e sis test ing, sam pling from nor mal and other pop u la tions, re gres sion, good ness-of-fit. No stu dent may earn credit for both 4743 and 5743. (Sp)G4753 Applied Statistical Methods. Prerequisite: MATH 2123 or MATH 2423 or MATH 2924 or permission of instructor. Estimation, hypothesis testing, analysis of variance, regression and correlation, goodness-of-fit, other topics as time permits. Emphasis on applications of statistical methods. (F, Sp, Su)