Data Structures and Algorithms II
This course expands students’ knowledge of standard data structures and their algorithms. It is suitable for students who have some knowledge of C syntax and have completed Data Structures and Algorithms I. The course prepares students to design and implement more complex software modules.
PREREQUISITES
Competency with the C programming language is required. Students should have a mathematical background at least to the high school level. Student should have understanding of basic data structures gained through completion of Data Structures & Algorithms I.
Upon completion of this course, students will be able to:
- Explain what is meant by a one-way hash
- Use a Map to find duplicates in a list
- Outline how a public key exchange works in non-technical terms
- Explain common pitfalls when working with cryptography
- Compare and Contrast compression opportunities
- Explain what a Graph is and how it is useful
- Use a Graph to determine connectedness
- Outline how Dijkstra’s Algorithm works on paper
- Priority Queues
- Hashing
- Compression
- Cryptography
- Graphs
- Adjacency Lists
- Adjacency Matrices
- Path Algorithms
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. Asynchronous 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.