Scribd
Upload
4 views1 page

Algorithms & Data Structures Overview

The lecture notes cover fundamental concepts in algorithms and data structures, including definitions, common data structures like arrays, linked lists, stacks, queues, trees, graphs, and hash tables. It also discusses Big-O notation for time and space complexity, basic algorithms for sorting and searching, and important concepts such as divide and conquer, dynamic programming, and greedy algorithms. Example problems include implementing merge sort and using BFS to find the shortest path in an unweighted graph.

Uploaded by

MrJelly000YT
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
4 views1 page

Algorithms & Data Structures Overview

The lecture notes cover fundamental concepts in algorithms and data structures, including definitions, common data structures like arrays, linked lists, stacks, queues, trees, graphs, and hash tables. It also discusses Big-O notation for time and space complexity, basic algorithms for sorting and searching, and important concepts such as divide and conquer, dynamic programming, and greedy algorithms. Example problems include implementing merge sort and using BFS to find the shortest path in an unweighted graph.

Uploaded by

MrJelly000YT
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

Title: Algorithms & Data Structures — Lecture Notes

Course: Intro to Computer Science (Algorithms)


Topics Covered:
- Definitions:
• Algorithm: Step-by-step procedure for computations.
• Data Structure: Organized way to store and retrieve data efficiently.
- Common Data Structures:
• Arrays and Linked Lists: Array = contiguous memory; Linked List = nodes with
pointers.
• Stacks & Queues: LIFO and FIFO; applications in recursion and BFS.
• Trees & Graphs: Hierarchical data (binary trees), graph representations
(adjacency list/matrix).
• Hash Tables: Key-value mapping, average O(1) lookup.
- Big-O Notation:
• Time complexity: O(1), O(log n), O(n), O(n log n), O(n^2).
• Space complexity considerations.
- Basic Algorithms:
• Sorting: Bubble, Insertion, Merge, Quick (divide-and-conquer; average O(n log
n)).
• Searching: Linear search vs. Binary search (requires sorted array).
- Important Concepts:
• Divide and Conquer, Dynamic Programming (overlapping subproblems +
memoization), Greedy algorithms.
Example Problems:
- Implement merge sort and explain why it is stable and its time/space complexity.
- Use BFS to find the shortest path in an unweighted graph.

You might also like