Rs. 699 Rs. 499
Byte-Sized-Chunks: Stacks, Queues, Binary Trees, Heaps
Build a strong foundation in algorithms by mastering it through the most effective technique of learning- visualization. In this course, you will learn Big-O notation and complexity, Stacks, Queues, Trees and Heaps.
Stack: Stack is a linear structure represented by a real physical stack or pile. It is a structure where insertion and removal of items takes place at an end called - top of the stack.
Queue: Queue is an abstract data structure, which is quite similar to stack. When compare to to Stack, queue is opened at both ends. One end is at all times used to insert data (enqueue) and the other is used to eliminate data (dequeue).
Binary tree: Binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. It is implemented mainly using Links.
By the end of this course you will:
- Design and implement software that use fundamental data structures
- Visualise common data structures and the algorithms applied to them
- Understand the trade-offs, complexity and use-cases for different types of container data structures
Prerequisites and Target Audience
Basic knowledge of programming is necessary. Knowledge in Java would be preferable.
This tutorial is designed for:
- Computer Science and Engineering graduates who are looking to visualise data structures and internalise how they work
- Experienced software engineers who want to brush-up on important fundamental concepts