Available courses

Provides pre-engineering majors, and students interested in engineering and computer science disciplines, with the skills, information, and knowledge necessary to promote academic success and career development. Topics include: setting academic goals, selecting a major, career preparation, developing verbal and written communication abilities, as well as critical thinking, studying, and time management skills.  Corequisites: EGG 101Prerequisites: MATH 96. 2 credits.

Algorithms from systems programming including conversion, buffering, device drivers, assemblers, and loaders. Use of system services, macros, and linkage conventions. Laboratory exercises programmed in assembly language.   Prerequisites: CPE 100 - Computer and Logic Design I and CS 135 - Computer Science I (or other high-level language course).

 

Introduction to sequential and linked structures.  File access including sequential, indexed sequential and other file organizations.  Internal structures including stacks, queues, trees, and graphs.  Algorithms for implementing and manipulating structured objects. Big-O-notation.  Prerequisites: CS 202 and MATH 181. 3 credits.

This course will teach the concepts and techniques of databases for real-time web and big data applications. The course will focus primarily on NoSQL, object oriented, and XML databases.  Topics include characteristics and significance of NoSQL databases, NoSQL data formats, key and value pairs, basic schema in NoSQL, and table structures and data types. Projects in SQLite, MongoDB, and Postgres will be developed to show the capabilities of these databases. Crosslisted with ITE 451. Credit at the 600 level requires additional work.

Operating systems organization, sharing and allocation of system resources, protection mechanisms, and integration of system components. Prerequisites: CS 302 and either CS 219 or ECG 300. 3 credits.

Structured approach to programming and problem solving in FORTRAN.  Emphasis placed on problem solving, algorithm development problems encountered in science and engineering, and techniques of good programming style.  Prerequisite: MATH 181. 3 credits.

Introduction to sequential and linked structures.  File access including sequential, indexed sequential and other file organizations.  Internal structures including stacks, queues, trees, and graphs.  Algorithms for implementing and manipulating structured objects. Big-O-notation.  Prerequisites: CS 202 and MATH 181. 3 credits.

Problem-solving methods and algorithm development in a high-level programming language. Program design, coding, debugging, and documentation using techniques of good programming style. Program development in a powerful operating environment.  Prerequisites: MATH 127 or MATH 128