Loading
Tivra
Programmes
Handwritten Notes
Courses
About
Contact
Login
Enrol Now
Handwritten Notes
Data Structures & Algorithms
Data Structures & Algorithms
Core DSA concepts for interviews and college exams.
1
Introduction to Data structure
View
2
Abstract data type
View
3
Linear vs non linear data type
View
4
Primitive vs non primitive data type
View
5
Static vs dynamic data type
View
6
Array
View
7
Time complexity and space complexity
View
8
Running time
View
9
Big o notation
View
10
Recursion
View
11
Operations in data structure
View
12
Stack
View
13
Queue
View
14
Circular queue
View
15
Infix, prefix and postfix representation and conversion
View
16
Linked list
View
17
Circular linked list
View
18
Priority queue
View
19
Tree
View
20
Binary tree and traversal
View
21
Difference between general and binary tree
View
22
Binary search tree
View
23
Linear search
View
24
Binary search
View
25
Searching and sorting
View
26
Bubble sort
View
27
Insertion sort
View
28
Selection sort
View
29
Quick sort
View
30
Merge sort
View
31
Graph
View
32
Graph representation
View
33
Graph traversal
View
34
Role of algorithm in computing
View
35
Mathematical preliminaries
View
36
Growth functions
View
37
Red black tree
View
38
Heap
View
39
Heap sort
View
40
Heapify
View
41
Radix sort/bucket sort
View
42
Strasen’s matrix multiplication
View
43
Longest common subsequence
View
44
Huffman coding
View
45
Kruskal algorithm
View
46
Prim’s algorithm
View
47
Binomial heap
View
48
Eular graph
View
49
Hamiltonian graph
View
50
Graph coloring
View
51
Dijastra algorithm
View
52
Strongly connected components
View
53
Maximal independent set
View
54
Matching
View
55
Randomized algorithm
View
56
P, NP, NP Hard, and NP Complete
View
57
Approximation algorithm
View
58
All pair shortest path
View
59
Dynamic programming
View
60
Max flow and min cut theorem
View
61
Ford fulkerson algorithm
View
62
Inverse of triangular matrix
View