#Program for reading a line of text
n = 0
print "Enter text press RETRUN to end"
#String function
s1= "Hello"
s2='H''e''l''l''o'
print s1
print s2
#Program using strlen() function
name = "MUNI"
len1 = len(name)
len2 = len("LAK")
print "String length of %s is %d" %(name,len1)
print "String length of %s is %d" %("LAK",len2)
#Program using strcpy() function
def strcpy(cstring1):
import copy
cstring2=copy.copy(cstring1)
return cstring2
source = "MUNI"
target = strcpy(source)
print "Source string is %s" %source
print "Target string is %s" %target
#Strcat function
str1="MUNI"
str2="LAK"
print str1+str2
#Program using strcat() function
def strcat(cstring1, cstring2):
cstring3 = cstring1 + cstring2
return cstring3
source = "Ramesh"
target = "Babu"
source = strcat(source,target)
print "Source string is %s" %source
print "Target string is %s" %target
#Program using strcmp() function
name = "Kalai"
name1 = "Malai"
if name =="Kalai":
print "0",
if name1!=name:
print "1",
if name != "Kalai mani":
print "6"
#Program using strrev() function
def strrev(cstring1):
cstring2 = ' '
for i in range(len(cstring1)-1,-1,-1):
cstring2 = cstring2 + cstring1[i]
return cstring2
y = raw_input("Enter the string ")
print "The string reversed is : %s" %strrev(y)
#Program using enumerated data type
def enum(*sequential, **named):
enums = dict(zip(sequential, range(len(sequential))), **named)
return type('Enum', (), enums)
week = enum(' ', 'sun','Mon','Tue','Wed','Thr','Fri','Sat')
print "Mon = %d" %week.Mon
print "Tue = %d" %week.Tue
print "Wed= %d" %week.Wed
print "Sat = %d" %week.Sat
#Program to identify whether the entered character is letter, digit or other symbols
def enum(*sequential, **named):
enums = dict(zip(sequential, range(len(sequential))), **named)
return type('Enum', (), enums)
ctype = enum(' ', 'Letter', 'Digit', 'Other')
ch = raw_input("Enter a any character.")
a = ch.isalpha()
if a != False:
print "%c is %d type of symbol." %(ch,ctype.Letter)
else:
a = ch.isdigit()
if a != False:
print "%c is %d type of symbol." %(ch,ctype.Digit)
else:
print "%c is %d type of symbol." %(ch,ctype.Other)
#Program for sorting an array of elements
a = []
n = input("Enter Upper limit....")
for i in range(0,n):
a.append(0)
print "Enter elements...."
for i in range(0,n):
a[i]=input()
for i in range(0,n):
for j in range(i,n):
if a[i]>a[j]:
t = a[i]
a[i] = a[j]
a[j] = t
print "Numbers in Ascending order"
for i in range(0,n):
print "%d" %a[i],
#Program to fing Median for a given 'n' numbers
arr = []
n = input("Enter Upper limit....")
for i in range(0,n):
arr.append(0)
print "Enter..%d..values" %n
for i in range(0,n):
arr[i]=input()
for i in range(1,n):
for j in range(1,n-i):
if arr[j] <= arr[j+1]:
t = arr[j]
arr[j] = arr[j+1]
arr[j+1] = t
else:
continue
if n%2 == 0:
median = (arr[n/2]+arr[n/2+1])/2.0
else:
median = arr[n/2+1]
print "Median is....%.f" %median
#Program to find standard deviation for the given data
import math
val = []
sum = ssqr = n = 0
for i in range(0,100):
val.append(0)
print "Enter Values -999 to stop...."
for i in range(0,100):
val[i] = float(raw_input())
if val[i] == -999:
break
sum = float(sum) + val[i]
n = n + 1
mean = float(sum) / float(n)
for i in range(0,n):
dev = val[i] - mean
ssqr = float(ssqr) + float(dev)*float(dev)
var = ssqr / float(n)
sd = math.sqrt(float(var))
print "Number of Items.....%d" %n
print "Mean is .....%f" %mean
print "Standard Deviation is .....%f" %sd
#Bubble sort using function
def bubble(n, x = []):
for item in range(0,n-1):
for i in range(item+1,n):
if x[i]<x[item]:
temp = x[item]
x[item] = x[i]
x[i] = temp
a = []
n = input("Enter upper limit: ")
for i in range(0,n):
a.append(0)
for i in range(0,n):
a[i] = input()
bubble(n,a)
print "After sorting",
for i in range(0,n):
print "%d" %a[i],
#Program to sort an element using Insertion sort
a = []
x = input("Elements to be inserted ")
for i in range(0,100):
a.append(0)
i = 0
while x != -99:
k = i-1
while (x<a[k]) and (k>=0):
a[k+1] = a[k]
k = k-1
a[k+1]=x
print "Array after inserting %d:" %x
for j in range(0,i):
print "%5d" %a[j]
x = input("Elements to be inserted(-99 to stop)?")
i = i+1
print "The final sorted array"
for j in range(0,i):
print "%5d" %a[j],
#Program to sort an element using selection sort
a = []
for i in range(0,100):
a.append(0)
n = input("Enter Number of elements in array...")
print "Enter Elements...",n
for i in range(0,n):
a[i] = input()
for i in range(0,n-1):
m = i
for j in range(i+1,n):
if a[m]>a[j]:
m = j
if i != m:
k = a[i]
a[i] = a[m]
a[m] = k
print "Sorted Array (Selection Sort) is...\n"
for i in range(0,n):
print "%5d" %a[i],
#Quick sort
def quickSort(array):
quickSortHelper(array,0,len(array)-1)
def quickSortHelper(array,right,left):
if right<left:
splitpoint = partition(array,right,left)
quickSortHelper(array,right,splitpoint-1)
quickSortHelper(array,splitpoint+1,left)
def partition(array,right,left):
pivotvalue = array[right]
begin = right+1
end = left
done = False
while not done:
while begin <= end and \
array[begin] <= pivotvalue:
begin = begin + 1
while array[end] >= pivotvalue and \
end >= begin:
end = end -1
if end < begin:
done = True
else:
temp = array[begin]
alist[begin] = array[end]
alist[end] = temp
temp = array[right]
array[right] = array[end]
array[end] = temp
return end
array = []
n=input("Enter the values in array: ")
for i in range (0,n):
array.append(0)
for i in range (0,n):
array[i]=input()
quickSort(array)
print "Quick Sorted Array is", array
#program to find the specified elements from the array using linear searching
a = [100]
for i in range(0,100):
a.append(0)
c = 'y'
while (c=='y')or(c=='Y'):
no = input("Enter the size of sorting")
print "Enter the elements of the array"
for i in range(0,no):
a[i]=input()
k = input("Enter the element to be searched")
for i in range(0,no):
if k == a[i]:
print "Element %d is in the position %d" %(k,i+1)
f=2
break
if f==1:
print "The entered element is not in the array"
ch = raw_input("If you want to continue y/n ")
c = ch
#Program to find the specified element from array using Binary search
a = [100]
for i in range(0,100):
a.append(0)
no = input("Enter the size of sorting")
print "Enter the elements in ascending order"
for i in range(0,no):
a[i]=input()
t = input("Enter the element to be searched")
l=0
h=no-1
while l <= h:
m = (l+h)/2
if t<a[m]:
h = m-1
elif t>a[m]:
l = m+1
else:
print "Entered %d is in position %d" %(t,m+1)
f=2
break
if f==1:
print "Entered element is not in the array"