Welcome to Data Structures and Algorithms C++

 Welcome to Data Structures and Algorithms C++

Goal: 

        To develop proficiency in the specification, representation, and implementation of Data Types
        and Data Structures.

Important things should be known after studying this course:

     * Introduce Big Oh, Theta and Omega notations.

     * Apply Big Oh to calculate complexities of algorithms.

     * Implement Linear list and single, circular and doubly linked lists.

     * Implement stacks, queues and tables using linear and linked representation.

     * Use Linear and Binary Search.

     * Discuss Tree concepts and apply operations such as traversal, searching, insertion, updating and         deletion on trees.

     * Work with Binary Tree and Binary Search Tree (BST).

     * Implement Tree traversal (Preorder, Inorder and PostOrder) techniques.

     * Use Insertion, Selection, Bubble, Quick, Merge, Radix sorting.

     * Discuss Graph Theory and its notations.

     * Discuss hashing techniques.

     * Use various algorithms to perform operations such as insertion, searching, updating and deletion         on various data structures.

IT Society blog Team