Introduction to Data Structures
In this free online course, study one of the most important and basic aspects of computer science, data structures.Publisher: William Fiset
Share This Course And
CertificationView course modules
Suppose you are in charge of assigning a waiting line of customers to service desks and there are some customers with higher priority ratings than others, how would you assign these customers to the available desks? You will probably want to have the customers with higher priority taken care of first right? Let us take a hospital as a case study. Suppose you have several patients, say A to E. Patient A is in labour, B is having a fracture in the arms, C is having problems with sleeping, D is having stomach ache and E is having a fracture and aching stomach at the same time. Which of Patients A – E will you give the highest priority? Most likely patient A. Wait! How would you structure these patients and their information so that the system will automatically prioritize these patients based on the information you provided? This is where Data Structures (DS) comes in. How would you like to be able to take care of that queue efficiently – making sure the customers that need to be attended to first, are attended to first? Fortunately, computer science has made adequate provision for these and this course is lightning ready to unleash this information to you. Apart from the DS to handle queuing problem, so many other DS that handles other everyday problems are featured in this course.
This course begins by introducing you to the meaning of data structures and goes further to talk about arrays and linked Lists of data structures. Moving on, the course will expose you to some other data structures like stacks, queues and priority queues. Do you know that some data structures are similar to some others with just a little touch of advanced features? You will learn about the difference between queues, priority queues and indexed priority queues and you will see how these can be used to solve some important problems. How about having the chance to see implementation codes run live on each of the data structures discussed? This course was designed with great simplicity and it was put together by a renowned and seasoned subject matter expert. After discussing priority queues, you will learn about other data structures like Union Find, Binary Search Trees, Hash tables, Fenwick trees, Suffix arrays and more.
Are you a computer science student who is looking to acquire some of the most needed computer science skills in the world today? This course will move you multiple steps forward to achieving your dream. The course is suitable for you even if you have zero knowledge of coding as it can help you start from scratch. You will also get the chance to see a live implementation of codes. Are you a business person who is looking to acquire new skills that can help your business grow? This course will be of great value to you. Learning how to code your business problem away isn’t a bad idea, is it? Are you a professional who is already in the computer science field? This is a course that can boost your value in the labour market. Start this course now and watch your career grow!Start Course Now
Introduction to Data Structures
Introduction to Data Structures - Learning Outcomes
What is a Data Structure?
Arrays and Linked Lists
Introduction to Data Structures - Lesson Summary
Stacks and Queues
Stacks and Queues - Learning Outcomes
Understanding Stack Operations
Understanding Queueing Operations
Stacks and Queues - Lesson Summary
Union Find and Binary Search Trees
Union Find and Binary Search Trees - Learning Outcomes
Union Find/Disjoin Set
Binary Search Trees
Union Find and Binary Search Trees - Lesson Summary
Hash Tables, Fenwick Tree and Suffix Array
Hash Tables, Fenwick Tree and Suffix Array - Learning Outcomes
Understanding Hash Tables
Hash Tables, Fenwick Tree and Suffix Array - Lesson Summary
AVL Tree, Indexed Priority Queue and Sparse Tables
AVL Tree, Indexed Priority Queue and Sparse Tables - Learning Outcomes
BBSTs and The AVL Tree
Indexed Priority Queue
AVL Tree, Indexed Priority Queue and Sparse Tables - Lesson Summary
At the end of this course you should be able to:
- Explain the meaning of Data Structure.
- Outline when and where static arrays can be used.
- Differentiate between singly and doubly-linked lists.
- Explain how to push nodes into a stack with a singly linked list.
- Describe how Union Find operations can be applied in Kruskal's Minimum Spanning Tree.
- List the steps involved in adding elements to a Binary Search Tree (BST).
- Differentiate between a hash, hash table and hash function.
- Demonstrate how a Fenwick tree can be constructed using the linear construction method.
- Outline different types of Balanced Binary Search Tree.
- Describe how a Sparse Table can be constructed.
All Alison courses are free to enrol, study and complete. To successfully complete this Certificate course and become an Alison Graduate, you need to achieve 80% or higher in each course assessment. Once you have completed this Certificate course, you have the option to acquire an official Certificate, which is a great way to share your achievement with the world. Your Alison Certificate is:
Ideal for sharing with potential employers - include it in your CV, professional social media profiles and job applications
An indication of your commitment to continuously learn, upskill and achieve high results
An incentive for you to continue empowering yourself through lifelong learning
Alison offers 3 types of Certificates for completed Certificate courses:
Digital Certificate - a downloadable Certificate in PDF format, immediately available to you when you complete your purchase
Certificate - a physical version of your officially branded and security-marked Certificate, posted to you with FREE shipping
Framed Certificate - a physical version of your officially branded and security-marked Certificate in a stylish frame, posted to you with FREE shipping
All Certificates are available to purchase through the Alison Shop. For more information on purchasing Alison Certificates, please visit our FAQs. If you decide not to purchase your Alison Certificate, you can still demonstrate your achievement by sharing your Learner Record or Learner Achievement Verification, both of which are accessible from your Dashboard. For more details on our Certificate pricing, please visit our Pricing Page.