IT's Good

Parentheses Code

C code 

#include <stdio.h>
#include <stdlib.h>
#define max 50
int  arepair(char opening,char closing)
{
if(opening == '(' && closing == ')') return 1;
else if(opening == '{' && closing == '}') return 1;
else if(opening == '[' && closing == ']') return 1;
return 0;
}
int main(int argc, char const *argv[])
{
char stk[max],exp[100];
int top,i;
top=-1;
printf("Enetr sting");
gets(exp);
printf("%s\n",exp);
for (int i = 0; exp[i]!='\0'; i++)
{
if(exp[i]=='('||exp[i]=='['||exp[i]=='{')
{
top++;
stk[top]=exp[i];
}
else if(exp[i]==')'||exp[i]=='}'||exp[i]==']')
{
if(0==arepair(stk[top],exp[i]))
printf("NOT paired");
else
top--;
}
}//for
if(top==-1)
printf("Exp is balance");
else
printf("NOT\n");
return 0;
}



OUTPUT
C:\Users\rushi\Desktop\1>gcc parant.c

C:\Users\rushi\Desktop\1>a.exe
Enetr sting{()[()()]}
{()[()()]}
Exp is balance
C:\Users\rushi\Desktop\1>a.exe
Enetr sting{][}
{][}
NOT pairedNOT pairedNOT

C:\Users\rushi\Desktop\1>

Bubble Sort Useing python

Bubble Sort Useing Python 2.7

Bubble Sort is simple sorting Algorithm which wark step by step sorting according to the passes or iteration

---

---

Rules to sort

• Number of iteration or passes is to be done is eqal to number of element in the list
• Compare each pare of adjesent two numbers

• Swaps them untill the no swaps are needed

Strategy To be use to write python code

• Use list to take input
• Append is python define list function
• For loop of "X" varible is to number of passes or iteration
• For loopof "XX" is for no of sorting in single pass to be done

PYTHON CODES

Code Useing Simple Python

o_list=[] #define empty list print 'Number of Element to be sort' no_element=input('>') for i in range(0,no_element): num=int(input('>')) o_list.append(num) print 'Your Unsorded List is :-', print o_list #sording Algorithem for x in range(0,no_element): #no of times check the list is sort or not for xx in range(0,no_element-x-1): #3 compare to be done in(2,3,4,5) if(o_list[xx]>o_list[xx+1]): temp=o_list[xx] o_list[xx]=o_list[xx+1] o_list[xx+1]=temp print o_list

 C:\Users\rushi\Desktop\mypyDec>python bubbleSort.py
Number of Element to be sort
>4
>3
>1
>8
>6
Your Unsorded List is :- [3, 1, 8, 6]
[1, 3, 6, 8]

Pyhton Program using class is little bit large but easy to understand.

• Class Name of "sortAlgo" is use .
• Many Function is use to make program simple to understand.
• "__init__" is constracter used to define empty List "o_list"

PYTHON CODES

Code Useing Class Concept and Function

class sortAlgo(): def __init__(self): self.o_list=[] def take_input(self): print 'Enter Number of Element to be sort' self.no_element=input('>>') print 'Enter Element' for x in range(0,self.no_element): num=int(input('>')) self.o_list.append(num) self.printList(self.o_list) print 'Your Unsorded List is:-', self.printList(self.o_list) #call sorting function self.sortList(self.o_list) def printList(self,PrintL): print PrintL def sortList(self,o_list): for x in range(0,self.no_element): for xx in range(0,self.no_element-x-1): #3 compare to be done in(2,3,4,5) if(o_list[xx]>o_list[xx+1]): #here i return 2 values from fun sort2Number o_list[xx],o_list[xx+1]=self.sort2Number(o_list[xx],o_list[xx+1]) print 'Your sorded List is:-', self.printList(self.o_list)#call print function def sort2Number(self,num1,num2): temp=num1 num1=num2 num2=temp return num1,num2 #creating object obj1=sortAlgo() #calling function take_input obj1.take_input()

C:\Users\rushi\Desktop\mypyDec>python bubbleSortClass.py
Enter Number of Element to be sort
>>4
Enter Element
>3
[3]
>1
[3, 1]
>8
[3, 1, 8]
>6
[3, 1, 8, 6]
Your Unsorded List is:- [3, 1, 8, 6]
Your sorded List is:- [1, 3, 6, 8]

C:\Users\rushi\Desktop\mypyDec>

