Sometime we need to move the .mdf and .ldf files to another location. And we do not want to stop the MSSQLSERVER service, and we do not want to export to another server. In this article we will try to attach or move the SQL Server files i.e. .mdf and .ldf file.
Microsoft has made "Automatic Updates" mandatory for Windows 10 users to update their computer. The Microsoft has set the new operating system to automatically receive new updates by default. Windows 10 Pro users have an option to delay the updates they receive, but if you are on Windows 10 Home, there isn't much you can do about it.
Magic tables are the logical temporary tables created by SQL server internally to hold recently inserted values in the case of insert/update and to hold recently deleted values in the case of delete. There are two types of Magic tables created at the time of insertion/updation/deletion in SQL server: 1. INSERTED 2. DELETED
Stack is a simple data structure with a predefined capacity that allows adding and removing elements in a particular order i.e. Stack work on LIFO (Last in, First out) technique. Every time an element is added, it goes on the top of the stack, the only element that can be removed is the element that was at the top of the stack.
The Random class of .NET class library provides functionality to generate random numbers in C#. The Random class constructors have two overloaded forms. It takes either no value or it takes a seed value.
QuickSort is a Divide and Conquer algorithm. Quick sort is a very efficient sorting algorithm. In Quick Sort an array is partitioned into two arrays one of which holds values smaller than the specified value, say pivot, based on which the partition is made and another array holds values greater than the pivot value.
This is an on-the-spot comparison-based sorting algorithm. In this sort a sub-list is maintained which is always sorted. For example, the lower part of an array is maintained to be sorted. It is named insertion sort as an element which is to be 'insert'ed in this sorted sub-list, has to find its appropriate place and then it has to be inserted there.
Bubble Sort is the simplest sorting algorithm that can be done by repeatedly swapping the adjacent elements if they are in wrong order. It is named as bubble sort since it looks like bubbles the lighter elements come up and heavier elements settle down.