Data Structure and Algorithm with C++

(DS-ALGO-CPLUS.AP1.0L0)
Lab
Get A Free Trial

Skills You’ll Get

1

Programming: A General Overview

  • Using Recursive Function
  • Resizing a Matrix
2

Algorithm Analysis

  • Implementing the Bisection Method
  • Finding Minimum Subsequence Sum
  • Implementing Binary Search
3

Lists, Stacks, and Queues

  • Implementing the STL find Routine
  • Working with Lists
  • Converting an Infix Expression to Postfix
  • Checking for Balancing Brackets
  • Reversing a Singly Linked List
  • Implementing a Stack Class
  • Implementing a Dequeue using a Linked List
4

Trees

  • Implementing a Depth-First Traversal in the Child-Sibling Tree
  • Converting a Tree into Graph-Assembler Instructions
  • Using the findMax Function
  • Generating an AVL Tree
  • Inserting a Node into an AVL Tree
  • Implementing a Splay Tree
  • Working with Binary Tree
  • Implementing a B-Tree
  • Inserting Keys into the B-Tree
  • Implementing the map Class
  • Implementing a Splay Tree
5

Hashing

  • Counting Number of Collisions
  • Implementing Hopscotch Hashing
  • Implementing Cuckoo Hashing
  • Implementing Extendible Hashing
6

Priority Queues (Heaps)

  • Merging Two Max Heaps
  • Implementing Insert Operation in a Binomial Queue
7

Sorting

  • Implementing Insertion Sort using STL
  • Implementing Mergesort without Recursion
  • Implementing the Selection Sort Algorithm
8

The Disjoint Sets Class

  • Printing a Maze
9

Graph Algorithms

  • Implementing a Topological Sorting Algorithm
  • Solving a Single Source Shortest Path Problem
  • Implementing Union Function in Kruskal's Algorithm
10

Algorithm Design Techniques

  • Solving the Longest Common Subsequence Problem

Related Courses

All Courses
scroll to top