Nov 24, 2024  
2024-2025 Undergraduate Academic Catalog-June 
    
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
  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
2024-2025 Undergraduate Academic Catalog-June
Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

CSC 1120A - Data Structures and Graphical Interfaces

4 lecture hours 2 lab hours 4 credits
Course Description
This course covers graphical user interfaces and event-driven programming as well as the organization of data and the algorithms that act upon them. The “A” course provides additional student support with an additional meeting time each week. Various sorting algorithms and data structures are covered. The topics of arrays, linked lists, stacks, queues, trees, sets, and hash tables are introduced. Fundamentals of algorithm performance are also introduced, with an emphasis placed on time complexity analysis. Laboratory activities include implementation of data structures as well as development of GUI applications that apply data structures from standard libraries.
Prereq: CSC 1110  or CSC 1110A  (quarter system prereqs: CS 1021)
Note: Students may receive credit for only one of CSC 1020 , CSC 1120 , and CSC 1120A.
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:
  • Understand and apply complex data structures and algorithms
  • Use appropriate algorithms (and associated data structures) to solve problems
  • Have a thorough understanding of commonly used library data structures
  • Analyze the time complexity of algorithms
  • Understand the use of recursion in problem solving
  • Interpret and implement multiple sorting algorithms
  • Use data structures in software design and implementation
  • Apply standard library data structures in software design
  • Select appropriate data structures for a given application
  • Write unit tests to verify software behavior
  • Use Git to manage versioning of source code
  • Understand the event-driven programming model
  • Design and implement applications with graphical user interfaces
Prerequisites by Topic
  • Java programming fundamentals
  • Control structures
  • Looping
  • Classes
  • Interfaces
  • Inheritance
  • Exception handling
  • File input and output
Coordinator
Dr. Chris Taylor


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