Overview

Introduction

The Understand Algorithm and Data Structure module provides you with the instructions and devices to develop your hands on skills in the following topics.

  • Stacks
  • Queues
  • Linked Lists

You will install and be familiar with the common functions of productivity software like word processing, spreadsheet, email and basic database.

Exercise 1 - Working with Stacks

In this exercise, you will learn to work with stacks. You will develop a C# class to perform stack implementation using an array. You will then develop a C# program that consumes the stack implementation.

A stack is a basic type of linear data structure where insertion and deletion of items take place. You can perform three operations on stacks such as inserting an item into a stack (push), deleting an item from the stack (pop) and displaying the stack contents.

Exercise 2 - Working with Queues

In this exercise, you will learn to create a new class to implement a queue using an array.

A queue is a basic type of linear data structure used in programming. You can interpret queue with its literal meaning. The first item in a queue is the first one to be served. Queues follow the First In First Out (FIFO) process.

Exercise 3 - Working with Linked Lists

In this exercise, you will learn to create a singly linked list and doubly linked list and perform insert, delete and retrieval operations on the list.

Linked list is a data structure that contains group of nodes and forms a sequence. Every node is linked with the next node to form a chain. Singly linked list and doubly linked list are the two basic types of linked list.

Comprehensive Learning

See the full benefits of our immersive learning experience with interactive courses and guided career paths.