Uncategorized pages

Showing below up to 50 results in range #51 to #100.

51. 2.4.2 Pattern Recognition
52. 2.4.3 Abstraction
53. 2.4.4 Algorithms
54. 3.0 Programming Fundamentals
55. 3.1.1 Procedural Programming
56. 3.1.2 Object-Oriented Programming (OOP) - Basic Concepts
57. 3.1.3 Functional Programming (Basic Concepts)
58. 3.1 Programming Paradigms
59. 3.2.1 Primitive Data Types (Integers, Floats, Booleans, Characters)
60. 3.2.2 Reference Data Types (Strings, Objects)
61. 3.2.3 Variable Declaration and Initialization
62. 3.2 Data Types & Variables
63. 3.3.2 Looping Constructs (for, while, do-while)
64. 3.3 Control Structures
65. 3.4.1 Definition and Purpose
66. 3.4.2 Parameters and Return Values
67. 3.4.3 Scope
68. 3.4 Functions/Methods
69. 3.5.1 Arrays (One-dimensional, Multi-dimensional)
70. 3.6.1 Types of Errors (Syntax, Runtime, Logic)
71. 3.6.2 Exception Handling (try-catch)
72. 3.6.3 Debugging Techniques and Tools
73. 4.0 Data Structures Algorithms (DSA)
74. 4.1.1.2 Linked Lists (Singly, Doubly, Circular)
75. 4.1.1.3 Stacks (LIFO)
76. 4.1.1.4 Queues (FIFO, Priority Queues)
77. 4.1.1 Linear Data Structures
78. 4.1.2.1 Trees (Binary Trees, Binary Search Trees, AVL Trees, Red-Black Trees)
79. 4.1.2.2 Graphs (Directed, Undirected, Weighted)
80. 4.1.2.3 Hash Tables (Hashing Functions, Collision Resolution)
81. 4.1.2.4 Heaps (Min-Heap, Max-Heap)
82. 4.1.2 Non-Linear Data Structures
83. 4.1 Data Structures
84. 4.2.1.1 Bubble Sort, Selection Sort, Insertion Sort
85. 4.2.1.2 Merge Sort, Quick Sort (Divide and Conquer)
86. 4.2.1.3 Heap Sort, Radix Sort
87. 4.2.1 Sorting Algorithms
88. 4.2.2.1 Linear Search
89. 4.2.2.2 Binary Search
90. 4.2.2 Searching Algorithms
91. 4.2.3.1 Breadth-First Search (BFS)
92. 4.2.3 Graph Algorithms
93. 4.2 Algorithms
94. 5.0 Computer Architecture & Organization
95. 5.1.1 Arithmetic Logic Unit (ALU)
96. 5.1.2 Control Unit (CU)
97. 5.1.3 Registers
98. 5.1.4 Instruction Cycle (Fetch, Decode, Execute, Store)
99. 5.1 CPU Components
100. 5.2.1 Cache Memory (L1, L2, L3)