Hello World Program phyton

In Python Printing any thing is easy and simple .
° There's no need to tell that no z

Implemention of Binary Tree using Python

Implemention of Binary Tree Using Python 

The Python code is according to python 2.7

In computer science, a binary tree is tree data structure in which each node has at most two childe,each one referred a left child and right child
Each node contain three parts :-
1)Address of node on his left size 2)Value stored by node 3)Address of node on his right size
The Tree Represention Is As :->

PYTHON CODES

Code For creating Binary Tree

This code is only for creating the tree .If u try to run this u don't get any output on terminal I Know gays....the code is bit large .but i try my best to mini. it. class TreeNode: def __init__(self,value): self.lnode=None self.rnode=None self.value=value class Tree: def __init__(self): self.root=None def getRoot(self): return self.root #To check if root is available #-or not while inserting nod def AddNode(self,value): if(self.root==None): self.root=TreeNode(value) else: self._AddNode(value,self.root) def _AddNode(self,value,node): if (value<node.value): if(node.lnode!=None): self._AddNode(value,node.lnode) else: node.lnode=TreeNode(value) else: if(node.rnode!=None): self._AddNode(value,node.rnode) else: node.rnode=TreeNode(value) #most importent part of Program tree=Tree() #creating tree object name "tree" #creating tree print 'No of node to add' count=input('>') print 'Enter node value' for x in xrange(0,count): pp=input(">") tree.AddNode(pp)

Code For creating Binary Tree with Printing in diferrent form

I use Overloading in the printing the Triee in different form

• In-Order
• Pre-Order
• Post-Order

class TreeNode: def __init__(self,value): self.lnode=None self.rnode=None self.value=value class Tree: def __init__(self): self.root=None def getRoot(self): return self.root #To check if root is available #-or not while inserting nod def AddNode(self,value): if(self.root==None): self.root=TreeNode(value) else: self._AddNode(value,self.root) def _AddNode(self,value,node): if (value<node.value): if(node.lnode!=None): self._AddNode(value,node.lnode) else: node.lnode=TreeNode(value) else: if(node.rnode!=None): self._AddNode(value,node.rnode) else: node.rnode=TreeNode(value) def printTree(self,j=None): if (self.root!=None and j==None): self._printTree(self.root) elif(j==1): self._printTree1(self.root) elif(j==2): self._printTree2(self.root) else: print 'Tree is Empty' #in-order trivers code def _printTree(self,node): if(node!=None): self._printTree(node.lnode) print str(node.value), self._printTree(node.rnode) def _printTree1(self,node): if(node!=None): print str(node.value), self._printTree(node.lnode) self._printTree(node.rnode) def _printTree2(self,node): if(node!=None): self._printTree(node.lnode) self._printTree(node.rnode) print str(node.value), #most importent part of Program tree=Tree() #creating tree object name "tree" #creating tree print 'No of node to add' count=input('>') print 'Enter node value' for x in xrange(0,count): pp=input(">") tree.AddNode(pp) #print tree print 'Print Tree in IN-ORDER :-', tree.printTree() print "" print 'Print Tree in Pre-Order :-', tree.printTree(1) print "" print 'Print Tree in Post-Order :-', tree.printTree(2)

Output:-
C:\Users\rushi\Desktop\mypyDec>python bt2.py
No of node to add
>6
Enter node value
>70
>40
>80
>15
>50
>75
Print Tree in IN-ORDER :- 15 40 50 70 75 80
Print Tree in Pre-Order :- 70 15 40 50 75 80
Print Tree in Post-Order :- 15 40 50 75 80 70

C:\Users\rushi\Desktop\mypyDec>

Decimal to Binary Conversation using python

Convert Decimal to binary using python 2.7

Steps to convert Decimalto binary

step 1:- divide given number by 2
step 2:-record remainder from step1 as the rightmost digits
step 3:-divide the quotient of previous by 2
step 4:-record remainder from step3 as the next rightmost digits
step 5:-repeat untill zero at quotient

I specially recommend to use second  second code  (arithmetic logic code)

PYTHON CODES

Code Using function define by 

python itself

while 1: print "Enter Number in decimal form " decNo=int(input("> ")) print"%d in binNo =%s"%(decNo,bin(decNo)) print "*"*10 print 'Enter x to end or y to again' x=raw_input(">") if x=='x': break

---

Code Using arithmetic

