Data Structures and Algorithmic Analysis

View original course

301 study materials · 7 sections

This course provides a comprehensive exploration of fundamental data structures and the algorithms used to manipulate them. Students learn to analyze computational complexity using Big O notation while implementing linear structures like linked lists, stacks, and queues. The curriculum advances into non-linear structures including Binary Search Trees, Balanced Trees, and Directed Graphs, alongside essential sorting and shortest-path algorithms.

Course Sections

Union-Find and Big O Analysis

Key concepts: Big O Notation · Dynamic Connectivity · Quick-Find · Quick-Union · Weighted Quick-Union

Introduction to algorithmic efficiency and the dynamic connectivity problem using Union-Find algorithms.

Linear Data Structures

Key concepts: Singly Linked Lists · Doubly Linked Lists · Circular Linked Lists · Stacks (LIFO) · Queues (FIFO) · Resizing Arrays

Implementation and application of fundamental linear structures including Linked Lists, Stacks, and Queues.

Searching and Binary Search Trees

Key concepts: Binary Search · Binary Search Trees (BST) · Tree Traversal · In-order/Pre-order/Post-order

Exploration of efficient searching techniques and the hierarchical structure of Binary Search Trees.

Balanced Search Trees

Key concepts: Tree Balance · AVL Trees · Red-Black Trees · Rotations

Advanced tree structures designed to maintain logarithmic height and guarantee performance.

Sorting Methodologies

Key concepts: Elementary Sorts (Selection, Insertion) · Merge Sort · Quick Sort · Heap Sort · Stability and In-place Sorting

A deep dive into various sorting algorithms, from elementary methods to efficient divide-and-conquer strategies.

Directed Graphs and Shortest Paths

Key concepts: Directed Graphs (Digraphs) · Adjacency Lists · Dijkstra's Algorithm · Edge Relaxation

Modeling complex relationships using graphs and finding the most efficient paths between nodes.

Final Exam and Course Review

Key concepts: Exam Logistics · Regrade Policies · Comprehensive Review

Comprehensive review of course materials and logistics for the final examination.

Source Materials

Study Data Structures and Algorithmic Analysis on Lykke

This course page is free to open: signed out, you can read its first two sections, and signing in, on any plan, opens the rest. The free Lykke Chrome extension syncs your own Canvas courses, so ChatGPT, Claude and Muse can answer from your classes and deadlines. It only reads Canvas.

Add the free extensionSign in to open every section

Browse more course pages