Saturday, December 31, 2016

Top 5 Websites To Compile & Run Programs Online || Online Compilers


As a programmer, till now you have compiled your program on any software in offline mode. Have you experience to compile and run your program online.There are many online compilers are available to compile and run programs of different languages like C, C++ or python.No you do not need to download and install a heavy software or compiler for programming, as you can do it online. I have collected a list of 5 best websites which allows you to write, compile and run a program online. So, now enjoy online programming by visiting

Websites To Compile & Run Programs Online.


 Top 5 Websites To Compile & Run Programs Online || Online Compilers

1. codepad.org

Codepad.org is an online compiler and collaboration tool.This site allows you to write and run code and provide a URL of code which you can share via email and chat. This online compiler is compatible with C, C++, Perl, PHP ,Ruby and many more.You can select any programming language to compile program.

2. ideone.com

This is best online compiler as well as debugger to debug programs.Just you need to paste source code and click on "RUN". You can make your code private as well as public to share with others. This online compile support more than 40 programming languages like JAVA, Go, Bash,Assembler,Perl 6,SQ L etc.You can choose any language in which you want to run your program.

3. compilr.com

Compilr is online editor and sand box to write your code.This online compiler is suitable with all browsers like Firefox , Chrome mobile devices and tablet.This compiler is available in 14 different themes. To start programming you have to to do free signup.

4. compileonline.com

This is another best online compiler to write ,compile and run a program. This compiler has extra features like web technologies (j-query,vi Editor,Live script,HTML etc) text formatting (Tex,MathML, ASCII) and support more than 50 programming languages.

5. onlinecompiler.net

This is limited online compiler just support 6 programming languages like C,C++, JAVA,BASIC, PASCAL and FORTRAN. This allows you to save your source code.This compiler is compatible with Window and Linux operating systems.
Read more »

Friday, December 30, 2016

How to Unlock Samsung S6310N Portugal by usb cable

How to Unlock Samsung S6310N Portugal by usb cable, it is unlock by third party unlocking tool called z3x box. just run the shell and select correct model, on your mobile phone put into usb debbuging and how? Settings > Applications > Development. and on dial phone type on keyboard *#9090# press and select usb diag. that it's



Unlocking Logs:

Selected model: S6310N
Selected port: COM16 Z3X BOX Serial Port
Selected port speed: 115200
Reading phone info... no answer from phone
Done with Samsung Tool v.16.7

Selected model: S6310N
Selected port: COM14 SAMSUNG Mobile USB Serial Port
Selected port speed: 115200
Reading phone info...
PDA/CSC version: S6310NXXAMD1/S6310NTENAMD1
Phone version: SW VERSION :None
Phone HW: MP 0.100
Cal date: 2013.09.23
Reading IMEI... OK
IMEI: 359043050177xxx
Phone S/N: RF1D96JQAV
Build: 76XXS-USUSKOLYM-2035
Done with Samsung Tool v.16.7

Selected model: S6310N
Selected port: COM14 SAMSUNG Mobile USB Serial Port
Selected port speed: 115200
Reading phone info...
PDA/CSC version: S6310NXXAMD1/S6310NTENAMD1
Phone version: SW VERSION :None
Phone HW: MP 0.100
Cal date: 2013.09.23
Reading IMEI... OK
IMEI: 359043050177xxx
Phone S/N: RF1D96JQAV
Build: 76XXS-USUSKOLYM-2035
Bypass MSL... OK
Reading codes... OK
Searching server for decrypt codes... OK
Freeze code:  79051537
NET lock:  #7465625*638*39417082#
Sub lock:  #7465625*782*62414816#
SP lock:  #7465625*77*00000000#
CP lock:  #7465625*27*00000000#
SIM lock:  #7465625*746*00000000#
For check lock status: *#7465625#
Done with Samsung Tool v.16.7

Read more »

Top IT Certification Programs For Beginners in 2014


In order to boost and improve your professional life in information technology Field, getting certifications in various programs help a lot. Having certifications not only leave a good impression when you move toward interview also improve your skills in Field and develop your confidence level.Before moving towards any institution to get certifications you must choose a program which fulfill the today's needs or which will beneficial in your IT Field. So, Today I am sharing with you top best IT certifications programs in 2014. If your are beginner and have an interest towards getting certifications in 2014 then look at Top IT Certification Programs For Beginners in 2014.May these programs groom your future.These IT certifications programs helps you to get high pay and high rank in any IT feild in 2014.


Top  IT Certification Programs For Beginners in 2014


1. CCNP or Cisco Certified Network Professional


The CCNP or Cisco certified network professional is a certification program related to designing applications, troubleshooting and verification of wide and local area networks.If you have certificate and skills of CCNP you can get job as network engineers, system engineers, support engineers with high rank and high salary in IT.


2. MCITP or Microsoft Certified Information Technology Professional


MCITP is high demanding IT program. MCITP teaches you about latest and upcoming microsoft technology. If you learn knowledge about MCITP, you can solve complex task relevant to IT feild by using your abilities and knowledge.

3. ITIL v3 Foundation


ITIL v3 Foundation is most demanded IT certifications program which will help you get high rank if you have this in your resume in 2014.IT professionals having skills of v3 foundations may will get high paid in 2014 on the base of their skills and knowledge.So, move for getting certification of ITIL v3 foundation in 2014.

4. CCNA or Cisco Certified Network Associate


The Cisco certified Network associate or CCNA IT certification is best for you if you are a beginner. CCNA is so high ranked that you must have a high experience of 3 years in network enginnering feild to get certifications of CCNA. If you have skills of CCNA the you will be able for the configuration, installation, operation, and troubleshooting of medium sized networks that use routers.You can get job as a network specialist, network administrator or a support engineer in networking.
Read more »

