Computer Science Essentials: Data Structures
Improve your data handling and organisation skills by understanding the fundamentals of data structure with this online course from Packt.
Duration
3 weeks
Weekly study
3 hours
100% online
How it works
Unlimited subscription
Learn more
Efficient data organisation is vital when handling large amounts of data, particularly within large organisations.
On this course, you’ll delve into data structure processes, improving your data handling skills and boosting your career prospects in data and development sectors.
Before diving into data structure, you’ll explore Big O notation, memory, and logarithms, ensuring you have the foundational knowledge to understand in-depth data structure applications.
By applying this theory, you’ll be equipped to assess code base complexity and improve project delivery estimates.
Data can be grouped into primitive or non-primitive data structures and a working knowledge of both will give you the edge against less experienced candidates at interview.
You’ll discover the features of both types of data and learn the operations within linear and non-linear structures.
By understanding this terminology, you’ll be able to easily scale your work up to handle big data and provide solutions within large organisations.
Data structure is a cornerstone of a developer’s coding knowledge, improving your understanding of code and helping you create solutions to complex data problems.
You’ll explore common operations including arrays, hash tables, heaps, and graphs, learning how to apply them in real-world scenarios.
By the end of this course, you’ll have improved your problem-solving approach using data structures and also have the skills to demonstrate a deep understanding of complex coding issues in various contexts.
Welcome to Computer Science Essentials: Data Structures and the start of your learning journey, brought to you by Packt.
In this activity, we will discuss what Big O notation is and how to use it.
In this activity, we will describe the more complex concepts related to Big O notation and it’s uses.
In this activity, we will identify the core fundamentals of memory and logarithms in computer science.
You have reached the end of Week 1. In this activity, you'll reflect on what you have learned.
Welcome to Week 2. In this activity we'll highlight the main topics that will be covered this week.
In this activity, we will discuss arrays as linear data structures.
In this activity, we will discuss linked lists as a fundamental data structure.
In this activity, we will discuss stack, queue, and hash tables as data structures.
You have reached the end of Week 2. In this activity, you'll reflect on what you have learned.
Welcome to Week 3. In this activity we'll highlight the main topics that will be covered this week.
In this activity, we will discuss the various types of trees as data structures and how they are used.
In this activity, we will discuss heaps, tries and graphs as data structures and their application in computer science.
You have reached the end of Week 3. In this activity, you'll reflect on what you have learned.
More courses you might like
Learners who joined this course have also enjoyed these courses.
©2025 onlincourse.com. All rights reserved