Month 4 · Week 15 of 40

Stacks, Queues & Hash Tables

Master abstract data types and constant-time lookups.

Enroll Now to Start Week 15 View Month 4 Overview

Week Overview

Implement Last-In-First-Out stacks and First-In-First-Out queues. Then dive into hash tables, hash functions, and collision resolution techniques.

Core Concepts & Topics

Stack Operations (push, pop, peek) with Arrays and Linked Lists

Queue Operations (enqueue, dequeue) & Circular Buffers

Hash Functions & Modulo Arithmetic

Collision Resolution: Chaining vs Open Addressing

Designing a Custom Hash Map

Hands-On Challenge

Week 15 Project: Syntax validator for balanced parentheses and arithmetic expression evaluator.

Every week at DoxaTech Hub requires submitting real working code tested by our automated grading suite. You will push code to your personal GitHub repository, open pull requests, and receive instant feedback.

Frequently Asked Questions

What is hash collision?

A collision occurs when two distinct keys produce the exact same hash code. Hash tables handle this through chaining (linked lists) or open addressing (probing).

Week 14: Singly & Doubly Linked Lists

Week 16: Sorting Algorithms & Binary Search

Interactive Learning