Data Structures and Algorithms with Java

About This Course

Upon successful completion of the Module, the trainee will be able to perform the following specific tasks:

• Understand and apply fundamental concepts related to data structures and algorithms such as arrays, linked lists, hash tables, stacks, queues, trees, and graphs.
• Analyze the computational complexity of algorithms using Big O notation and understand its implications on program performance.
• Use recursion to design and implement recursive algorithms and understand its advantages and limitations.
• Implement sorting algorithms such as bubble sort, insertion sort, selection sort, merge sort & quick sort.
• Implement data structures such as stacks and queues and understand their use in program design.
• Understand the principles of tree structures and implement tree traversal algorithms such as in-order, pre-order, and post-order traversals.
• Understand the principles of graph structures and graph traversal algorithms such as depth-first search and breadth-first search.
• Understand the principles of dynamic programming and apply them to solve problems.