Other related course:

ITC 2017: https://sites.google.com/view/itc-ucp-2017

PF/OOP 2018: https://sites.google.com/view/pf-ucp-2018/

DM 2017: https://sites.google.com/view/ds-ucp-2017/home

DSA 2017: https://sites.google.com/view/dsa-ucp2017

Algo 2017: https://sites.google.com/view/algo-ucp-2017/home

Algo 2019: https://sites.google.com/view/algo-ucp-2019/home

Algo 2020: https://sites.google.com/view/algo-ucp-2020/home

Algo 2021: https://sites.google.com/view/algo-itu-2021/home

Lecture 1 - The Story of Data Structures Begins

• • • • The Central Question of Data structures

      • We started with variable data structures

        • • • Their pros

            • Their limitation

      • We moved to static arrays

        • • • Their applications

              • • Sorting

                • Searching

            • Their issues

      • Dynamic Arrays

        • • • Growable Array with fixed addition

              • • Its push_back function time complexity analysis

            • Vector Implementation

              • • Its push_back function time complexity analysis

            • Arraylist implementation

              • • Its push_back function time complexity analysis (exercise)

Lecture # 1 -Video Lecture

(Unfortunately we lost this lectures recording, you may see the previous year recording)

Lecture 2 - Dynamic Arrays and Templates

• • • • Dynamic Arrays

        • • • Growable Array with fixed addition

              • • Its push_back function time complexity analysis

            • Vector Implementation

              • • Its push_back function time complexity analysis

            • Arraylist implementation

              • • Its push_back function time complexity analysis (exercise)

      • Using Templates

Lecture # 2 -Video Lecture

Lecture 3 - Stack Data Structures

• • • • Stack Data Structures

        • • • FIXED SIZE STACK

              • • Its ADT (multiple implementations)

                • Push/Pop/To multiple versions

            • Applications of STACK

              • • Decimal to any base converter

            • Dynamic Stack

              • • Using Vector implementation

Lecture # 3 -Video Lecture

Lecture 4 - Stack/Queues Data Structures

• • • • Stack Data Structures

        • • 1. Discussion on Parenthesis balancing problem

            2. Maintaining Minimum and Maximum in Stack

               • • Maintaining three stacks

                 • Maintaining one stack of augmented entry

            3. QUEUE Data Structures

            4. Circular Queue

            5. Queue Using Two Stacks

               • Steueue

            6. Dequeue

Lecture # 4 -Video Lecture

Lecture 5 - Expression Evaluator (Infix to Postfix Notation)

• • • Expression Evaluator

      • • N^2 Algorithm

    • Infix to Postfix Convertor

      • • Postfix Expression solver

Notes from GeeksforGeeks

Lecture # 5-A-Video Lecture

Lecture # 5-B-Video Lecture

Lecture 6 - Time Complexity

• • • Which algorithm is faster

      • • • • Big-O (Upper Bound)

              • • Logarithmic function

            • little o

            • Big Omega

            • Little Omega

            • Big Theta

Lecture # 6 -Notes

Lecture # 6-A -Video Lecture

Lecture # 6-B -Video Lecture

Lecture 7 - Recursion

• • • Introduction to recursion

    • Call stack and recursion

    • Sum(N)

    • Power(2,N)

    • Decimal to binary converter

    • GCD with a powerful technique

    • Fast Power

    • Fibonacci

    • Fibonacci with Dynamic Programming(Memoization )

Lecture # 7 -Video Lecture

Lecture 8 - Building the Forward Linked List

• • • The problems with Vector Data Structures

      • Building the Train Data Structures

      • Printing the Train

      • Inserting in the Train

      • Why Tail Pointer is needed?

      • Add Front/Tail

      • Discussion on Remove

Lecture # 8 -Video Lecture

Lecture 9 - Iterators

• • • Revising Forward Linked List

      • Handaling important cases

      • Compact code vs clear code

    • Introduction to iterators

      • Introduction to subclasses

      • Implementing forward Iterator as a subclass of list

      • The auto keyword

Lecture # 9 -Video Lecture

Lecture 10 - Building the Doubly Linked List

• • • Revision of Iterators

      • Insert at nth index (but it takes O(n))

      • Insert at nth index (O(1) solution)

    • Introduction to Doubly Linked List

      • Implementing a Doubly linked list

      • Real-life Applications of a Doubly Linked list(chrome tabs, operating system process management, etc)

    • Mini Project Discussion

Lecture # 10 -Video Lecture

Mini Excel implementation session

Lecture 11 - Binary Search Tree

• • • Discussion about our journey in data structures.

    • problem with the linked list

    • Introduction to BSTree

      • Implementing BSTree class

        • Insert()

        • Search()

        • BSTiterators()

        • SpecialPrint()

Lecture # 11 -Video Lecture

Lecture 12 - BST applications using recursion

• • • Discussion of pros and cons of different data structures

    • Use of abstraction in OOP

    • BSTree Traversals

      • Inorder Traversal

      • Preorder Traversal

      • Postorder Traversal

    • Solving problems using traversals

      • FindTreeSize()

      • CountLeaves()

      • EqualTree()

      • PicEqual()

      • Val&PicEqual()

      • Height()

Lecture # 12 -Video Lecture

Lecture 13 - BST applications continued

• • • Discussion of assignment

      • Printing Traversals

      • PrintallLeaves()

      • Print all nodes at K distance from the root

      • PrimeCount()

      • EvenCount() and OddCount()

      • PicEqual()

      • Val&PicEqual()

      • DeleteAllLeaves()

      • Recursive TreeMinimum() and TreeMaximum()

Lecture # 13 -Video Lecture

Lecture 14- Binary Search Tree Assignment tutorial

• • • Discussion about BSTree Assignment

      • Section I

        • Discussed 25 questions

      • Section II

        • Discussed 3 questions

      • Section III

        • Discussed 11 questions

Lecture # 14 -Video Lecture

Lecture 15 - Heap data structure and disk sort

• • • Introduction to the Binary Heap data structure

      • Max Heap

      • Min Heap

      • Insert()

      • Internal storage

      • Increase/Decrease Key

      • Height and Depth in a Binary Heap

      • Sorting using Heap

      • An interesting interview question

        • Disk Sort

Lecture # 15 -Video Lecture

Lecture 16 - DOS Shell assignment

• • • Discussion about the DOS project idea

    • Discussion about the DOS shell implementation

    • Discussion about providing a text editor in the DOS Shell to edit files

    • C++ implementation of DOS shell and text editor

Lecture # 16-A-Video Lecture

Lecture # 16-B-Video Lecture

Lecture # 16-C-Video Lecture

Lecture 17 - External Sort

• • • Sorting large data(Problem limited RAM)

    • The Idea of loading data in chunks

    • Making Struct Fval

    • Using Priority Queue

Lecture # 17 -Video Lecture

Lecture 18 - AVL Trees

• • • The story of data structures

    • Problem with the binary tree-O(n)

    • Introduction to the AVL tree

      • Balanced binary tree

      • Zig operation

      • Zag operation

      • Complexity Analysis

Lecture # 18 -Video Lecture

Lecture 19 - AVL Tree, Skip List, and Splay Trees.

• • • AVL Trees

      • Three cases of Insertion

    • Splay Trees

      • Insertion

      • Deletion

    • Skip List

      • Deterministic Skip List

      • Randomized Skip List

    • Theoretical and Practical Analysis

Lecture # 19 -Video Lecture