C# Program using Functions and loops

C# Program using Functions

Program Statement:
Write a function which takes one value as parameter and display the sum of digits in the value. e.g. if user has passed 125 then function will print 1+2+5 = 7

Solution:
 class _sum
{
long n, i, sum = 0;
public void add(long n)
{
for (i = n; i != 0; i = i / 10)
{
sum = sum + i % 10;

}
Console.WriteLine("\n\t\tSum of digits is : {0}", sum);
}
public void input()
{
Console.Write("\n\t\tEnter desired digit : ");
n = Convert.ToInt64(System.Console.ReadLine());
add(n);
}

}


Read more »

C# Program using Two argument passing function

C# Program using Two argument passing function

Program Statement:
Write a function which takes two values n1 and n2 as arguments and multiply the n1 by itself n2 times i.e. calculate n1n2 and then return the result to main function which will display the result.

Solution:
 class power_fun
{
double x;
public
power_fun()
{
x = 1;
}
double power(int a,int b)
{

for (int i = 1; i <= b; i++)
{
x = x * a;
}
return x;
}

static void Main(string[] args)
{
power_fun p = new power_fun();
int n1, n2;
double result;
Console.Write("Enter 1st Value: ");
n1 = Convert.ToInt32(Console.ReadLine());
Console.Write("Enter 2nd Value: ");
n2 = Convert.ToInt32(Console.ReadLine());
result= p.power(n1, n2);
Console.WriteLine(n1+"^ "+ n2+" = "+ result);
Console.ReadLine();
}


Read more »

Thursday, December 29, 2016

Top 5 Biggest and Popular Programming Contests

Top 5 Biggest and Popular Programming Contests
Top 5 Biggest and Popular Programming Contests

Do or Die this is one of amazing and my favorite Quote which enough to change someone life and make history. Contests have same behavior like this sentence because you have to beat others and make your history with own hands here today I have discussed on Programming Contests. If you are programmer then you must familiar with programming contests and there are many programming contest held on national and international level but here in this post have only listed Top 5 World’s biggest international programming contests which held by most popular IT Companies like Google, Microsoft, IBM and many more. These Contests consists of Computer Science Old and new languages like C/C++/C#, JAVA, PHP etc and see the people’s skills. The basic aim of these programming contests to find talented programmer over the Globe and see how fast they solve problem in given time duration. Below is the list of Top 5 International Programming Contests with their website links so more info you can get by visiting these sites.

1.  Google Code Jam
If we are talking about Programming Competition then how’s it possible Google name not included So Google is on Top in the list of Top 5 Biggest Programming Contests. Google began this Programming Contests in 2003 with Google Code Jam name. It is an international programming competition and its organized in order to identify top engineering talent for potential employment at Google. Google Code Jam consists of a set of algorithmic problems which participant must be solved in a given amount of time. In this competition not any single programming language specified so the competitors can use any programming language and development environment to obtain their best and optimal solutions.

ACM-ICPC or just ICPC  stands for International Collegiate Programming Contest which is sponsored by IBM. This annual programming contest among the universities of the world and there best student participate.

One of the oldest programming competition is ICFP and it is an international programming competition. ICFP programming contest held annually around June or July since 1998. Its results announced at the International Conference on Functional Programming. Teams size depend on competitors and any they can also used any programming language. The most important about ICFP programming competition is no entry fee and Participants have 72 hours to complete then submit their entry over the Internet.

Without included Microsoft in list of Top 5 biggest programming competition would never complete. Imagine Cup is an annual programming contest that is sponsored and hosted by Microsoft Corp. This competition brings young technologists over the Globe to help resolve some of the world's toughest challenges. This programming competition comprises five major technology competitions which including Software Design, and four other challenges that also annually updated.


One of the most amazing and best international programming competition is Internet Problem Solving Contest. This contest held as online programming competition for teams of up to three people. This contest conducted annually May since 1999. This programming contest is organized by the students and faculty members of Mathematics, Physics and Informatics of Comenius University in Bratislava, Slovakia. This competition also consists of a set of algorithmic problems which must be solved in a specific amount of time.
Read more »

Wednesday, December 28, 2016

C# Program to Print half Diamond shapes using numbers

C# Program to Print half Diamond shapes using numbers 1 to 10

Program Statement:
Write a program to produce the following output:
             1
          2   3
        4   5   6
       7  8  9  10

Solution:
 static void Main(string[] args)
{
int i,j,k=1;
for (i = 1; i <= 4; i++)
{
for (j = 4; j >= 1; j--)
{
if (j > i)
Console.Write(" ");
else
Console.Write(" " + k++ + " ");
}
Console.WriteLine();
Console.WriteLine();
}
Console.ReadLine();
}


Read more »

C# Program to display the different series output on the screen

C# Program to display the different series output on the screen

Program Statement:
Write a program which display the following output on the screen.
1 2 3 4 5
1 4 9 16 25
1 8 27 64 125

Solution:
 static void Main(string[] args)
{
for (int i = 1; i <= 5; i++)
Console.Write(i+" ");

Console.WriteLine();

for (int i = 1; i <= 5; i++)
Console.Write(i * i+" ");

Console.WriteLine();

for (int i = 1; i <= 5; i++)
Console.Write(i * i * i+" ");

Console.ReadLine();
}


Read more »

C# Program to Print Triangle in Square

C# Program to Print Triangle in Square

Program Statement:
Write a program which display the following output on the screen.
####$####
###$#$###
##$###$##
#$#####$#
$#######$

Solution:
 class shape
{
int x, y;
public void sh()
{
Console.WriteLine();
for (x = 1; x <= 5; x++)
{
for (y = 1; y <= 5 - x; y++)
{
Console.Write("#");
}
Console.Write("$");
for (y = 2; y <= x * 2 - 1; y++)
{
Console.Write("#");
}
Console.Write("\b$");
for (y = 1; y <= 5 - x; y++)
{
Console.Write("#");
}
Console.WriteLine("\n");
}
}
}


Read more »

C# Program to Print Triangles

C# Program to Print Triangles

Program Statement:
Write a program to produce the following output:
A B C D E F G F E D C B A
A B C D E F     F E D C B A
A B C D E           E D C B A
A B C D                 D C B A
A B C                        C B A
A B                               B A
A                                      A

Solution:
 static void Main(string[] args)
{
int a, x, n = 71, o = 70, y = 1, c;
for (x = 1; x <= 7; x++)
{
for (a = 65; a <= n; a++)
{
Console.Write(Convert.ToChar(a));
}
if (x == 2)
o = 70;
for (c = 2; c < y; c++)
Console.Write(" ");
for (a = o; a >= 65; a--)
Console.Write((char)a);
Console.WriteLine();
n--;
o--;
y = y + 2;
}

Console.ReadLine();
}


Read more »

PSP 2000 NO POWER and SHORTED Done!!(REFERENCE)

share ko lang mga boss buena mano ko
history nag games lang bigla n lng namatay
wala khit green or red light
kaya search ako dito sa forum
at nkita ko pwedeng POWER IC
umiinit din kc sa kanya ay POWER IC
tapos REHEAT KO pero wala pa rin
pag mainit ung board nawawala yung SHORTED
pero pag malamig shorted n nmn




tapos kinapa ko n nmn ung POWER IC kung umiinit tlga
umiinit pa rin tapos pinatagal ko napaso ako
ng isang CAPACITOR




pagtanggal ko buhay n may green light n at testing ko ok n!!!




THIS REFERENCE CREDIT GOES TO junards OF GSMSANDWICH
see you again next time for another references for mobile phone and other gadget repairing
 
Thank you for Viewing this Post if you like to help others Please Share this.
To help us Please Donate with us 



or Click the Ads in this blog please help me to reach our goal
to give a better quality of this site. Thank you!
Read more »

program to Print Sum of factorial Series in C#

C# program to Print Sum of factorial Series

Program Statement:
Write a program to display the sum of the following series.
2/1! + 4/3! + 6/5! + 8/7! + 10/9! + . . . + n/(n-1)!

Solution:
 public class factorial
{
int n;
public void ser()
{
double f, sum = 2, res = 1, up = 2;

Console.WriteLine("\n\t\tSeries = 2/1! + 4/3! + 6/5! + 8/7! + 10/9! + . . . + n/(n-1)!");
Console.WriteLine();
Console.Write("\n\t\tEnter ending point : ");
n = Convert.ToInt16(Console.ReadLine());

for (int i = 2; i <= n; i++)
{
if (i % 2 == 1)
{
f = 1;
for (int x = i; x > 0; x--)
{ f = f * x; }
up = up + 2;
res = up / f;
sum = sum + res;
}
}
Console.WriteLine("\n\t\tSum : {0}\n", sum);
Console.WriteLine();
}
}


Read more »

Program to print sum of factorial of Odd series in C#

C# Program to print sum of factorial of Odd series

Program Statement:
Write a program to display the sum of the following series i.e. sum of the factorial of odd series
1! + 3! + 5! + 7! + 9! + . . . + n!

Solution:
 static void Main(string[] args)
{
int i, j, f,last, sum = 0;
Console.WriteLine("Enter Last value:");
last = Convert.ToInt32(Console.ReadLine());
i = 1;
while (i <= last)
{
f = 1;
j = i;
while (j >= 1)
{
f = f * j;
j--;
}
sum = sum + f;
Console.WriteLine("factorial of " +i+"="+f);
i = i + 2;
}
Console.WriteLine("sum of all factorial = " + sum);
Console.ReadLine();
}


Read more »

Tuesday, December 27, 2016

program to print sum of series in C# using loops

C# program to print sum of series

Program Statement:
Write a program to display the sum of the following series using loop.
1*x + 2*x2 + 3*x3 + 4*x4 + 5*x5 + … + n*xn

Solution:
 static void Main(string[] args)
{
int j, n = 1, x, lastn, sum = 0, prod = 1;
Console.WriteLine("Enter last digit:");
lastn=Convert.ToInt32(Console.ReadLine());
Console.WriteLine("Enter value of x:");
x = Convert.ToInt32(Console.ReadLine());
for (j = 1; j <= lastn; j++)
{
n = n * x;
prod = n * j;
sum = sum + prod;
}
Console.WriteLine("Sum of Series 1*x + 2*x2 + 3*x3 + 4*x4 + 5*x5 + … + n*xn when n=: " + n +" and x= "+ x+ "sum= "+ sum);
Console.ReadLine();
}


Read more »

C# Program to print sum of the factorial of odd series multiply with x where power of x is square of corresponding number

C# Program to print sum of the factorial of odd series multiply with x where power of x is square of corresponding number

Program Statement:
Write a program to display the sum of the following series i.e. sum of the factorial of odd series multiply with x where power of x is square of corresponding number.
X1*1! + X9*3! + X25*5! + X49*7! + X81*9! + . . . + Xn2*n!

Solution:
 class _power
{
long n, f, x, sum = 0;
public long power(long a, long b)
{
long res = 1;
for (int i = 1; i <= b; i++)
res = res * a;
return res;
}
public void cal()
{
Console.WriteLine("\n\t\tSeries X^1*1! + X^9*3 +...+X^n2*n! \n");
Console.Write("\n\t\tEnter value of x : ");
x = Convert.ToInt32(Console.ReadLine());
Console.Write("\n\t\tEnter ending point : ");
n = Convert.ToInt32(Console.ReadLine());
for (int i = 1; i <= n; i++)
{
if (i % 2 != 0)
{
f = 1;
for (int j = i; j >= 1; j--)
f = f * j;
sum = sum + ((power(x, i * i)) * f);
}
}
Console.WriteLine("\n\t\tResult = {0}\n", sum);
}
}


Read more »

C# program to print Factorial of all Prime numbers in csharp

C# program to print Factorial of all Prime numbers

Program Statement:
Write a program using loop which takes one value n from user and show the factorial of all prime numbers which are less then n. e.g. if n = 10 then program will print the factorial of 2,3,5,7.

Solution:
 public class fop
{
int x, a, b, p, fac=1;
public void fact()
{
Console.WriteLine("\n\t\tShow factorial of primes less than n\n");
Console.Write("\n\t\tEnter ending point : ");
x = Convert.ToInt32(Console.ReadLine());
for (a = 2; a < x; a++)
{
p = 1;
for (b = 2; b < a; b++)
{
if (a % b == 0)
{ p = 0; }
}
if (p == 1)
{
fac = 1;
for (int c = 1; c <= a; c++)
{ fac = fac * c;}
Console.Write("\n\t\tFactorial of {0} is : \t {1}\n", a,fac);
}
}
Console.WriteLine("\n");
}
}


Read more »

C# Program to print Rectangle $

C# Program to print Rectangle $

Program Statement:
Write a program using for loop which prints the following output on the screen.
$$$$$$$$$$$

$                $

$                $

$                $

$$$$$$$$$$$

Solution:
 static void Main(string[] args)
{
for (int i = 1; i <= 11; i++)
Console.Write("$");
Console.WriteLine();
Console.WriteLine();

for (int i = 1; i <= 3; i++)

Console.WriteLine("$ $\n");

for (int i = 1; i <= 11; i++)
Console.Write("$");
Console.ReadLine();
}


Read more »

Program to Print Armstrong numbers in C#

C# Program to Print out all Armstrong numbers between 1 and 500

Program Statement:
Write a program to print out all Armstrong numbers between 1 and 500. If sum of cubes of each digit of the number is equal to the number itself, then the number is called an Armstrong number. For example, 153 = (1 * 1 * 1) + (5 * 5 * 5) + (3 * 3 * 3)

Solution:
 public class armstrong
{
int x, a, res, sum = 0;
public void find()
{
Console.WriteLine("\nAll Armstrong Numbers between 1 and 500 \n");
for (x = 1; x <= 500; x++)
{
a = x;
while (a != 0)
{
res = a % 10;
a = a / 10;
sum = sum + (res * res * res);
}
if (x == sum)
Console.Write(" {0} ", x);
sum = 0;
}
Console.WriteLine("\n");
}
}


Read more »

Monday, December 26, 2016

Is Running A Gaming Blog A Waste Of Time - Is It So?

Running A Gaming Blog Is A Waste Of Time - Is It So?
Hello folks!.. Today i have jumped in with a very exciting discussion about “Is Running a Gaming Blog Really a Waste of Time". Have you wondered to launch a gaming blog where you can provide free games and software’s? Have you ever thought to earn with gaming niche blogs?. Well we will discuss about this very interesting and hot discussion. Running a gaming blog where you can provide free games and software’s is really an easy job in blogging compared to others, yet there are some undetermined things of which we will have to take care. I have seen a hundred of gaming blogs; moreover they are earning a handsome amount. Though not many of us will successful in launching a gaming blog. Let’s get in deep by understanding each fact separately. Read out them carefully so as to build a successful blog and start earning a good avenue.

1//  What Facts Should Be Understood Before Getting Started.

If truth be told, Google doesn't like blogs providing free and cracked games and software’s. Even though, Google launches their updates which cleans the search engine and removes the links of gaming blogs. Google always check each blog to see what activities are going on. If a user's wishes to launch a gaming blog in which he will provide free games and software’s, Google will of course want to kill that blog. You may have observed blogs providing free games and software’s; nevertheless, they earn a huge amount. Now you may be inquisitive about the way to earn with gaming blogs. Well that isn't hard; we will just have to work hard.

2//  How To Get Started

Before starting money, you will have to do follow the best tools that can help you. Even it worked on my blog and will definitely work on each blog.
  • Start A Blog With An Keyword Rich And Enthralling Name
  • Upload A Professional Theme
  • Start Publishing Quality Posts
  • Wait Until The Correct Time To Start Earning
1// The first thing is of course starting a new blog and finding an authentic and keyword domain for your blog. Find out an awesome domain which wills suite your blog niche.
2// The second foremost work just after starting blogging is finding out an enthralling theme for your blog. Your visitors after landing on your blog will first look on the theme of your blog, remember visitors always loves blogs having professional stuff, and off course no one will waste time on non-usable and useless stuff.
3// The third interesting yet hard work is publishing quality posts. Always keep effective tips in mind which is quality content. Whenever you are going to write a new post always write some content it, write information or description of the game or the post which you are going to publish. Remember quality content really matters.
4// The final step is waiting, after starting blogging and posting around 150 to 200 posts, you will find a dramatic change in your blog visitors plus your website will be more visible in the search engine. To optimize blog SEO (Search Engine Optimization) you need to implement all the above steps. When you are done with posting you will wait up to 2 to 3 months but it depends on blogs some gets hit in the first month while others takes time, be patient and wait for the correct after getting around 700 and 1 thousand daily visitors you are ready to start your earning. Now you may be curious how to start earning. You really don't need to be. Follow the below step to find out an awesome way of earning through your blog.
How To Start Earning Revenue.
OK! Here is the exciting session of earning. Well after successfully getting visitors and having popularity on the webpage it’s time to be smart. We will be placing ads on our blog so as to earn money. The best way of earning through a gaming blog is by placing 360 small ads button in our posts. After researching on the internet i found out a best advertising network named "360 Advertisement". This network actually allows us to place their ads button in our blog. You can further discuss and start earning just by contacting 360 Advertisement Program 360 Advertisement Program
Conclusion
Having a gaming blog is really an romantic and affectionate work and everyone loves to enjoy. Yet there are some fact which should be understood and applied properly. If you face any difficulty or face any query regarding this tutorial please inform us by leaving your valuable comment below.
Read more »

Sunday, December 25, 2016

Samsung Note clone m706-mb-v3.2 Android 4.4.2 kitkat Firmware

Brand : alps
ProdName  : m72_emmc_s6_pcb22_ddr1
ProdModel : M706
Device    : m72_emmc_s6_pcb22_ddr1
AndroidVer: 4.4.2
MTKxCPU   : MT6572
MTKxPRJ   : ALPS.JB3.MP.V1.12

Download Rom
Password: ''jhunpanabo'' 
Download Flasher

Flashing of any smart Phones or Feature Phone is not always safe. Kindly read our disclaimer, before proceeding or else you can getting any problems towards.
Disclaimer: Flashing a firmware is not without any risks.
If you don't do it properly, you might render your phone inoperable.
If you decide to proceed we won't be liable to whatever might get wrong "neither we could provide technical support" just leave a comment or contact us on our google mail.

 




Factory Firmware Code:
MT6572__alps__M706__m72_emmc_s6_pcb22_ddr1__4.4.2__ALPS.JB3.MP.V1.12
Read more »

Saturday, December 24, 2016

C# Program to Print different Shapes | Triangle | half triangle

C# Program to Print different Shapes

Program Statement:
Write a program using for loop which prints the following output on the screen.
*
***
*****
*******
*********
***********

Solution:
 static void Main(string[] args)
{
for (int i = 0; i <= 10; i=i+2)
{
for (int j = 0; j <= i; j++)
{
Console.Write("*");
}
Console.WriteLine();
}
Console.ReadLine();
}


Read more »

C# Program to Print shapes diamond | half diamond

C# Program to Print shapes

Program Statement:
Write a program using for loop which prints the following output on the screen.
*
**
***
****
***
**
*

Solution:
 static void Main(string[] args)
{
for (int i = 0; i <= 3; i++)
{
for (int j = 0; j <= i; j++)
{
Console.Write("*");
}
Console.WriteLine();

}
for (int i = 3; i >0; i--)
{
for (int j = 0; j <= i-1; j++)
{
Console.Write("*");
}
Console.WriteLine();

}
Console.ReadLine();}


Read more »

C# Program to check entered value is character, integer or special symbol

C# Program to check entered value is character, integer or special symbol

Program Statement:
Write a program which takes one value from user and check whether the entered value is character, integer or special symbol.

Solution:
 static void Main(string[] args)
{
char value;
int a;
Console.WriteLine("Enter value to check Character, integer or special symbols ");
value = Convert.ToChar(Console.ReadLine());
a=(int)value;
if (a >= 65 && a <= 90 || a >= 97 && a <= 122)
Console.WriteLine("Entered Value is Character");
else if(a>=48 && a<=57)
Console.WriteLine("Entered Value is Integer");
else if(a>=0 && a<=47 || a>=58&&a<=64 || a>=91&&a<=96 || a>=123&&a<=127)
Console.WriteLine("Entered Value is Special Symbols");
else
Console.WriteLine("Invlaid input :(");
Console.ReadLine();
}


Read more »

C# Program to check number is prime or composite

C# Program to check entered number is prime or composite 

Program Statement:
Write a program that takes an integer as an input from user and prints if it is a prime or composite number.

Solution:
 static void Main(string[] args)
{
int num, i;
Console.WriteLine("Enter the number to check number is prime or composite");
num=Convert.ToInt32(Console.ReadLine());
i = 2;
while (i <= num - 1)
{
if (num % i == 0)
{
Console.WriteLine("composite number: "+num);
break;
}
i++;
}
if (i == num)
Console.WriteLine("prime number: " + num);
Console.ReadLine();

}


Read more »

C# Program to Print Fibonacci series

C# Program to Print Fibonacci series

Program Statement:
Write a program which prints the Fibonacci series using loop.
1 1 2 3 5 8 13 21 34 …

Solution:
 public class _fib
{
int f = 0, s = 1, n, fib = 0;
public void _show()
{
Console.WriteLine("\n\t\tPrint fibonacci series 0 1 1 2 3 5 8 13 ...\n\n");
Console.Write("\n\t\tEnter range of terms of fibonacci series : ");
n = Convert.ToInt32(Console.ReadLine());
Console.Write("\n\t\tFirst {0} terms are : ", n);
for (int x = 0; x < n; x++)
{
if (x <= 1)
{ fib = x; }
else
{
fib = f + s;
f = s;
s = fib;
}
Console.Write("{0} ", fib);
}
Console.WriteLine("\n");
}
}


Read more »

C# Program to Print ASCII Values Using do-while Loop

C# Program to Print ASCII Values Using do-while Loop

Program Statement:
Write a program to print all the ASCII values and their equivalent characters using a do-while loop. The ASCII values vary from 10 to 255.

Solution:
 static void Main(string[] args)
{
int i = 0;
Console.WriteLine("ASCII character");
do
{
Console.WriteLine(i+" "+(char)i);
i++;
} while (i <= 255);
Console.ReadLine();
}


Read more »

C# Program to count total characters entered by users

C# Program to Print Entering Characters from users and then Count Total entering characters 

Program Statement:
Write a program which takes characters from user until user press ENTER and then program will show the number of words with length greater than or equal to 5.

Solution:
public class length
{
int count1 = 0, count2 = 0;
public void check()
{
Console.Write("\n\t\tEnter string : ");
string ch = Console.ReadLine();
for (int x = 0; x < ch.Length; x++)
{
if (ch[x] == ' ')
{
count1++;
if (x >= 5)
{ count2++; }
}
}
Console.WriteLine("\n\t\tNumber of words with length greater than or equal to 5 : {0}", count2);
Console.WriteLine();
}
}


Read more »

Professional C# 2008

Professional C# 2008
Professional C# 2008 

If we were to describe the C# language and its associated environment, the .NET Framework, as the most important new technology for developers for many years, we would not be exaggerating. .NET is designed to provide a new environment within which you can develop almost any application to run on Windows, whereas C# is a new programming language that has been designed specifically to work with .NET. This Book Wrox Professional C# 2008 is best for learning C# and below its Content list.
Chapter 1: .NET Architecture
Chapter 2: C# Basics
Chapter 3: Objects and Types
Chapter 4: Inheritance
Chapter 5: Arrays
Chapter 6: Operators and Casts
Chapter 7: Delegates and Events
Chapter 8: Strings and Regular Expressions
Chapter 9: Generics
Chapter 10: Collections
Chapter 11: Language Integrated Query
Chapter 12: Memory Management and Pointers
Chapter 13: Reflection
Chapter 14: Errors and Exceptions
Chapter 15: Visual Studio 2008
Chapter 16: Deployment
Chapter 17: Assemblies
Chapter 18: Tracing and Events
Chapter 19: Threading and Synchronization
Chapter 20: Security
Chapter 21: Localization
Chapter 22: Transactions
Chapter 23: Windows Services
Chapter 24: Interoperability
Chapter 25: Manipulating Files and the Registry
Chapter 26: Data Access
Chapter 27: LINQ to SQL
Chapter 28: Manipulating XML
Chapter 29: LINQ to XML
Chapter 30: .NET Programming with SQL Server
Chapter 31: Windows Forms
Chapter 32: Data Binding
Chapter 33: Graphics with GDI+
Chapter 34: Windows Presentation Foundation
Chapter 35: Advanced WPF
Chapter 36: Add-Ins
Chapter 37: ASP.NET Pages
Chapter 38: ASP.NET Development
Chapter 39: ASP.NET AJAX
Chapter 40: Visual Studio Tools for Office
Chapter 41: Accessing the Internet
Chapter 42: Windows Communication Foundation
Chapter 43: Windows Workflow Foundation
Chapter 44: Enterprise Services
Chapter 45: Message Queuing
Chapter 46: Directory Services
Chapter 47: Peer-to-Peer Networking
Chapter 48: Syndication

Read more »

How to get Whatsapp free for 10 years.

How to get Whats app free for 10 years.

As we Know that over 20 million people registered on whats app and the growth is increasing day by day with the passage of time.Whats app is one of the most popular messenger in the world because of its key features and reliability. But the main problem is that how to get whats app premium for free.So here is the trick for you to get free whats app for 10 years.

Gadgets you needed :
A. Iphone / Ipad  
B. Your own Android phone

Also Read:How to get verify your payza account for all countries.

How to extend your whatsapp membership:
1. Register your Android WhatsApp phone number on WhatsApp for iPhone (doesn't need to change the sim card, just register the number only).

2. Enter 3 digit SMS code sent to your sim card and enter it on WhatsApp for iPhone.

3. Re install whatsapp for Android, then register your number that already registered in iPhone and you will get 10 years license.

Feel free to share your experience thank you!

Read more »

Friday, December 23, 2016

How to root Lenovo A269i android

Tools needed Volcano Box, a third party tools you can check out there site HERE. how to root your Lenovo A269i, you can follow the arrow red picture below. or you can check the help manual on software tab area.
(note) after root is done phone rebooting on lenovo welcome logo. just removed the battery and put it again and turn your phone. with the root is done.




Read more »

Thursday, December 22, 2016

Uninformed Searching Algorithms in Artificial Intelligence || how to apply Uninformed Searching Algorithms

Uninformed Searching Algorithms in Artificial Intelligence
Uninformed Searching Algorithms in Artificial Intelligence


Searching:

Man has ability to find things and best solutions for satisfying own desires but one thing which we never realized and that is our searching power to find anything which is most useful and helpful for us. Whenever we face any problem we do search for best solution. As when we search we got lot of options to solve our problems but we select best one and most of the people says the actual problem arise when we have lot of options and select best one but in Artificial Intelligence Different Searching Algorithms help us to select best choice from many and AI major use in Searching Algorithms. The main theme of this assignment also based on Searching Algorithms of AI. There are four major characteristics to analyze Searching strategy on which base we can say our searching algorithm is best and we got our solution in most efficient manner. Below is the four major characteristics to analyze Searching strategy


Completeness: 
The given searching algorithm has ability to complete whole search and give best solution in end.
Time Complexity: How much Time will be consumed to get proper solution by following searching technique.
Space Complexity: How much sources will utilize during searching process.
Optimality: Find out best quality solution from many.
Without above mentioned Search strategy we can’t find best Searching Algorithm.
Categories of Searching Strategy
Uninformed/Blind
Informed/Heuristic
Any Path/Non-optimal
Optimal Path
Q#1: You have to analyze algorithms under blind/uninformed search category i.e. Breadth First Search, Depth First Search, Depth Limited Search and Iterative Deepening. You must have to discuss all four characteristics for each algorithm ONE BY ONE.

Uninformed/Blind search is same like work with blank mind but this also implement using some strategy. In this search there is no proper information about how many steps or path cost required to reached desired goal that’s why it also called Blind search. Six Uninformed search strategies are as follow
Breadth First Search
Depth First Search
Depth Limited Search
Iterative Deepening Search
Bidirectional Search
Uniform Cost Search

1.Breadth First Search:

Breadth First Search is one of the simplest search strategy by expanded the root Node and then generated other nodes from Root in this way got successors. This search can also implemented by calling General Search Algorithm. In this manner a queuing function is used which puts the newly generated states at the end of the queue. This algorithm works at level wise mean level to level goal find and this is best systematic searching technique in which goal can find easily and quickly. This is also time saving because breadth first search always find shallowest goal state first. Now below is the Characteristics of Searching Strategy to see weather Breadth First Search fulfill all four characteristics or not
Completeness: If goal exist in finite depth then terminate.
Time Complexity: Not time saving because as your level of search increasing your time will also increase which will become major headache to solve problem
Space Complexity: Take lot of memory because all the leaf nodes must be maintained in memory
Optimality: Breadth First Search considered good for optimality because if you goal exist in upper level then you can easily find and reached.

2.Depth First Search:

In this Blind Search algorithm move from root to left most successors node. It is best use of memory because it store only one path from root to leaf node. If goal not find then move to siblings if they exist but with same strategy to move left node/link. One of the most important thing which should be follow when applying this strategy, already visited/explore or write node will not visited again so best way is to discard all visited nodes. In many Problems searching Depth First Search considered faster than Breadth First Search because it uses best technique by exploring small portion of whole tree for finding solution.
Completeness: Completeness effect in two ways if the desired goal gain at shallowest level then terminate otherwise the searching continue and in big tree structure its most difficult. So in short its not Complete.
Time Complexity: Depth First Search take less time because in this technique specific path follow instead of flowing whole tree and just move downward so less time required.
Space Complexity: Best use of resources because in this technique on root to leaf node path is saved and if goal not found then visited nodes will discard so it is modest way to use memory.
Optimality: One of the major drawback of depth first search is that it may get stuck on different states because if goal not found and control move deep to deep node then its difficult to find goal because you away from real goal as the real goal may exist at upper level so in this way it is not optimal.

3.Depth Limited Search:

This searching algorithm works same like Depth First search as its time and space complexity is same like Depth first search but with little modification as its name suggest Limited search and this can be done through general search algorithm. As is already discussed in DFS the goal can’t find if searches down with infinite length tree so in this way DFS not guaranteed to find the solution that’s why it not fulfill the characteristic of Completeness so for solving this problem of DFS introduced DLS. DLS guaranteed to find solution with in given depth limit but its not sure to find most optimal path so its not optimal.  
Completeness: It is complete search strategy.
Time Complexity: Just move root to leaf so easy take less time as compared to others searching algorithms.
Space Complexity: Less space required no need to store extra nodes which visited already.
Optimality : Not optimal

4.Iterative Deepening Search

Iterative Deepening Search is the combination of Depth First Search and Breadth First Search. In short this combine the best part of both algorithms like IDS is complete and optimal like Breadth First Search with use of less memory like Depth First Search. If take its time then its not better than Breadth First Search because if goal not found then nodes expanded on each low level. Iterative Deepening is the best search technique work in large search space with unknown depth solution.
Completeness: yes! Follow BFS best technique so it is complete searching algorithm. So when goal achieved terminate
Time Complexity: Its not time saving in other words its most worse than BFS in matter of time.
Space Complexity: Use less space by using technique of DFS.
Optimality : yes! Find goal by using best technique so it become easy to reach desired goal by searching best method

Q#2: Compare these algorithms with each other and discuss with reasons/examples that which algorithm is better then other and in what situations/environments.

The above mentioned searching algorithms in Answer 1 has some special characteristics which make them differ from each other. Some algorithms are best in some environment and some are best in other environment these both depend on their characteristics. According to the above discussed unique characteristics of four searching algorithms we can compare them. These algorithms compare according to Characteristics of searching strategy which are completeness, time complexity, space complexity and optimality.

Breadth First Search & Depth First Search

These both are most important and simple in implementation Uninformed/Blind search algorithms and both has opposite characteristics. If we discuss according to their performance and faster searching then BFS said to be faster because it uses shallowest searching technique and works at level wise and on other hand DFS searching to depth so if your goal exist in upper level like Goal may be at level 2 then BFS find it fast and show result but if tree is long then DFS search depth and may b just searching on depth level and got stuck.
Example 1:
If our Goal is UOG and we move from Jhelum then we have many paths to reach UOG and some may be not take us at UOG so which we select?
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
 If apply BFS then we will got our Goal at level 3 and terminate but if we apply DFS then search start from jhe then sar,mad,kal,lal so its not optimal way to find path.

Depth First Search & Depth Limited Search

Depth Limited search is use to eliminate the problems of DFS because in DFS goal may not be find if length of tree infinite so with DLS we can overcome from this problem by setting the limit and the search process start and do work until limit value become false. Limit value set according to given problem like in below example Limit value will be l = 3
Example 2:             
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
In the above our Goal is 4 then the DLS works well because in this least one goal state at a depth which less than l, so in this way this algorithm guaranteed to find goal. If apply DFS then that goal move to left most node with depth so its become difficult to reached our goal.

Iterative Deepening Search VS DFS,BFS & DLS

IDS is combine with the best characteristics of DFS and BFS. IDS is basically use to overcome the problem of  DLS because in DLS if we don’t have idea about the lowest depth of a goal state then always find the best limit l by trying all possible depths for l until we achieved a goal state. But this technique become wasteful because all the DLS for limit l less than the goal level are not useful and its may be possible many states are expanded many times. So in DLS searching  time may be spent at the deepest level of the search tree. So this Searching algorithm works well and in optimal way.
Example 3:
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
If we assume we don’t have any goal in above example and perform search to find goal that not exist in above example like D so the iteration will be start from Depth 0 where just one start state A which is not the goal so we expand A and got two child B and C as one thing in mind perform DFS and BFS properties and then we see our goal on each depth and expand further in this way our iterations will be
A
ABC
ABEFCGI
ABEJFKCGLIM
In this way whole tree will be searched and it is Complete and Optimal like BFS because all Nodes expanded on each level and it is also modest memory requirements like DFS because just store the result of goal and other visited nodes discard mean not visit again and again.
So now if Compare all Four algorithms in terms of Characteristics of Searching Strategy then result will be

Completeness:
BFS: Goal exist in finite depth then terminate
DFS: Mostly problem searching its not completed and got stuck
DLS: Provide complete search strategy
IDS: Best technique for complete search

Time Complexity:
BFS: Not Time Saving
DFS: Take less time in some situation but most of time also show opposite reaction
DLS: Take less time
IDS: Not time saving because its time complexity equal to BFS

Space Complexity:
BFS: Using lot of memory so not good for resources
DFS: Save lot of memory best for utilizing resources
DLS: Less space required
IDS: Use technique of DFS so less space use

Optimality:
BFS: Provide optimal solution
DFS: Not give optimal solution
DLS: Not optimal for finding solution
IDS: Best! Provide optimal solution
So, in short best one algorithm is IDS but other also best depend on their problem situation as discussed above comparison.

Q#3: Explain how we can improve the performance of all said algorithms?

Before choosing the Searching Algorithm first analyze the problem carefully because without any proper knowledge and understanding about problem we can’t move further and select best searching technique. As in above two questions briefly explain their advantages and disadvantages which gives according to the four basic pillars of searching in AI those are the Characteristics. And the Algorithm which satisfied the maximum characteristics of searching strategy is Iterative Deepening Search. As we can’t break the rules which defined in above four searching algorithms so the best way is to improve their performance is chose best searching algorithm according to problem. Analyze the problem carefully and see which algorithms satisfied maximum characteristics and then apply search.

Q#4: Convert following graph in tree and apply Breadth First Search. You have to apply step by step process and show status of OPEN and CLOSE queues.
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
Answer 4:
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
Root Node: 0
Goal: 6
Open State
Close State
Open=[0]
Close=[]
Open=[1,4]
Close=[0]
Open=[4,2,4,5]
Close=[1,0]
Open=[2,4,5,1,5]
Close=[4,1,0]
Open=[4,5,1,5,3,6]
Close=[2,4,1,0]
Open=[5,1,5,3,6,5]
Close=[4,2,4,1,0]
Open=[1,5,3,6,5,4,6]
Close=[5,4,2,4,1,0]
Open=[5,3,6,5,4,6,2,5]
Close=[1,5,4,2,4,1,0]
Open=[3,6,5,4,6,2,5,1,6]
Close=[5,1,5,4,2,4,1,0]
Open=[6,5,4,6,2,5,1,6,6,7]
Close=[3,5,1,5,4,2,4,1,0]
Open=[5,4,6,2,5,1,6,6,7,3,5,7]
Close=[6,3,5,1,5,4,2,4,1,0]

Q#5: Convert following graph in tree and apply Depth First Search. You have to apply step by step process and show status of OPEN and CLOSE queues.
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
Answer 5:

Directed 
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process

Open State
Close State
Open[E1]
Close[]
Open[E2,E3,E5,E9]
Close[E1]
Open[E3,E5,E8,E3,E5,E9]
Close[E2,E1]
Open[E5,E5,E8,E3,E5,E9]
Close[E3,E2,E1]
Open[E6,E8,E9,E5,E8,E3,E5,E9]
Close[E5,E3,E2,E1]
Open[E9,E8,E9,E5,E8,E3,E5,E9]
Close[E6,E5,E3,E2,E1]
Open[E8,E9,E5,E8,E3,E5,E9]
Close[E9,E6,E5,E3,E2,E1]
Open[E9,E5,E8,E3,E5,E9]
Close[E8,E9,E6,E5,E3,E2,E1]
Open[E5,E8,E3,E5,E9]
Close[E9,E8,E9,E6,E5,E3,E2,E1]
Open[E6,E8,E9,E8,E3,E5,E9]
Close[E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9,E8,E9,E8,E3,E5,E9]
Close[E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E8,E9,E8,E3,E5,E9]
Close[E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9,E8,E3,E5,E9]
Close[E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E8,E3,E5,E9]
Close[E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E3,E5,E9]
Close[E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E5,E5,E9]
Close[E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E6,E8,E9,E5,E9]
Close[,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9,E8,E9,E5,E9]
Close[E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E8,E9,E5,E9]
Close[,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9,E5,E9]
Close[,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E5,E9]
Close[,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E6,E8,E9,E9]
Close[,E5,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9E8E9E9]
Close[E6,E5,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E8,E9,E9]
Close[E9,E6,E5,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9,E9]
Close[E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[E9]
Close[E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]
Open[]
Close[E9,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E8,E9,E8,E9,E6,E5,E9,E8,E9,E6,E5,E3,E2,E1]

Undirected:
Uninformed Searching Algorithms in Artificial Intelligence || Basic Searching Process
As it has lot of branches so it has lot of Open[] and Close[]




Read more »