Course Course Summary Section 1 Content Section 1 Content Left Section 1 Content Right Credit Type: Course ACE ID: UMBC-0008 Organization's ID: TCPRG4001 Organization: UMBC Training Centers, LLC Location: Classroom-based Length: 80 hours Dates Offered: 10/1/2020 - 9/30/2023 1/1/2017 - 6/30/2020 Credit Recommendation & Competencies Section 2 Content Section 2 Content Left Section 2 Content Right Level Credits (SH) Subject Lower-Division Baccalaureate 3 Data Structures I Description Section 3 Content Section 3 Content Left Section 3 Content Right Objective: The course objective is to enable students to understand, recognize, and manipulate basic data structures such as linked lists and trees. Learning Outcomes: Given a linked list implementation, implement a queue Implement a linked list from scratch Explain the difference between an ADT and a data structure Explain what is meant by Big-O complexity Classify simple algorithms by their Big-O complexity Given a linked list implementation, implement a stack Describe the difference between a heap and a tree Implement a simple binary tree from scratch Implement a binary search Implement a sorting algorithm General Topics: Algebra, complexity analysis, abstract data types, arrays, linked lists, stacks, queues, trees, heaps, binary search trees, sorting, and searching Instruction & Assessment Section 4 Content Section 4 Content Left Section 4 Content Right Instructional Strategies: Classroom Exercise Lectures Practical Exercises Methods of Assessment: Other skills demonstration Minimum Passing Score: 70% Supplemental Materials Section 5 Content Section 5 Content Left Section 5 Content Right Section 6 Content Section 6 Content Left Section 6 Content Right Button Content Rail Content 1 Page Content