Difference between WCF and Web Service

WCF Web Service It is defined by ServiceContract and operationContract attributes. It is defined by WebService and WebMethod attributes are used. It Supports various protocols like HTTP, HTTPS, TCP, Named Pipes and MSMQ. It Supports only HTTP, HTTPS protocols. Hosted in IIS,Windows Service, WAS (Windows Activation Service), Self-hosting. Hosted only in IIS. It is secure, reliable […]

Read More

What is LINQ

LINQ(Language Integrated Query) introduced in .NET Framework 3.0(VS 2008).Linq queries are object oriented languages\queries.It enables the query of data from any kind of data source, including databases, XML, List, Array and so on. It offers a compact, expressive, and intelligible syntax for manipulating data. It is required as it bridges the gap between the world […]

Read More

LINQ Operators and Lambda Expression

Lambda expression in Linq It is referred as a unique function use to form delegates or expression tree types, where right side is the output and left side is the input to the method. For writing LINQ queries particularly, Lambda expression is used. Where IEnumerable<Product> x = products.Where(p => p.UnitPrice >= 10); IEnumerable<Product> x = […]

Read More

PLINQ

PLINQ stands for Parallel Language Integrated Query. It is the parallel implementation of LINQ, in which a query can be executed by using multiple processors. PLINQ ensures the scalability of software on parallel processors in the execution environment. It is used where data grows rapidly, such as in telecom industry or where data is heterogeneous. […]

Read More

Advantages and Disadvantages of Linq

Advantages Quick turn around for development Queries can be dynamically Tables are automatically created into class Columns are automatically created into properties Relationship are automatically appeaded to classes Lambda expressions are awesome Data is easy to setup and use Disadvantages No clear outline for Tiers No good way of view permissions Small data sets will […]

Read More

Comparing LINQ with Stored Procedure

Some advantages of LINQ vs Stored Procedure Type safety: LINQ is that it is type safe, so it becomes much easier to write queries that are type checked at compile time. It is much nicer to get an error when compiling than from a runtime exception at a client site. Abstraction: This is especially true with […]

Read More

Difference between ADO.NET and LINQ to SQL

1) In ADO.NET, SqlConnection/OleDbConnection is used for database connectivity where as in Linq to sql, we can use context for database connectivity. 2) In ADO.NET it is difficult to debug and cause syntax errors at run-time where as in Linq to sql,it is easy to debug and cause syntax errors at compile-time. 3) ADO.NET has […]

Read More

MongoDB

MongoDb is an Open Source database written in C++ language and developed by 10gen but now it’s called MongoDB Inc. MongoDB is the fastest growing database because it’s provided more security protection mechanisms than others and also more reliable in cloud computing environments. It is secure architecture for your deployment. MongoDB is document oriented database […]

Read More

Join in SQL

Join clause combines records from two or more tables in a relational database.It creates a set that can be saved as a table or used as it is.SQL join is used for combining column from two or more tables by using values common to both tables.Join keyword is used in SQL queries.Minimum required condition for […]

Read More

Binary search tree or AVL tree

# Program to insert contents of file in Binary search tree or AVL tree # It calculates total time it took for the insertion of all the elements # It also calcultaes average height of the tree formed and height of any particaluar node # Average height is the average of lenghts of all the […]

Read More

WAP to show saddle point

#include<stdio.h> #include<conio.h> void main() { int a[3][3] = {1,2,3, 4,5,6, 7,8,9},i,j,k,value=0,temp=0,max=0; value = a[0][0]; printf(“\n Matrix Is “); for(i=0;i < 3;i++) { printf(“\n”); for(j=0;j < 3;j++) { printf(“\t%d”,a[i][j]); } } for(i=0; i < 3;i++) { value = a[i][0]; for(k=0;k < 3;k++) { if(value > a[i][k]) { value = a[i][k]; temp = k; } } max […]

Read More

WAP to convert Sparse matrix to original matrix

//Sparse to Original Type -I #include <stdio.h> #include <conio.h> void main() { int a[5][5] = {0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0, 0,0,0,0,0},i,j,k=1,sp[5][3] = {5,5,4, 0,2,5, 2,0,2, 3,4,9, 4,0,3}; for(k=1;k<5;k++) { a[sp[k][0]][sp[k][1]] = sp[k][2]; } printf(“\n Original Matrix “); for(i=0;i<5;i++) { printf(“\n”); for(j=0;j<5;j++) { printf(“\t%d”,a[i][j]); } } getch(); }

Read More

WAP to convert original matrix to Sparse matrix

#include <stdio.h> #include <conio.h> void main() { int a[5][5] = {0,0,5,0,0, 0,0,0,0,0, 2,0,0,0,0, 0,0,0,0,9, 3,0,0,0,0},i,j,sp[5][3],k=1; sp[0][0] = 5; sp[0][1] = 5; sp[0][2] = 4; for(i=0;i<5;i++) { for(j=0;j<5;j++) { if(a[i][j]!=0) { sp[k][0] = i; sp[k][1] = j; sp[k][2] = a[i][j]; k++; } } } printf(“\n Sparce Matrix “); for(i=0;i<5;i++) { printf(“\n”); for(j=0;j<3;j++) { printf(“\t%d”,sp[i][j]); } } […]

Read More

Double Queue in Data Structure

#include <stdio.h> #include <conio.h> void main() { int CQ[10],i,front = -1,rear = -1,ch,x; do { printf(“\n 1:Insert “); printf(“\n 2:Delete”); printf(“\n 3:Display”); printf(“\n 0:Exit”); printf(“\n Enter your Choice “); scanf(“%d”,&ch); switch(ch) { case 1: if(front == 0 &&((rear == 9)||(rear+1 == front))) { printf(“\n Queue is Full”); break; } if(front == -1) front = rear […]

Read More