Computer Science Essentials: Algorithms

Improve your knowledge of programming, data, and algorithms in computer science

An in-depth understanding of algorithms will help you improve your problem-solving skills and develop an efficient approach to understanding complex issues within software development.

On this course, you’ll learn the essential functions and applications of algorithms within the context of data structures. You’ll also prepare for interviews, solving a variety of problems using your newly gained skills.

Explore the applications of search algorithms and sorting algorithms

Search algorithms help you efficiently retrieve data, whilst sorting algorithms give you the functionality to systematically organise your retrieved data.

On this course, you’ll explore a range of search and sort algorithms, allowing you to assess organisational needs and respond with the most efficient operations.

Learn to conduct complexity analysis on your algorithms and improve your data handling skills

By understanding time and space complexity, you can improve estimates and choose the most efficient algorithm to complete the tasks in your stack.

You’ll learn about tree and graph traversals, equipping you with the skills to tackle different problems, that vary in complexity, using a range of approaches.

Develop your problem solving skills and prepare for software development interviews

Having delved into the processes and functions of algorithms, you’ll then put your knowledge to the test with a selection of interview-level questions.

You’ll be guided through the answers, allowing you to check your working and learning how to demonstrate your understanding to employers.

By the end of this course, you’ll have reinforced your knowledge of data structures and algorithms, and gained experience of potential interview questions, preparing you to jumpstart your career in software development.

This course is designed for those interested in a career in software development who want to deepen their understanding of data structures and algorithms, as well as improving their interview technique within data handling contexts.

• Recursion, searching and sorting
• Introduction to the course
• Recursion
• Searching algorithms
• Bubble sort
• Selection sort
• Insertion sort
• Wrap up
• Sorting, trees, and graphs
• Introduction to Week 2
• Quick and merge sorting
• Tree traversal
• Graph traversal
• Wrap up
• Implementation and questions to consider
• Introduction to Week 3
• Preparing for interview questions
• Questions about two sum, and min and max stack
• Linked list design
• Reverse linked lists
• Binary tree construction
• Wrap up
• More interview questions
• Introduction to Week 4
• Questions about binary trees
• Questions about capital and strings
• Wrap up