Algorithms and Data Structures

Course Details:







Module Overview

The study of algorithms and data structures is fundamental to any computer- science curriculum, but it is not just for programmers and computer-science students. Everyone who uses a computer wants it to run faster or to solve larger problems. They have become essential tools in engineering; and from database systems to internet search engines, they have become essential parts of modern software systems. And these are but a few examples as the scope of computer applications continues to grow.

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations which covers elementary data structures, sorting, and searching, and graph algorithms.

Learning Outcomes

Upon successfully completing the course, you will be able to:

  1. Describe Big O notation

  2. Describe, Implement and Analyze Stacks and Queues

  3. Implement and Analyze selection, insertion, merge, quick sorts

  4. Describe and Implement Priority Queues, Symbol Tables, Binary Search Trees, Hashtables

  5. Describe and Implement Undirected, Directed Graphs with traversing algorithms