Archive for the ‘Notes’ Category

The post contains a simple query to find the number of columns in your sql sever table.


SELECT COUNT(COLUMN_NAME) FROM INFORMATION_SCHEMA.COLUMNS WHERE
TABLE_CATALOG = 'databse_name' AND TABLE_SCHEMA = 'dbo'
AND TABLE_NAME = 'table_name'

Last week i got a simple work to create a table with the result of different tables. We can also create a view to see a single result set from different table but my task was to create a table. (more…)

SQL Server doesn’t need any introduction as it is a widely used product from a technology giant Microsoft.

But very few of them actually know the history of sql server and obviously I m one of them few days ago. This post is about the same……. (more…)

This is just a little post. No tips or articles. I am just posting a book of software engineering.

Download Book from the below given link.

Software Engineering E-book

When you are dealing with bulk data then all you have is a CSV file. Comma Separated Value File or CSV file is a data file which contains large amount of data separated by comma.

The scenario is you have to insert the given data in SQL Server and the question is What will you do?

Option 1: Map fields one by one

Option 2: Use a small function called Sql Bulk Insert to insert data in the table. (more…)

Midpoint Circle Algorithm

Posted: November 6, 2011 in Computer Graphics

Implementation

#include<iostream.h>

#include<conio.h>

#include<graphics.h>

void plot(int xc,int yc,int x,int y)

{ (more…)

This article is about a graphics algorithm. For the digital implementation of a Differential Analyzer, see Digital Differential Analyzer.

In computer graphics, a hardware or software implementation of a digital differential analyzer (DDA) is used for linear interpolation of variables over an interval between start and end point. DDAs are used for rasterization of lines, triangles and polygons. In its simplest implementation the DDA algorithm (more…)

The Bresenham line algorithm is an algorithm which determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a computer screen, as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in standard computer architectures. It is one of the earliest algorithms developed in the field of computer graphics. A minor extension to the original algorithm also deals with drawing circles. (more…)

The Borland Graphics Interface (BGI) is a collection of functions and procedures that are often called as graphical toolkit which an application program may use to solve specific graphics problem. Turbo C++ graph unit (graphics.h) provides a complete set of library consisting of over 80 graphics routines that range from bit oriented routines high level calls. (more…)