Bjorn Larson

This course includes a comprehensive overview of the principles and practices of Agile software development based on Agile community's recent recommendations. The emphasis is on quick realization of system value through disciplined, iterative, and incremental software development techniques and the elimination of wasteful practices.

Computer networks, distributed systems and their systematic design. Introduction to the use, structure, and architecture of computer networks. Networking experiments to describe network topology. ISO reference model. Same course as ECEN 4283. May not be used for degree credit with CS 5383.Prerequisite(s): CS 2133 with a grade of 'C' or better; and CS 3443 or ECEN 3213 with a grade of 'C' or better; UNIX knowledge.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Programming language constructs. Run time behavior of programs. Language definition structure. Control structures and data flow programming paradigms. Previously offered as CS 4363.Prerequisite(s): CS 2133 and (CS 3443 or ECEN 3213), each with a grade of 'C' or better.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133, and CS 3653 or (MATH 3613 and MATH 4663), each with a grade of 'C' or better.

Errors, floating point numbers and operations, interpolation and approximation, solution of nonlinear equations and linear systems, condition and stability, acceleration methods, numerical differentiation and integration. Course previously offered as CS 3223.Prerequisite(s): MATH 2153 with a grade of 'C' or better; MATH 3013 with a grade of 'C' or better, or concurrent enrollment; or MATH 3263 with a grade of 'C' or better and knowledge of programming.

Errors, floating point numbers and operations, interpolation and approximation, solution of nonlinear equations and linear systems, condition and stability, acceleration methods, numerical differentiation and integration. Course previously offered as CS 3223.Prerequisite(s): MATH 2153 with a grade of 'C' or better; MATH 3013 with a grade of 'C' or better, or concurrent enrollment; or MATH 3263 with a grade of 'C' or better and knowledge of programming.

Storage, structures, data and information structures, list processing, trees and tree processing, graphs and graph processing, searching, and sorting. Previously offered as CS 4343 and CS 4344.Prerequisite(s): CS 2133, and CS 3653 or (MATH 3613 and MATH 4663), each with a grade of 'C' or better.

Introduction to computer science using a block-structured high-level computer language, including subprograms, arrays, recursion, records, and abstract data types. Principles of problem solving, debugging, documentation, and good programming practice. Elementary methods of sorting and searching. Use of operating system commands and utilities. Previously offered as CS 2113.Prerequisite(s): MATH 1513 or higher, with a grade of 'C' or better.

Introduction to computer science using a block-structured high-level computer language, including subprograms, arrays, recursion, records, and abstract data types. Principles of problem solving, debugging, documentation, and good programming practice. Elementary methods of sorting and searching. Use of operating system commands and utilities. Previously offered as CS 2113.Prerequisite(s): MATH 1513 or higher, with a grade of 'C' or better.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Recursive algorithms. Intermediate methods of searching and sorting. Mathematical analysis of space and time complexity, worst case, and average case performance. Course previously offered as CS 3333.Prerequisite(s): CS 1113 with a grade of 'C' or better.

Programming language constructs. Run time behavior of programs. Language definition structure. Control structures and data flow programming paradigms. Previously offered as CS 4363.Prerequisite(s): CS 2133 and (CS 3443 or ECEN 3213), each with a grade of 'C' or better.

Introduction to computer science using a block-structured high-level computer language, including subprograms, arrays, recursion, records, and abstract data types. Principles of problem solving, debugging, documentation, and good programming practice. Elementary methods of sorting and searching. Use of operating system commands and utilities. Previously offered as CS 2113.Prerequisite(s): MATH 1513 or higher, with a grade of 'C' or better.

Introduction to computer science using a block-structured high-level computer language, including subprograms, arrays, recursion, records, and abstract data types. Principles of problem solving, debugging, documentation, and good programming practice. Elementary methods of sorting and searching. Use of operating system commands and utilities. Previously offered as CS 2113.Prerequisite(s): MATH 1513 or higher, with a grade of 'C' or better.

Functional and register level description of computer systems, computer structures, addressing techniques, macros, linkage, input-output operations. Introduction to file processing operations and auxiliary storage devices. Programming assignments are implemented in assembly language.Prerequisite(s): CS 2133 with a grade of 'C' or better.

Errors, floating point numbers and operations, interpolation and approximation, solution of nonlinear equations and linear systems, condition and stability, acceleration methods, numerical differentiation and integration. Course previously offered as CS 3223.Prerequisite(s): MATH 2153 with a grade of 'C' or better; MATH 3013 with a grade of 'C' or better, or concurrent enrollment; or MATH 3263 with a grade of 'C' or better and knowledge of programming.

Errors, floating point numbers and operations, interpolation and approximation, solution of nonlinear equations and linear systems, condition and stability, acceleration methods, numerical differentiation and integration. Course previously offered as CS 3223.Prerequisite(s): MATH 2153 with a grade of 'C' or better; MATH 3013 with a grade of 'C' or better, or concurrent enrollment; or MATH 3263 with a grade of 'C' or better and knowledge of programming.