Scribd
Upload
23 views

DSA Short Form

Uploaded by

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

DSA Short Form

Uploaded by

shiddharthakumar2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

In the context of Data Structures and Algorithms (DSA), several common abbreviations and short forms

are frequently used. Here's a list of 100 such abbreviations and short forms that are commonly
encountered:

### Data Structures:

1. **ADT**: Abstract Data Type

2. **DS**: Data Structure

3. **LL**: Linked List

4. **DLL**: Doubly Linked List

5. **BST**: Binary Search Tree

6. **AVL**: AVL Tree (Adelson-Velsky and Landis)

7. **Trie**: Trie (Prefix Tree)

8. **Heap**: Binary Heap

9. **Hash**: Hash Table

10. **Dict**: Dictionary (often refers to a hash map)

11. **Set**: Set (collection of unique elements)

12. **Graph**: Graph (vertices and edges)

13. **Stack**: Stack (Last In First Out - LIFO)

14. **Queue**: Queue (First In First Out - FIFO)

15. **Deque**: Double-ended Queue

16. **PQ**: Priority Queue

17. **Vec**: Vector (dynamic array)

18. **Mat**: Matrix (2D array)

19. **Heap**: Binary Heap

20. **SL**: Skip List


21. **BF**: Bloom Filter

22. **RR**: Red-Black Tree

23. **Fenwick**: Fenwick Tree (Binary Indexed Tree)

24. **DSU**: Disjoint Set Union (Union-Find)

25. **SegTree**: Segment Tree

26. **BTree**: B-Tree

27. **SuffixArray**: Suffix Array

28. **FibHeap**: Fibonacci Heap

29. **RadixTree**: Radix Tree

30. **KDTree**: K-Dimensional Tree

31. **LSH**: Locality Sensitive Hashing

### Algorithms:

32. **DFS**: Depth First Search

33. **BFS**: Breadth First Search

34. **Dijkstra**: Dijkstra's Algorithm (shortest path)

35. **Bellman-Ford**: Bellman-Ford Algorithm (single-source shortest path)

36. **Floyd-Warshall**: Floyd-Warshall Algorithm (all-pairs shortest path)

37. **Kruskal**: Kruskal's Algorithm (minimum spanning tree)

38. **Prim**: Prim's Algorithm (minimum spanning tree)

39. **Tarjan**: Tarjan's Algorithm (strongly connected components)

40. **TopoSort**: Topological Sorting

41. **LCA**: Lowest Common Ancestor

42. **FFT**: Fast Fourier Transform


43. **BFS**: Breadth First Search

44. **IDDFS**: Iterative Deepening Depth First Search

45. **A* (A-star)**: A-star Algorithm (pathfinding and graph traversal)

46. **SA**: Simulated Annealing (optimization)

47. **GA**: Genetic Algorithm (optimization)

48. **Backtrack**: Backtracking

49. **BitManip**: Bit Manipulation

50. **DivConq**: Divide and Conquer

51. **Greedy**: Greedy Algorithm

52. **DP**: Dynamic Programming

53. **Memoize**: Memoization

54. **BnB**: Branch and Bound

55. **BnBFS**: Branch and Bound with BFS

56. **BnBDFS**: Branch and Bound with DFS

57. **RabinKarp**: Rabin-Karp Algorithm (string matching)

58. **ZAlg**: Z Algorithm (string matching)

59. **BM**: Boyer-Moore Algorithm (string matching)

60. **KMP**: Knuth-Morris-Pratt Algorithm (string matching)

### Concepts and Miscellaneous:

61. **TC**: Time Complexity

62. **SC**: Space Complexity

63. **NP**: Non-deterministic Polynomial time

64. **NP-Hard**: NP-Hard problem


65. **NP-Complete**: NP-Complete problem

66. **DFS**: Depth First Search

67. **BFS**: Breadth First Search

68. **I/O**: Input/Output

69. **API**: Application Programming Interface

70. **OOP**: Object-Oriented Programming

71. **FP**: Functional Programming

72. **CRUD**: Create, Read, Update, Delete (database operations)

73. **ORM**: Object-Relational Mapping

74. **SQL**: Structured Query Language

75. **NoSQL**: Not Only SQL

76. **REST**: Representational State Transfer

77. **JSON**: JavaScript Object Notation

78. **XML**: eXtensible Markup Language

79. **TCP**: Transmission Control Protocol

80. **UDP**: User Datagram Protocol

81. **HTTPS**: Hypertext Transfer Protocol Secure

82. **API**: Application Programming Interface

83. **GUI**: Graphical User Interface

84. **CLI**: Command Line Interface

85. **URI**: Uniform Resource Identifier

86. **URL**: Uniform Resource Locator

87. **HTML**: HyperText Markup Language

88. **CSS**: Cascading Style Sheets

89. **JS**: JavaScript


90. **DOM**: Document Object Model

91. **HTTP**: Hypertext Transfer Protocol

92. **MVC**: Model-View-Controller

93. **JWT**: JSON Web Token

94. **CI/CD**: Continuous Integration / Continuous Deployment

95. **DAG**: Directed Acyclic Graph

96. **IoT**: Internet of Things

97. **ML**: Machine Learning

98. **AI**: Artificial Intelligence

99. **DL**: Deep Learning

100. **OCR**: Optical Character Recognition

These abbreviations and short forms are commonly used in the context of studying, discussing, or
implementing Data Structures and Algorithms. Each one represents a key concept, algorithm, or data
structure that is fundamental to understanding and solving problems in DSA.

You might also like