Data Structures and Algorithms I
This course introduces students to standard data structures and algorithms. It is suitable for students who have some knowledge of C syntax, yet have little or no training in software architecture and development. The course prepares students to design and implement software modules.
Competency with the C programming language is required. Students should have a mathematical background at least to the high school level.
Upon completion of this course, students will be able to:
- Upon completion of the course, the student will be able to:
- Explain what is meant by Big-O Complexity
- Classify simple algorithms by their Big-O Complexity
- Explain the difference between an ADT and a Data Structure
- Implement a Linked List from scratch
- Given a Linked List implementation, implement a Stack
- Given a Linked List implementation, implement a Queue
- Describe the difference between a Heap and a Tree
- Implement a simple Binary Tree from scratch
- Implement a Binary Search
- Implement a Sorting Algorithm
Register 21 days before class start date and save 10%! Enter discount code EARLY10 during registration.
Register 21 days before class start date and save $250! Enter discount code EARLY250 during registration.
- Complexity Analysis
- Abstract Data Types
- Linked Lists
- Binary Search Trees
- Self-Balancing Trees
Is there a discount available for current students?
UMBC students and alumni, as well as students who have previously taken a public training course with UMBC Training Centers are eligible for a 10% discount, capped at $250. Please provide a copy of your UMBC student ID or an unofficial transcript or the name of the UMBC Training Centers course you have completed. Online courses are excluded from this offer.
What is the cancellation and refund policy?
Student will receive a refund of paid registration fees only if UMBC Training Centers receives a notice of cancellation at least 10 business days prior to the class start date for classes or the exam date for exams.