Binary Search Trees

import { YtQuiz} from '../js/yt-quiz.js';

Hash Tables 1: Introduction

Hash Tables 2: Python’s Dictionary

questions2 = [
    {
        time: "4:04",
        question: "Continue when ready.",
        answers: [ ],
        correct: "Continue when ready.",
    },
    {
        time: "10:06",
        question: "Continue when ready.",
        answers: [ ],
        correct: "Continue when ready.",
    },
]
yt2 = new YtQuiz("mt8zZWZpeus", questions2);
yt2.html();

Hash Tables 3: Applications

questions3 = [
    {
        time: "2:32",
        question: "What is a brute-force method for solving the two-sum problem?",
        answers: [ ],
        correct: "Add all pairs of numbers and check if the sum is the target.",
    },
]
yt3 = new YtQuiz("6u6gLifduoQ", questions3);
yt3.html();

Hash Tables 4: Overview

Hash Tables 5: Collisions

questions5 = [
    {
        time: "01:27",
        question: "How many people do I need to have for a 50% chance that two have the same birthday?",
        answers: [
            "367",
            "57",
            "184",
            "23",
        ],
        correct: 3
    },
    {
        time: "04:05",
        question: "What are the probabilities?",
        answers: [ ],
        correct: "Continue when ready.",
    },
    {
        time: "04:24",
        question: "What is the chance of collision when inserting the first item?",
        answers: [ ],
        correct: "0% (no possible collision)",
    },
    {
        time: "04:35",
        question: "What is the chance of collision when inserting the second item?",
        answers: [ ],
        correct: "1% chance (the second object collides with the first)",
    },
    {
        time: "04:59 ",
        question: "What is the chance of collision when inserting the third item?",
        answers: [ ],
        correct: "2% chance",
    }
]
yt5 = new YtQuiz("BVIPVXeT48Q", questions5);
yt5.html();

Hash Tables 6: Collision Handling

questions6 = [
    {
        time: "01:29",
        question: "Where should we put the 'C'?",
        answers: [
            "In bucket 2",
            "At the head of bucket 1",
            "At the tail of bucket 1",
        ],
        correct: 1
    },
    {
        time: "3:56",
        question: "What makes linear probing less than optimal?",
        answers: [ ],
        correct: "Values have a tendency to cluster together, which makes the probe sequence long.",
    },
    {
        time: "6:25",
        question: "What collision handling method does this older version of a Python dictionary resemble?",
        answers: [
            "Separate chaining",
            "Open addressing",
        ],
        correct: 1
    },
]
yt6 = new YtQuiz("uQttlsnmMOw", questions6);
yt6.html();

Hash Tables 7: Hash Functions

questions7 = [
    {
        time: "00:32",
        question: "What hash function would maximize collisions?",
        answers: [ ],
        correct: "Always return the same number."
    },
]
yt7 = new YtQuiz("vEsA1_1WIH0", questions7);
yt7.html();