Program

To insert data into Collection in MongoDB, you need to use the insert () or save () method.

To query data from Collection in MongoDB, you need to use the find () method in MongoDB.

The update () method updates the values ​​in the existing Document while the save () method replaces the existing Document with the transmitted Document in that save () method.

The remove () method in MongoDB is used to delete the Document from Collection. The remove () method takes two parameters. The first parameter of the deletion criteria determines

In MongoDB, projection's meaning is to select only the necessary data instead of selecting the entire data of a Document. If a Document has 5 fields and you only need 3 fields,

To limit the records in MongoDB, you need to use the limit () method. The limit () method takes a parameter in a numeric format, which is the Document number you want to display.

To sort documents in MongoDB, you need to use the sort () method. The sort () method takes a Document containing a list of fields with their sort order. To determine the sort

Index (Index) supports the resolution of queries more efficiently. Without an index, MongoDB must scan through all a Collection's Document to select the Documents that connect to

The Hash Table data structure is a data structure that stores data in a federated manner. In Hash Table, data is stored in array format, in which data values ​​have their own

Sorting is to arrange data in a specific format. In computer science, sorting algorithms determine how to arrange data in a certain order. Sorted in order here is arranged in

Bubble arrangement is a simple sort algorithm. This sorting algorithm is carried out based on comparing pairs of adjacent and swap elements if they are not in order.

Sort insertion is a sorting algorithm based on in-place comparison. Here, a sub-list is always maintained in sorted form. Inserting is inserting an element into the sorted list

What happens if the data entered into the binary search tree (BST) is in ordered form (ascending or descending). It will look like the following.

A spanning tree is a subset of Grahp G that has all vertices enclosed by the minimum number of edges. Therefore, a spanning tree will not form a cycle and it cannot be interrupted

Data structure The heap is a special case of a balanced binary tree data structure, where the root node's key is compared to its children and arranged accordingly.

Selection Sort is a simple algorithm. This sorting algorithm is an algorithm based on in-place comparison, in which the list is divided into two parts, sorted (list) on the left

Some programming languages ​​allow a module or function to be called to itself. This technique is called Recursion.

Problem of Hanoi Tower (Tower of Hanoi) is a math game consisting of 3 columns and with more disk numbers 1.

Mixing (Merge Sort) is an arrangement algorithm based on the Divide and Conquer algorithm. With the worst case time complexity of Ο (n log n), this is one of the algorithms that

Shell Sort is a highly efficient sorting algorithm based on insertion sorting algorithm (Insertion Sort). This algorithm avoids the case of swapping positions of two distant