Undergraduate Courses

Credit Hours: 3

Coordinator: David Keathly

Textbook:

Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion, Abelson, Ledeen, Lewis, Pearson. This book is freely available on the web.

Course Outcomes:

1. Students will practice and enhance their creative abilities within the development of software.
2. Students will use abstraction to reduce information and detail in order to facilitate focus on relevant topics. In software this typically occurs both in designing algorithms and creating modules within their programs.
3. Students will access and summarize available data to create information and evaluate information to create knowledge.
4. Students will develop, evaluate and use algorithms in defining solutions to computational problems.
5. Students will create software that enables problem solving, human expression and creation of knowledge.
6. Students will both describe how the internet pervades modern computing and make effective and ethical use of the internet in solving problems.
7. Students will recognize, discuss and describe the global impacts of computing.

Credit Hours: 4

Prerequisites:

High school algebra or equivalent

Textbook:

Introduction to C Programming, Retzlaff, Kendall Hunt Publishers, ISBN 9780757594359

Course Outcomes:

1. Understand programming and problem solving.
2. Understand and be able to develop algorithms.
3. Be able to develop, design and implement simple computer programs.
4. Understand how to perform basic debugging of existing programs.
5. Understand functions and parameter passing.
6. Be able to do numeric (algebraic) and string based computation.

Credit Hours: 4

Coordinator: David Keathly

Prerequisites:

MATH 1650 with a grade of C or better

Textbook:

Zybooks: https://learn.zybooks.com/signin code is available at semester start

Course Outcomes:

1. Describe how a computer's CPU, Main Memory, Secondary Storage and I/O work together to execute a computer program.
2. Make use of a computer system's hardware, editor(s), operating system, system software and network to build computer software and submit that software for grading.
3. Describe algorithms to perform simple tasks such as numeric computation, searching and sorting, choosing among several options, string manipulation, and use of pseudo-random numbers in simulation of such tasks as rolling dice.
4. Write readable, efficient and correct C/C++ programs that include programming structures such as assignment statements, selection statements, loops, arrays, pointers, console and file I/O, structures, command line arguments, both standard library and user-defined functions, and multiple header (.h) and code (.c) files.
5. Use commonly accepted practices and tools to find and fix runtime and logical errors in software.
6. Describe a software process model that can be used to develop significant applications composed of hundreds of functions.
7. Perform the steps necessary to edit, compile, link and execute C/C++ programs.

Credit Hours: 4

Prerequisites:

MATH 1650

Credit Hours: 3

Coordinator: David Keathly

Prerequisites:

CSCE 1030, Corequisite: MATH 1710

Textbook:

Zybooks: https://zybooks.zyante.com/#/signin; code is available at semester start

Course Outcomes:

1. Write readable, efficient, and correct C++ programs for all programming constructs defined for Programming Fundamentals I plus dynamic memory allocation, bit manipulation operators, exceptions, classes and inheritance.
2. Design and implement recursive algorithms in C/C++.
3. Use common data structures and techniques such as stacks, queues, linked lists, trees and hashing.
4. Create programs using the Standard Template Library.
5. Use a symbolic debugger to find and fix runtime and logical errors in C software.
6. Using a software process model, design and implement a significant software application in C++. Significant software in this context means a software application with at least five files, ten functions and a make file.
7. Implement, compile and run C++ programs that includes classes, inheritance, virtual functions, function overloading and overriding, as well as other aspects of Polymorphism.

Credit Hours: 3

Prerequisites:

CSCE 1035

Credit Hours: 3

Coordinator: Ian Parberry

Prerequisites:

CSCE 1040; Corequisite: CSCE 2110

Textbook:

Zybooks: https://zybooks.zyante.com/#/signin; code is available at semester start

Course Outcomes:

1. Demonstrate a solid foundation in conceptual and formal models by describing loop structures in summation and/or product notation.
2. Use abstraction in the design and implementation of algorithms.
3. Design programming solutions to “simple” problems and implement those designs in C or C++.
4. Apply big-Oh notation to evaluate and compare algorithms and programs.
5. Use combinatorics and conditional probability in solving real-world problems.
6. Define the basic operations of sets, functions, relations, trees and graphs.
7. Demonstrate an introductory knowledge of formal languages by using regular expressions, deterministic finite automata and non-deterministic finite automata to describe patterns in strings.

Credit Hours: 3

Coordinator: Ian Parberry

Prerequisites:

CSCE 1040; Corequisite: CSCE 2100

Textbook:

Zybooks: https://zybooks.zyante.com/#/signin; code is available at semester start

Course Outcomes:

1. Use of graph data structures in design of software.
2. Use of table data structures in design of software.
3. Use of set data structures in design of software.
4. Use of C++ classes to implement graphs, sets and relational data structures.
5. Use of context-free grammars to describe patterns.
6. The ability to describe assertions in propositional logic form.
7. Use of amortized analysis to evaluate efficiency of data structure such as splay trees and O(1) expansion of tables.

Credit Hours: 3

Coordinator: Krishna Kavi

Prerequisites:

CSCE 2100. Corequisite(s): ENGR 2720 and ENGR 2730 (taken concurrently)

Textbook:

Computer Organization and Design: ARM Edition; Kaufmann, Elsevier Publishing. ISBN 9780128017333

Course Outcomes:

