Dsa Anki Deck

A data structure is a particular way of organizing data in a computer so that it can be used effectively.

An algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.

Big O notation describes the upper bound of the time complexity of an algorithm. It represents the worst-case scenario.

Time complexity is a measure of the amount of time an algorithm takes to run as a function of the length of the input.

Space complexity is a measure of the amount of working storage an algorithm needs.

An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.

A linked list is a linear data structure where elements are not stored at contiguous memory locations. The elements are linked using pointers.

Arrays have fixed size and contiguous memory. Linked Lists have dynamic size and non-contiguous memory using pointers. Insertion/Deletion is easier in Linked Lists, while access is faster in Arrays.

A stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO (Last In First Out) or FILO (First In Last Out).

Push (add item), Pop (remove item), Peek/Top (view top item), isEmpty (check if empty).

A queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO).

Enqueue (add item), Dequeue (remove item), Front (get first item), Rear (get last item).