def Decimal_to_binary(no): if no>1: Decimal_to_binary(no//2) print no%2, xx=input('Enter input') print xx, print 'in binary :- ', Decimal_to_binary(xx)

Output of prog using define fun.
python NoConv.py
Enter Number in decimal form
> 3
 3 in binary = 0b11
**********
Enter x to end program or y to convert
>y
Enter Number in decimal form
> 4
 4 in binary = 0b100
**********
Enter x to end program or y to convert
>x

Output of prog using arithmetic
rushi\Desktop\>python NoConv.py
Enter input > 33
33 in binary :-  1 0 0 0 0 1
PS C:\Users\rushi\Desktop\mypyDec>

Fibonacci Number using Python Code

Fibonacci Numbers Using Pythan 

Definition :-

In mathematics,theFibonacci Number are numbers in following integer sequence 3,5,8,13,21,34,55

Fn=Fn-1 +Fn-2

where seed Values F1=1 and F2=1

The first 11 Fibonacci numbers Fn for n=0,1,2,....,11 are

f0	f1	f2	f3	f4	f5	f6	f7	f8	f9	f10	f11
0	1	1	2	3	5	8	13	21	34	55	89

PYTHON CODES

When the series start with any two consecutive user define no's

num1=input( 'Enter first no ') num2=input( 'Enter second no ') Tno=input('NO of terms in Series') print num1 print num2 while(Tno-2): c=num1+num2 num1=num2 num2=c print c Tno=Tno-1

---

When the series start with 1 and user define Terms

num1=1 num2=1 Tno=input('NO of terms in Series') print num1 print num2 while(Tno-2): c=num1+num2 num1=num2 num2=c print c Tno=Tno-1

Roots of Quadratic Equations using Python code

Roots of Quadratic Equations using Python code

ax2+bx+c=0
where x represents an unknown, and a, b, and c represent known numbers such that a is not equal to 0. If a = 0, then the equation is linear, not quadratic.

cmath :- 

This module is always available. It provides access to mathematical functions for complex numbers. The functions in this module accept integers, floating-point numbers or complex numbers as arguments.

Root's of Q Equation

-------------------------------------Python Code-----------------------------------

import cmath
print 'input'
a=input('side 1')
b=input('side 2')
c=input('side 3')
inroot=b**2-(4*a*c)
sol1=(-b- cmath.sqrt(inroot))/(2*a)
sol2=(-b+ cmath.sqrt(inroot))/(2*a)

Check Number is Prime Using Python

Number is Prime Or Not

First We want to Know Theory of  Prime Number

A prime number (or a prime) is  natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite Number For example, 5 is prime because 1 and 5 are its only positive integer factors

The first 100 prime numbers (all the prime numbers less than 100) are:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97

Python Code for check Number  is prime or Not .

---------------------------------------------------------------------------------------------------------------------------

while(1): print 'Enter Number to check' num1=input(">") if num1<=1: print 'Not a Prime Number.' else : for x in xrange(2,num1): if(num1%x)==0: print 'Given input %d is not Prime' %num1 print 'Bcos if we multiple %d with %d we get %d'%(x,num1//x,num1) break else: print 'Given input %d is Prime' %num1
----------------------------------------------------------------------------------------------------------------------

compare three numbers

Compare Three Numbers In Simple Way

 First  way  :-

Let assume three no's num1 , num2 , num3  which we want to compare.

So we want a technique which we can learn faster and we can remember easily  and simple  .

----------------------------------------------------------------------------------------------------------------

while 1:
print '---------------------------------------------
        num1=float(input("Enter 1 no to check >  "))
num2=float(input("Enter 2 no to check >  "))
num3=float(input("Enter 3 no to check >  "))
        if num1>num2 and num1>num3:
larger=num1
elif num2>num3:
larger=num2
else:
larger=num3
print ' larger one %f' %larger

-------------------------------------------------------------------------------------------------------

Second way  :-

Let assume three no's num1 , num2 , num3  which we want to compare.

This is mostly used by programmer .

------------------------------------------------------------------------------------------------------

        while 1:

        num1=float(input("Enter 1 no to check >  "))
num2=float(input("Enter 2 no to check >  "))
num3=float(input("Enter 3 no to check >  "))
if num1>=num2 and num1>=num3:
larger=num1
elif num2>=num1 and num2>=num3:
larger=num2
else:
larger=num3
print ' larger number is %f' %larger