Description
Study arrays, linked lists, stacks, queues and hash tables. The course introduces Big O notation as a basis for comparing operations.
The available sections treat each linear data structure and hash tables separately. The official series uses Java examples while focusing on concepts transferable to other programming languages.
This available collection was added to MEGA on 10 October 2021. It contains the named course version and curriculum; a recent update or complete current provider catalogue has not been verified.
What you will learn
- Compare algorithm operations using Big O notation.
- Implement array and linked-list operations.
- Build stack and queue behaviours.
- Store and look up data with hash tables.
Course specifications
- Publisher
- CodeWithMosh
- Instructors
- Mosh Hamedani
- Video Files
- 88
- Total Files
- 95
- Collection Added
- 2021-10-10
- Language
- English
- Duration
- 5 hours (official listing)
- Level
- Beginner
Course topics
- 1. Getting Started
- 2. The Big O Notation
- 3. Arrays
- 4. Linked Lists
- 5. Stacks
- 6. Queues
- 7. Hash Tables
Prerequisites
- Basic programming with variables, loops and conditional statements.
Pictures
AI Feders artworkIntroduction video
How to open the files
Open this course’s MEGA folder using the download link. Select the files or folders you need in MEGA; the course files are stored there.
The collection may contain video recordings, matching subtitles, exercises and project archives. Keep associated subtitles beside the video files.
Download resources
Choose one edition and keep its parts together. Alternate providers are available when listed.
Size
5.99 GiB
Leave a Reply
Signed-in member comments appear immediately.