Mar 14, 2026  
2026-2027 Undergraduate Academic Catalog 
    
Catalog Navigation
  Catalog Home
  Academic Calendar
  University Overview
  Admissions
  Student Financial Services
  Academic Regulations and Policies
  Degree Programs, Minors, and Certificates
  Degrees, Minors, and Certificates by Department
  Course Descriptions
  The Raider Core
  Applied AI Integration
  Explorer Pathways
  MSOE Honors Program
  Global Opportunities
  Reserve Officers’ Training Corps. (ROTC)
  Administration, Regents, and Advisory Committees
  Departments and Faculty
  Campus Map
  Student Resources
  My Portfolio
HELP
2026-2027 Undergraduate Academic Catalog
Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

CPE 1140 - Transfer Data Structures for Computer Engineers

4 lecture hours 0 lab hours 4 credits
Course Description
This course is utilized to document approved transfer credit in computational data structures from another college, normally as part of an articulation agreement or a transfer advising pathway. It is not intended for regular offering at MSOE. The equivalent course should include the array, linked list, queue, stack, and tree data structures. An introduction to recursion, searching, sorting, and time complexity analysis should be provided. The programming paradigm must be object-oriented programming. The language of instruction must be C++ or Java. 
Prereq: CPE 1040  
Note: Both CPE 1040 and CPE 1140 are required to satisfy the first-year computer programming and data structures requirements for computer engineers at MSOE.
This course meets the following Raider Core CLO Requirement: None
Course Learning Outcomes
Upon successful completion of this course, the student will be able to:
  • Apply algorithmic thinking to design and program computing solutions using common data structures
  • Translate problems into appropriate models and data structures
  • Create data structures using programming language primitives
  • Use common data structures provided by standard libraries  
  • Decompose computing solutions into modules that help manage algorithmic complexity, improve readability, and support testability 
  • Evaluate how well a computing solution solves a problem and, when appropriate, consider the impact of the solution on society
Prerequisites by Topic
  • Structured programming including program entry points, subroutines, and functions
  • Primitive data types including Booleans, characters, strings, integer numbers, and floating-point numbers
  • Assignment, expressions, and operator precedence
  • Sequencing control flow using linear flow and non-linear branching
  • Selection control flow using if-then-else statements and switch-case statements
  • Iterative control flow using do-while loops, while loops, and for loops
  • Data passing using call-by-value and call-by-reference parameters as well as return values
  • Arrays as data containers
  • User input and output
  • Generation of run-time executables, debugging, and testing
Course Topics
  • Structured programming in an object-oriented language
  • Utilization of object-oriented programming principles including abstraction, encapsulation, inheritance, and polymorphism. 
  • Linked lists including the basic operations of insertion, deletion, and traversal 
  • Stacks including the basic operations of insertion and deletion
  • Queues including the basic operations of insertion and deletion
  • Binary trees including the basic operations of insertion, deletion, and traversal 
  • Recursive programming
  • Common sort and search algorithms 
  • Algorithmic complexity analysis using the order of complexity Big O notation
Coordinator
Dr. Russ Meier


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)