1. Understand the role of the different classes and components in a computer system and the interface between software and hardware in a computer system.
2. Apply metrics to evaluate performance of a computer system using clock rate and clock cycles per instruction (CPI). Understand the different aspects of execution times reported when program complete their execution.
3. Understand instruction set choices and write assembly language programs for simple C code and codes that include procedures.
4. Perform integer and floating point calculations using computer arithmetic algorithms.
5. Describe the organization of a simple processor with data path and control path for simple instructions.
6. Describe the requirement of memory hierarchy and evaluate the performance of different cache organizations.

Credit Hours: 3

Coordinator: Stephanie Ludi

Prerequisites:

Admission to the Honors College, freshman or sophomore class status, consent of Honors College dean

Credit Hours: 3

Coordinator: Robert Akl

Prerequisites:

ENGR 2405; ENGR 2415; and MATH 2730 or MATH 3410

Textbook:

Signals and Systems, 3rd Edition; Roberts, McGraw-Hill.     ISBN 9780078028120

Course Outcomes:

1. Understand the mathematical descriptions of continuous-time (CT) and discrete-time (DT) signals.
2. Understand the characteristics and properties of real systems.
3. Analyze signals and systems in both the time and frequency domain.
4. Gain experience with CT and DT Fourier series.
5. Apply the properties of the Fourier transform, Laplace transform and z-transform to real systems.

Credit Hours: 3

Coordinator: Robert Akl

Prerequisites:

CSCE 3010

Textbook:

Signals and Systems, 3rd Edition; Roberts, McGraw-Hill.     ISBN 9780073380681

Course Outcomes:

1. Analyze the frequency response of communication systems.
2. Represent continuous-time signals by samples.
3. Determine the energy and power spectral density of signals.
4. Plot pole-zero diagrams.
5. Design analog and digital filters.

Credit Hours: 3

Coordinator: Paul Tarau

Prerequisites:

CSCE 2100

Textbook:

Introduction to Parallel Computing, Grama, Karypis, Kumar, Gupta, 2nd edition 2003, ISBN 9780201648652

Course Outcomes:

1. Differentiate between different types of parallel and distributed systems.
2. Understand heterogeneous systems and accelerators.
3. Write parallel programs for shared memory and GPU based systems.
4. Analyze speed up achieved by parallel implementations of applications.
5. Tune parallel programs to improve their performance.
6. Apply parallel algorithms to solve matrix, graph, searching and sorting problems.

Credit Hours: 3

Coordinator: David Keathly

Prerequisites:

CSCE 2100

Textbook:

Lecture Notes, Slides and Online Resources. http://www.cse.unt.edu/~garlick/

Course Outcomes:

1. Demonstrate the use of good project management techniques and tools in the development of a management plan for an IT project.
2. Demonstrate an understanding of the unique management requirements of different types of IT Systems projects.
3. Develop a management plan and budget for an IT project.
4. Demonstrate an understanding of team management and conflict resolution skills through a number of small management projects.
5. Create a system lifecycle document for a sample problem including all components using the Unified Modeling Language.

Credit Hours: 3

Coordinator: Farhad Shahrokhi

Prerequisites:

CSCE 2100 and CSCE 2110

Textbook:

Data Structures & Algorithm Analysis in C++, Mark Weiss, 2013, ISBN 9780132847377

Course Outcomes:

1. Understand time complexity of algorithms.
2. Be able to solve recurrence relations.
3. Understand and be able to analyze the performance of data structures for searching, including balanced trees, hash tables, and priority queues.
4. Apply graphs in the context of data structures, including different representations, and analyze the usage of different data structures in the implementation of elementary graph algorithms including depth-first search, breadth-first search, topological ordering, Prim's algorithm, and Kruskal's algorithm.
5. Be able to code the above-listed algorithms.

Credit Hours: 3

Prerequisites:

MATH 1650

This course is for non-computer science and engineering majors.

Experience with Python is helpful as it is used extensively in the course, but significant prior programming experience with any language will be sufficient.

Credit Hours: 3

Prerequisites:

CSCE 2100 and CSCE 2110

Textbook:

Artificial Intelligence w/Common LISP, 1st edition, Noyes, Jones & Bartlett, ISBN 9780669194739

Course Outcomes:

1. Understand Lisp data types, internal functions, advanced Lisp objects and abstractions.
2. Understand the design principles of artificial intelligence.
3. Understand basic principles of Search, two player games and neural networks.
4. Understand one or more application in Artificial Intelligence.

Credit Hours: 3

Prerequisites:

MATH 1650

This course is for non-computer science and engineering majors.

Experience with Python is helpful as it is used extensively in the course, but significant prior programming experience with any language will be sufficient.

Course Outcomes:

Credit Hours: 3

Coordinator: Stephanie Ludi

Prerequisites:

CSCE 2100 and CSCE 2110

Textbook:

100 Things Every Designer Needs; Weinschenk, Pearson.     ISBN 9780321767530     

Don't make me Think! Revisited; Krug, Pearson                       ISBN 9780321965516

Course Outcomes:

1. Demonstrate knowledge of the contemporary best practices for user interface design.

2. Perform the different phases of the interface design process.

3. Demonstrate knowledge of user modeling and show how these models affect the design of an interface. 

4. Demonstrate that they can design and develop a computer-user interface using appropriate techniques.

5. Perform different types of evaluations of interfaces.