|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
For those persons having an interest in finding out what a computer is (and is not), the types of problems suited for computers, and how to utilize a computer to solve problems. The organization and characteristics of computers; application of commercial software such as word processors, spreadsheets, database packages, and communications packages.
-
3.00 Credits
An introduction to the computer, to the algorithmic process, and to programming using basic control and data structures, using a procedural language. Prerequisite: MATH 1302 (or concurrently).
-
3.00 Credits
An introduction to the computer, to the algorithmic process, and to programming using basic control and data structures. Prerequisite: MATH 1323 (or concurrently).
-
3.00 Credits
Programming concepts beyond basic control and data structures. Emphasis is given to data structures including linked-lists and trees as well as modular design consistent with software engineering principles. Prerequisite: CSE 1104, CSE 1105, CSE 1310 (or CSE 1311), and MATH 1323 (or concurrently).
-
3.00 Credits
Program design and implementation using Java. Object-oriented concepts, basic Unified Modeling Language (UML) modeling, collection classes, generics, reflection, reusability, and introduction to design patterns. Projects involve extensive programming and may include user interfaces and multithreading. Prerequisite: CSE 1320.
-
3.00 Credits
New developments in the field of computer science and engineering. Topic may vary from semester to semester. May be repeated for credit when topic changes. Departmental approval required in advance to use for degree credit. Prerequisite: consent of advisor.
-
0.00 Credits
Sophomore level undergraduate research course. Prerequisites: Departmental good standing and permission of instructor. May be taken a maximum of 3 times.
-
3.00 Credits
Computer organization from the viewpoint of software, including: the memory hierarchy, instruction set architectures, memory addressing, input-output, integer and floating-point representation and arithmetic. The relationship of higher-level programming languages to the operating system and to instruction set architecture are explored. Some programming in an assembly language. Prerequisite: CSE 1320.
-
3.00 Credits
Propositional and predicate logic, mathematical proof techniques, sets, combinatorics, functions and relations, graphs, and graph algorithms. Prerequisites: CSE 1310 and MATH 1426.
-
3.00 Credits
Design and analysis of algorithms with an emphasis on data structures. Approaches to analyzing lower bounds on problems and upper bounds on algorithms. Classical algorithm design techniques including algorithms for sorting, searching, and other operations on data structures such as hash tables, trees, graphs, strings, and advanced data structures, dynamic programming and greedy approaches. Prerequisite: CSE 1320 and CSE 2315.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|