# Programming and Data Structures – First year, university

> Written with AI · First year, university · 2026-11-01 · https://lessoons.com/en/programming-and-data-structures

An array is a contiguous block of memory, which is why an index costs the same wherever it points and why inserting in the middle does not. The course where programs stop merely working and start having to scale. Every structure is judged by the operations it makes cheap and the ones it makes expensive. In this Programming and Data Structures (First year, university) topic hub, every lesson is arranged in step-by-step teaching order with worked examples, practice worksheets, and clear answers to key questions such as What is Arrays, memory and.

## Lessons in this topic (in learning order)

1. [What is Arrays, memory and the cost of reaching an element?](https://lessoons.com/en/programming-and-data-structures#lesson-1) (First year, university) — An array is a contiguous block of memory, which is why an index costs the same wherever it points and why inserting in the middle does not. Everything later in the course answers that trade.
2. [What is Asymptotic complexity and the big O notation?](https://lessoons.com/en/programming-and-data-structures#lesson-2) (First year, university) — Counting operations exactly is hopeless and unnecessary. What matters is how the count grows, and that is a statement about a limit, which is why the definition repays a careful reading.
3. [What is Linked lists, stacks and queues?](https://lessoons.com/en/programming-and-data-structures#lesson-3) (First year, university) — A linked list buys cheap insertion by giving up cheap indexing. Stacks and queues are the two disciplines of access that turn out to describe an enormous amount of computation.
4. [What is Recursion, the call stack and divide and conquer?](https://lessoons.com/en/programming-and-data-structures#lesson-4) (First year, university) — A recursive function is a stack you did not have to write yourself. Once that is clear, divide and conquer becomes a way of designing algorithms rather than a trick.
5. [What is Merge sort, quicksort and the comparison bound?](https://lessoons.com/en/programming-and-data-structures#lesson-5) (First year, university) — Two sorting algorithms built by divide and conquer, one predictable and one usually faster. The proof that no comparison sort can do better than n log n is stated here, and it is a proof about every possible algorithm at once.
6. [What is Hash tables and what a hash function has to do?](https://lessoons.com/en/programming-and-data-structures#lesson-6) (First year, university) — A hash table gives constant expected time by spreading keys evenly, and it gives it on average only. Collisions are not a flaw to be avoided but a case to be handled.
7. [What is Binary search trees and the cost of staying balanced?](https://lessoons.com/en/programming-and-data-structures#lesson-7) (First year, university) — A search tree keeps its keys in order, which a hash table does not, and it pays for that with logarithmic time only while it stays balanced. Left alone, sorted input degrades it into a list.
8. [What is Graphs, adjacency lists and breadth first search?](https://lessoons.com/en/programming-and-data-structures#lesson-8) (First year, university) — A graph is what is left when a structure has no root and no order. The representation you choose fixes the cost of every algorithm you then write on top of it.

## Frequently Asked Questions

### What is Arrays, memory and the cost of reaching an element?

An array is a contiguous block of memory, which is why an index costs the same wherever it points and why inserting in the middle does not. Everything later in the course answers that trade.

### What is Asymptotic complexity and the big O notation?

Counting operations exactly is hopeless and unnecessary. What matters is how the count grows, and that is a statement about a limit, which is why the definition repays a careful reading.

### What is Linked lists, stacks and queues?

A linked list buys cheap insertion by giving up cheap indexing. Stacks and queues are the two disciplines of access that turn out to describe an enormous amount of computation.

### What is Recursion, the call stack and divide and conquer?

A recursive function is a stack you did not have to write yourself. Once that is clear, divide and conquer becomes a way of designing algorithms rather than a trick.

### What does Programming and Data Structures for First year, university cover?

The course where programs stop merely working and start having to scale. Every structure is judged by the operations it makes cheap and the ones it makes expensive. The unit includes 8 ordered lessons covering Arrays, memory and the cost of reaching an element, Asymptotic complexity and the big O notation, Linked lists, stacks and queues, Recursion, the call stack and divide and conquer.
