CSD 335 Algorithms and Data Structures

• Explain the basic principles of algorithm analysis and Big O notation
• Implement elementary data structures such as arrays, linked lists, and strings
• Explain and implement stack and queue data structures using different underlying data structures
• Explain the differences in approach and efficiency of recursive algorithms, divide and conquer algorithms, and dynamic programming
• Implement tree data structures, including binary search trees
• Use different tree traversal techniques
• Implement, analyze, and compare efficiency of different elementary searching algorithms such as selection, insertion, and shell sorts 
• Sort linked lists
• Describe, implement, and analyze efficiency of quicksort and merge sort algorithms
• Explain and implement priority queue and heap data structures
• Analyze and implement algorithms associated with priority queue and heap data structures, including heapsort
• Explain, compare, and implement different search algorithms and search data structures, including varieties of binary search trees and hash tables
• Explain graph properties and types, and implement different graph representations
• Describe different graph search algorithms
• Explain, implement, and analyze minimum spanning trees algorithms

• demonstrate competency in software engineering, software testing principles, and quality assurance techniques
• identify, evaluate, and apply efficient algorithms and technologies required for developing software system
• be prepared to obtain an entry-level position at a software development company