Missing Index All of we know how important the index is. In this article I am trying to illustrate about the missing index and how we find the missing index. Index is to improve the performance of the query. For the causes of missing index it takes long …
Simple Directmedia Layer – Start to build your own Graphics application using SDL with C/C++ Simple DirectMedia Layer is a cross-platform multimedia library designed to provide low level access to audio, keyboard, mouse, joystick, 3D hardware via OpenGL, and 2D video framebuffer. It is used by MPEG playback software, emulators, …
Moving Index in Separate Filegroup By default the index are stored in a same file group as the base table on which the index is created. It is important that if we have a very large table with index. To improve the performance of the query we have to move …
Data Structure: Implementing Quick Sort using C/C++ Algorithm 1. Declare and initialize necessary variables2. Pick a pivot element.3. FInd the proper position of the pivot element4. Divide the total array into two sub arrays so that all elements of the left sub array are less than pivot and that of …
Ad-Hoc Query Paging The SQL Server 2012 code named “Denali” has lot of new feature. In this article I am trying to explain a new feature of SQL Server 2012 called “Ad-Hoc Query Preparing” The ORDER BY clause of SELECT statement has been enhanced by SQL Server 2012 by using …
Start Building 3D games Using OpenGL Utility Toolkit (GLUT) GLUT (pronounced like the glut in gluttony) is the OpenGL Utility Toolkit, a window system independent toolkit for writing OpenGL programs. It implements a simple windowing application programming interface (API) for OpenGL. GLUT makes it considerably easier to learn about and …
Data Structure: Implementing Bubble Sort using C/C++ In Bubble sort, each pass consists of comparison each element in the file with its successor (i.e. x[i] with x[i+1]) and interchanging two elements if they are not in the proper order. Example: Let us consider following array of elements 16 52 42 …
C++ Tutorial: Class Templates We also have the possibility to write class templates, so that a class can have members that use template parameters as types. For example: template class mypair { T values [2]; public: mypair (T first, T second) { values[0]=first; values[1]=second; }}; The class that we have …
Introduction System V IPC is meant to provide and entire IPC mechanism. As such, it is more heavyweight than BSD mmap, and provides three methods of communication: message queues, semaphores, and shared segments. Like BSD mmap, System V IPC uses files to identify shared segments. Unlike BSD, System V uses …
WPF vs. Windows Forms Windows Presentation Foundation (also known as WPF) is a graphical subsystem. It is used in order to render user interfaces in Windows based applications. At its inception, WPF (known then as ‘Avalon’) was released as a part of the .NET Framework, version 3.0. It was then …
C++ Tutorial: Function Templates Function Templates Function templates are used to reduce the repeated code. I want to make you clear about function templates by giving a small example here. Functions abs() and fabs() are used to find the absolute value or non-negative value of a integer and floating point …
C++ Tutorial: Templates C++ Template is one of the most sophisticated, flexible and powerful feature. It was not the original feature of C++ as it was added later on. The older versions of compilers do not support this feature. Templates support generic programming, allowing development of reusable software components with …
Auto generated SP with Parameters When we are thinking about a procedure to insert data in a specified table, we must use all the columns name of the table as parameter to supply the value on the procedure. Sometimes the table have a huge number of columns and the …
Binary tree Implementation on C++ – Algorithm and Source Code Algorithm for inserting a node in a binary tree: 1. Declare and initialize necessary variables2. Read the data item to be inserted in the tree say x.3. Create a new node with its left and right pointers to null.4. Assign …
