globalsqa, Author at GlobalSQA

28

Aug

Merge Sort

Question:

Write a program to perform merge sort on [85,63,0,12,47,96,52]

Program:

def mergeSort(alist):
    print("Splitting ",alist)
    if len(alist)>1:
        mid = len(alist)//2
        lefthalf = alist[:mid]
        righthalf = alist[mid:]

        mergeSort(lefthalf)
        mergeSort(righthalf)

        i=0
        j=0
        k=0
        while i < len(lefthalf) and j < len(righthalf):
            if lefthalf[i] < righthalf[j]:
                alist[k]=lefthalf[i]
                i=i+1
            else:
                alist[k]=righthalf[j]
                j=j+1
            k=k+1

        while i < len(lefthalf):
            alist[k]=lefthalf[i]
            i=i+1
            k=k+1

        while j < len(righthalf):
            alist[k]=righthalf[j]
            j=j+1
            k=k+1
    print("Merging ",alist)

alist = [85,63,0,12,47,96,52]
mergeSort(alist)
print(alist)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

def mergeSort(alist):

print("Splitting ",alist)

if len(alist)>1:

mid = len(alist)//2

lefthalf = alist[:mid]

righthalf = alist[mid:]

mergeSort(lefthalf)

mergeSort(righthalf)

i=0

j=0

k=0

while i < len(lefthalf) and j < len(righthalf):

if lefthalf[i] < righthalf[j]:

alist[k]=lefthalf[i]

i=i+1

else:

alist[k]=righthalf[j]

j=j+1

k=k+1

while i < len(lefthalf):

alist[k]=lefthalf[i]

i=i+1

k=k+1

while j < len(righthalf):

alist[k]=righthalf[j]

j=j+1

k=k+1

print("Merging ",alist)

alist = [85,63,0,12,47,96,52]

mergeSort(alist)

print(alist)

Explanation:

Step 1 − if it is only one element in the list it is already sorted, return.

Step 2 − divide the list recursively into two halves until it can no more be divided.

Step 3 − merge the smaller lists into new list in sorted order.

Output:

Splitting  [85, 63, 0, 12, 47, 96, 52]
Splitting  [85, 63, 0]
Splitting  [85]
Merging  [85]
Splitting  [63, 0]
Splitting  [63]
Merging  [63]
Splitting  [0]
Merging  [0]
Merging  [0, 63]
Merging  [0, 63, 85]
Splitting  [12, 47, 96, 52]
Splitting  [12, 47]
Splitting  [12]
Merging  [12]
Splitting  [47]
Merging  [47]
Merging  [12, 47]
Splitting  [96, 52]
Splitting  [96]
Merging  [96]
Splitting  [52]
Merging  [52]
Merging  [52, 96]
Merging  [12, 47, 52, 96]
Merging  [0, 12, 47, 52, 63, 85, 96]
[0, 12, 47, 52, 63, 85, 96]

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

Splitting [85, 63, 0, 12, 47, 96, 52]

Splitting [85, 63, 0]

Splitting [85]

Merging [85]

Splitting [63, 0]

Splitting [63]

Merging [63]

Splitting [0]

Merging [0]

Merging [0, 63]

Merging [0, 63, 85]

Splitting [12, 47, 96, 52]

Splitting [12, 47]

Splitting [12]

Merging [12]

Splitting [47]

Merging [47]

Merging [12, 47]

Splitting [96, 52]

Splitting [96]

Merging [96]

Splitting [52]

Merging [52]

Merging [52, 96]

Merging [12, 47, 52, 96]

Merging [0, 12, 47, 52, 63, 85, 96]

[0, 12, 47, 52, 63, 85, 96]

27

Aug

Lexiographic Sort

By globalsqa No comments yet

Question:

Write a program to sort ‘GlobalSQA’ lexiographically

Program:

def lexicographi_sort(s):
    return sorted(sorted(s), key=str.upper)

print(lexicographi_sort('GlobalSQA'))

1

2

3

4

def lexicographi_sort(s):

return sorted(sorted(s), key=str.upper)

print(lexicographi_sort('GlobalSQA'))

Explanation:

The lexicographic or lexicographical order (also known as lexical order, dictionary order, alphabetical order or lexicographical product) is a generalization of the way the alphabetical order of words is based on the alphabetical order of their component letters. The sorted function sorts it for you.

Output:

['A', 'a', 'b', 'G', 'l', 'l', 'o', 'Q', 'S']

1	['A', 'a', 'b', 'G', 'l', 'l', 'o', 'Q', 'S']

26

Aug

Bubble Sort

By globalsqa No comments yet

Question:

Write a program to perform bubble sort on [85,63,0,12,47,96,52]

Program:

def bubbleSort(alist):
    for passnum in range(len(alist)-1,0,-1):
        for i in range(passnum):
            if alist[i]>alist[i+1]:
                temp = alist[i]
                alist[i] = alist[i+1]
                alist[i+1] = temp

alist = [85,63,0,12,47,96,52]
bubbleSort(alist)
print(alist)

1

2

3

4

5

6

7

8

9

10

11

def bubbleSort(alist):

for passnum in range(len(alist)-1,0,-1):

for i in range(passnum):

if alist[i]>alist[i+1]:

temp = alist[i]

alist[i] = alist[i+1]

alist[i+1] = temp

alist = [85,63,0,12,47,96,52]

bubbleSort(alist)

print(alist)

Explanation:

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.

Output:

[0, 12, 47, 52, 63, 85, 96]

1	[0, 12, 47, 52, 63, 85, 96]

25

Aug

Insertion Sort

By globalsqa No comments yet

Question:

Write a program to perform insertion sort on [85, 63, 0, 12, 47, 96, 52]

Program:

def insertionSort(alist):
   for index in range(1,len(alist)):

     currentvalue = alist[index]
     position = index

     while position>0 and alist[position-1]>currentvalue:
         alist[position]=alist[position-1]
         position = position-1

     alist[position]=currentvalue

alist = [85, 63, 0, 12, 47, 96, 52]
insertionSort(alist)
print(alist)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

def insertionSort(alist):

for index in range(1,len(alist)):

currentvalue = alist[index]

position = index

while position>0 and alist[position-1]>currentvalue:

alist[position]=alist[position-1]

position = position-1

alist[position]=currentvalue

alist = [85, 63, 0, 12, 47, 96, 52]

insertionSort(alist)

print(alist)

Explanation:

Step 1 − If it is the first element, it is already sorted. return 1

Step 2 − Pick next element

Step 3 − Compare with all elements in the sorted sub-list

Step 4 − Shift all the elements in the sorted sub-list that is greater than the value to be sorted

Step 5 − Insert the value

Step 6 − Repeat until list is sorted

Output:

[0, 12, 47, 52, 63, 85, 96]

1	[0, 12, 47, 52, 63, 85, 96]

24

Aug

Quick Sort

By globalsqa No comments yet

Question:

Write a program to perform Quick sort on [85, 63, 0, 12, 47, 96, 52]

Program:

def quickSort(alist):
   quickSortHelper(alist,0,len(alist)-1)

def quickSortHelper(alist,first,last):
   if first<last:

       splitpoint = partition(alist,first,last)

       quickSortHelper(alist,first,splitpoint-1)
       quickSortHelper(alist,splitpoint+1,last)


def partition(alist,first,last):
   pivotvalue = alist[first]

   leftmark = first+1
   rightmark = last

   done = False
   while not done:

       while leftmark <= rightmark and alist[leftmark] <= pivotvalue:
           leftmark = leftmark + 1

       while alist[rightmark] >= pivotvalue and rightmark >= leftmark:
           rightmark = rightmark -1

       if rightmark < leftmark:
           done = True
       else:
           temp = alist[leftmark]
           alist[leftmark] = alist[rightmark]
           alist[rightmark] = temp

   temp = alist[first]
   alist[first] = alist[rightmark]
   alist[rightmark] = temp


   return rightmark

alist =[85, 63, 0, 12, 47, 96, 52]
quickSort(alist)
print(alist)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

def quickSort(alist):

quickSortHelper(alist,0,len(alist)-1)

def quickSortHelper(alist,first,last):

if first<last:

splitpoint = partition(alist,first,last)

quickSortHelper(alist,first,splitpoint-1)

quickSortHelper(alist,splitpoint+1,last)

def partition(alist,first,last):

pivotvalue = alist[first]

leftmark = first+1

rightmark = last

done = False

while not done:

while leftmark <= rightmark and alist[leftmark] <= pivotvalue:

leftmark = leftmark + 1

while alist[rightmark] >= pivotvalue and rightmark >= leftmark:

rightmark = rightmark -1

if rightmark < leftmark:

done = True

else:

temp = alist[leftmark]

alist[leftmark] = alist[rightmark]

alist[rightmark] = temp

temp = alist[first]

alist[first] = alist[rightmark]

alist[rightmark] = temp

return rightmark

alist =[85, 63, 0, 12, 47, 96, 52]

quickSort(alist)

print(alist)

Explanation:

Quicksort is a divide and conquer algorithm. Quicksort first divides a large array into two smaller sub-arrays: the low elements and the high elements. Quicksort can then recursively sort the sub-arrays.

The steps are:

Pick an element, called a pivot, from the array.
Partitioning: reorder the array so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.
Recursively apply the above steps to the sub-array of elements with smaller values and separately to the sub-array of elements with greater values.

The base case of the recursion is arrays of size zero or one, which never need to be sorted.

Output:

[0, 12, 47, 52, 63, 85, 96]

1	[0, 12, 47, 52, 63, 85, 96]

21

Aug

Sum of diagonal elements using Comprehension

By globalsqa No comments yet

Question:

Write a program to find the sum of diagonal elements in a matrix.

Program:

a = [[11,2,4],[4,5,6],[10,8,-12]]
n=len(a)
sum_second_diagonal=sum([a[i][j] for i in range(n) for j in range(n) if i+j==n-1])
print (sum_second_diagonal)

1

2

3

4

a = [[11,2,4],[4,5,6],[10,8,-12]]

n=len(a)

sum_second_diagonal=sum([a[i][j] for i in range(n) for j in range(n) if i+j==n-1])

print (sum_second_diagonal)

Explanation:

Comprehensions provide a concise way to create new set of elements that satisfy a given condition from an iterable. Here the iterable is the for loop looking for diagonal elements. The list thus formed is passed to sum which returns the sum of elements in the list.

Output:

19

1

19

Aug

Reverse a number

By globalsqa No comments yet

Question:

Write a program to reverse a number

Program:

num = (input("Enter any number: "))
reverse = 0
try:
    val = int(num)
    while val > 0:
        reminder = val % 10
        reverse = (reverse * 10) + reminder
        val //= 10
    print('Reverse of given number is : ', reverse)
except ValueError:
    print("That's not a valid number, Try Again !")

1

2

3

4

5

6

7

8

9

10

11

num = (input("Enter any number: "))

reverse = 0

try:

val = int(num)

while val > 0:

reminder = val % 10

reverse = (reverse * 10) + reminder

val //= 10

print('Reverse of given number is : ', reverse)

except ValueError:

print("That's not a valid number, Try Again !")

Explanation:

The while loop contains the statements to isolate or separate the digits of a number ,which is then multiplied to 10 and sums the reminder. Thus you get the reverse.

Let’s try it out

Say n=366

while val>0//True, then reminder is 6,reverse also 6 and val is 36

while 36>0//True, then reminder is 6, reverse is (6*10)+6 =66, and val is 3

while 3>0// True, then reminder is 3,reverse is (66*10)+3=663 and val is 0

Hence reverse is 663

Output:

Enter any number:  895
Reverse of given number is :  598

1 2	Enter any number: 895 Reverse of given number is : 598

18

Aug

Sum of diagonal elements

By globalsqa No comments yet

Question:

Write a program to find the sum of diagonal elements

Program:

a = [[11,2,4],[4,5,6],[10,8,-12]]
n=len(a)
sumn=0
for i in range(n):
 for j in range(n):
  if i+j==n-1:
    sum+=a[i][j] 
print (sumn)

1

2

3

4

5

6

7

8

a = [[11,2,4],[4,5,6],[10,8,-12]]

n=len(a)

sumn=0

for i in range(n):

for j in range(n):

if i+j==n-1:

sum+=a[i][j]

print (sumn)

Explanation:

Diagonal elements are those where i=j, as in a[0][0], a[1][1] etc.the for loop cheks every instant if i is equal to j, if true value of a[i][j] is incremented to sum.

Output:

19

1

19

17

Aug

Length of a string

By globalsqa No comments yet

Question:

Write a program to find the length of a string without inbuilt function

Program:

def strlen(s):
    if s == "": return 0
    return s.rindex(s[-1]) + 1
    
s= "GlobalSQA"
print(strlen(s))

1

2

3

4

5

6

def strlen(s):

if s == "": return 0

return s.rindex(s[-1]) + 1

s= "GlobalSQA"

print(strlen(s))

Explanation:

The strlen function return 0 if the string is empty. Otherwise it adds one to the index position of it;s last element obtained by s.rindex.

Output:

9

1

9

16

Aug

Transpose Two matrices in Python

By globalsqa No comments yet

Question:

Write a program to transpose two matrices

Program:

#! usr/bin/python

m=int(input("ENTER MARTIX ROW SIZE m : "))
n=int(input("ENTER MARTIX COLUMN SIZE n : "))

#initializing matrix elements as 0
X = [[0]*n for j in range(m)]
Y = [[0]*m for j in range(n)]
#getting input to matrix X
for i in range (m):
  for j in range (n):
    print ('entry in row: ',i+1,' column: ',j+1)
    X[i][j] = int(input())
    
#printing first matrix X
print "ORIGINAL MATRIX : "
for i in range (m):
  for j in range (n):
    print X[i][j],"\t",
  print "\n"
    
#transpose of matrix X
for i in range (m):
    for j in range (n):
        Y[j][i]=X[i][j]

#printing transpose matrix Y
print "TRANSPOSE MATRIX : "
for i in range (n):
  for j in range (m):
    print Y[i][j],"\t",
  print "\n"

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

#! usr/bin/python

m=int(input("ENTER MARTIX ROW SIZE m : "))

n=int(input("ENTER MARTIX COLUMN SIZE n : "))

#initializing matrix elements as 0

X = [[0]*n for j in range(m)]

Y = [[0]*m for j in range(n)]

#getting input to matrix X

for i in range (m):

for j in range (n):

print ('entry in row: ',i+1,' column: ',j+1)

X[i][j] = int(input())

#printing first matrix X

print "ORIGINAL MATRIX : "

for i in range (m):

for j in range (n):

print X[i][j],"\t",

print "\n"

#transpose of matrix X

for i in range (m):

for j in range (n):

Y[j][i]=X[i][j]

#printing transpose matrix Y

print "TRANSPOSE MATRIX : "

for i in range (n):

for j in range (m):

print Y[i][j],"\t",

print "\n"

Explanation:

The transpose of a matrix is an operator which flips a matrix over its diagonal, that is it switches the row and column indices of the matrix by producing another matrix denoted as A^T (also written A′, A^tr, ^tA or A^t). It is achieved by any one of the following equivalent actions:

The transpose A^T of a matrix Acan be obtained by reflecting the elements along its main diagonal. Repeating the process on the transposed matrix returns the elements to their original position.

reflect A over its main diagonal (which runs from top-left to bottom-right) to obtain A^T
write the rows of A as the columns of A^T
write the columns of A as the rows of A^T

Formally, the i th row, j th column element of A^T is the j th row, i th column element of A:

\left[\mathbf {A} ^{\mathrm {T} }\right]_{ij}=\left[\mathbf {A} \right]_{ji}

If A is an m × n matrix then A^T is an n × m matrix.

Output:

ENTER MARTIX ROW SIZE m :  2
ENTER MARTIX COLUMN SIZE n :  2
entry in row:  1  column:  1
 8
entry in row:  1  column:  2
 9
entry in row:  2  column:  1
 4
entry in row:  2  column:  2
 8
ORIGINAL MATRIX : 
8    4 	
9    8

TRANSPOSE MATRIX : 
8    9	
4    8

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

ENTER MARTIX ROW SIZE m : 2

ENTER MARTIX COLUMN SIZE n : 2

entry in row: 1 column: 1

8

entry in row: 1 column: 2

9

entry in row: 2 column: 1

4

entry in row: 2 column: 2

8

ORIGINAL MATRIX :

8 4

9 8

TRANSPOSE MATRIX :

8 9

4 8

10

Aug

Fetch all links from a page using Python

By globalsqa No comments yet

Question:

Fetch all links from google home page

Program:

import urllib2
import re

req=urllib2.Request('https://www.google.com')
#connect to a URL
website = urllib2.urlopen(req)

#read html code
html = website.read()

#use re.findall to get all the links
links = re.findall('"((http|ftp)s?://.*?)"', html)

for i in links:
    print i

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

import urllib2

import re

req=urllib2.Request('https://www.google.com')

#connect to a URL

website = urllib2.urlopen(req)

#read html code

html = website.read()

#use re.findall to get all the links

links = re.findall('"((http|ftp)s?://.*?)"', html)

for i in links:

print i

Explanation:

The urllib2 module defines functions and classes which help in opening URLs (mostly HTTP) in a complex world — basic and digest authentication, redirections, cookies and more.

re module provides regular expression matching operations similar to those found in Perl. Both patterns and strings to be searched can be Unicode strings as well as 8-bit strings.

Output:

('http://schema.org/WebPage', 'http')
('https://www.google.co.in/imghp?hl=en&tab=wi', 'http')
('https://maps.google.co.in/maps?hl=en&tab=wl', 'http')
('https://play.google.com/?hl=en&tab=w8', 'http')
('https://www.youtube.com/?gl=IN&tab=w1', 'http')
('https://news.google.co.in/nwshp?hl=en&tab=wn', 'http')
('https://mail.google.com/mail/?tab=wm', 'http')
('https://drive.google.com/?tab=wo', 'http')
('https://www.google.co.in/intl/en/options/', 'http')
('http://www.google.co.in/history/optout?hl=en', 'http')
('https://accounts.google.com/ServiceLogin?hl=en&passive=true&continue=https://www.google.co.in/%3Fgfe_rd%3Dcr%26ei%3D83RYWbugK9WkvwT7j4SwCA', 'http')
('http://www.google.co.in/services/', 'http')
('https://plus.google.com/104205742743787718296', 'http')
('https://www.google.co.in/setprefdomain?prefdom=US&amp;sig=__xO-fFja9LlrL0EjCUtIDcyG3flI%3D', 'http')

1

2

3

4

5

6

7

8

9

10

11

12

13

14

('http://schema.org/WebPage', 'http')

('https://www.google.co.in/imghp?hl=en&tab=wi', 'http')

('https://maps.google.co.in/maps?hl=en&tab=wl', 'http')

('https://play.google.com/?hl=en&tab=w8', 'http')

('https://www.youtube.com/?gl=IN&tab=w1', 'http')

('https://news.google.co.in/nwshp?hl=en&tab=wn', 'http')

('https://mail.google.com/mail/?tab=wm', 'http')

('https://drive.google.com/?tab=wo', 'http')

('https://www.google.co.in/intl/en/options/', 'http')

('http://www.google.co.in/history/optout?hl=en', 'http')

('https://accounts.google.com/ServiceLogin?hl=en&passive=true&continue=https://www.google.co.in/%3Fgfe_rd%3Dcr%26ei%3D83RYWbugK9WkvwT7j4SwCA', 'http')

('http://www.google.co.in/services/', 'http')

('https://plus.google.com/104205742743787718296', 'http')

('https://www.google.co.in/setprefdomain?prefdom=US&sig=__xO-fFja9LlrL0EjCUtIDcyG3flI%3D', 'http')

5

Jul

Generate Passwords

By globalsqa No comments yet

Question:

Write a python program to generate passwords

Program:

import string
from random import *
characters = string.ascii_letters + string.punctuation + string.digits
password = "".join(choice(characters) for x in range(randint(8, 16)))
print (password)

1

2

3

4

5

import string

from random import *

characters = string.ascii_letters + string.punctuation + string.digits

password = "".join(choice(characters) for x in range(randint(8, 16)))

print (password)

Explanation:

Following are the criteria for creating a password:

1. At least 1 letter between [a-z]

2. At least 1 number between [0-9]

1. At least 1 letter between [A-Z]

3. At least 1 character from [$#@]

4. Minimum length of transaction password: 6

5. Maximum length of transaction password: 12

Output:

-|>GR5UZY3

1	-\|>GR5UZY3

4

Jul

Area of Rectangle using classes

By globalsqa No comments yet

Question:

Calculate area of a rectangle using classes

Program:

class rect():
    def __init__(self,breadth,length):
        self.breadth=breadth
        self.length=length
    def area(self):
        return self.breadth*self.length

a=int(input("Enter length of rectangle: "))
b=int(input("Enter breadth of rectangle: "))
obj=rect(a,b) # Creating an object 'obj' of class rect

print "Area of rectangle:",obj.area()

1

2

3

4

5

6

7

8

9

10

11

12

class rect():

def __init__(self,breadth,length):

self.breadth=breadth

self.length=length

def area(self):

return self.breadth*self.length

a=int(input("Enter length of rectangle: "))

b=int(input("Enter breadth of rectangle: "))

obj=rect(a,b) # Creating an object 'obj' of class rect

print "Area of rectangle:",obj.area()

Explanation:
A class rect is created with two breadth and length, and method area which tabulates the area of the rectangle.
An object obj of class rect is created and used

Output:

Enter length of rectangle: 10
Enter breadth of rectangle: 20
Area of rectangle: 200

1

2

3

Enter length of rectangle: 10

Enter breadth of rectangle: 20

Area of rectangle: 200

3

Jul

Even numbers using list comprehension

By globalsqa No comments yet

Question:

Create a list of even numbers between 0 and 10 using list comprehension.

Program:

listl=[i for i in range (10) if(i%2==0)]
print listl

1 2	listl=[i for i in range (10) if(i%2==0)] print listl

Explanation:

List comprehensions provide a concise way to create lists.

It consists of brackets containing an expression followed by a for clause, then
zero or more for or if clauses. The expressions can be anything, meaning you can
put in all kinds of objects in lists.

List comprehensions provide a concise way to create new list of elements that satisfy a given condition from an iterable. Here the iterable prints out even numbers.

Output:

[0, 2, 4, 6, 8]

1	[0, 2, 4, 6, 8]

2

Jul

Prime Numbers within a range

By globalsqa No comments yet

Question :

Write a program to print prime numbers within a range

Program:

#Accept the range from user

lower = int(input("Enter lower range: "))

upper = int(input("Enter upper range: "))



print "Prime numbers between",lower,"and",upper,"are:",



for num in range(lower,upper + 1):

   # prime numbers are greater than 1

   if num > 1:

       for i in range(2,num):

           if (num % i) == 0:

               break

       else:

           print num,

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

#Accept the range from user

lower = int(input("Enter lower range: "))

upper = int(input("Enter upper range: "))

print "Prime numbers between",lower,"and",upper,"are:",

for num in range(lower,upper + 1):

# prime numbers are greater than 1

if num > 1:

for i in range(2,num):

if (num % i) == 0:

break

else:

print num,

Explanation:

A prime number is a number that is divisible only by itself and 1 (e.g. 2, 3, 5, 7, 11).

Output:

Enter lower range: 2

Enter upper range: 10

Prime numbers between 2 and 10 are: 2 3 5 7

1

2

3

4

5

Enter lower range: 2

Enter upper range: 10

Prime numbers between 2 and 10 are: 2 3 5 7

1

Jul

Difference between range() and xrange()

By globalsqa No comments yet

Question:

Write a program to show the difference between range() and xrange() function

Program:

import sys

r=range(10000)
x=xrange(10000)
print (sys.getsizeof(r)) #output:40036
print (sys.getsizeof(x))    #output:20
#sys.getsizeof() returns the memory size occupied by a variable or object

1

2

3

4

5

6

7

import sys

r=range(10000)

x=xrange(10000)

print (sys.getsizeof(r)) #output:40036

print (sys.getsizeof(x)) #output:20

#sys.getsizeof() returns the memory size occupied by a variable or object

Explanation:

The variable holding the range created using range() uses so much memory compared to
the variable created using xrange()

The reason is that range creates a list holding all the values
while xrange creates an object that can iterate over the numbers on demand.

Eventhough the xrange is memory efficient, the price we have to pay
for this efficieny is access time. The range variable created with range()
will have a faster access time compare to the variable created with xrange()
as it is entirely stored in the memory so it is readily available
whereas the variable created with xrange() have to load its contents
to memory ‘on demand’ only. So time efficiency is a drawback of xrange()

Output:

80072
40

1

2

80072

40

30

Jun

Tuple Operations

By globalsqa No comments yet

Question:

Perform the following operations on the below tuple (‘abc’, ‘def’, ‘ghi’, ‘jklm’, ‘nopqr’, ‘st’, ‘uv’, ‘wxyz’, ’23’, ‘s98’, ‘123’, ’87’)

prints the length of the tuple
Slicing
Reverse all items in the tuple
Removing whole tuple
Concatenate two tuples

Program:

tup = ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')

# prints the length of the tuple
print('\ntuple: ', tup)
print('Length of the tuple is : ', len(tup))

# Slicing
# shows only items starting from 0 upto 3
print('\ntuple: ', tup)
print('tuple showing only items starting from 0 upto 3\n', tup[:3])

# shows only items starting from 4 to the end
print('\ntuple: ', tup)
print('tuple showing only items starting from 4 to the end\n', tup[4:])

# shows only items starting from 2 upto 6
print('\ntuple: ', tup)
print('tuple showing only items starting from 2 upto 6\n', tup[2:6])

# reverse all items in the tuple
print('\ntuple: ', tup)
print('tuple items reversed \n', tup[::-1])

# removing whole tuple
del tup

tup_0 = ("ere", "sad")
tup_1 = ("sd", "ds")
print('\nfirst tuple: ', tup_0)
print('second tuple: ', tup_1)
tup = tup_0 + tup_1
print('Concatenation of 2 tuples  \n', tup)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

tup = ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')

# prints the length of the tuple

print('\ntuple: ', tup)

print('Length of the tuple is : ', len(tup))

# Slicing

# shows only items starting from 0 upto 3

print('\ntuple: ', tup)

print('tuple showing only items starting from 0 upto 3\n', tup[:3])

# shows only items starting from 4 to the end

print('\ntuple: ', tup)

print('tuple showing only items starting from 4 to the end\n', tup[4:])

# shows only items starting from 2 upto 6

print('\ntuple: ', tup)

print('tuple showing only items starting from 2 upto 6\n', tup[2:6])

# reverse all items in the tuple

print('\ntuple: ', tup)

print('tuple items reversed \n', tup[::-1])

# removing whole tuple

del tup

tup_0 = ("ere", "sad")

tup_1 = ("sd", "ds")

print('\nfirst tuple: ', tup_0)

print('second tuple: ', tup_1)

tup = tup_0 + tup_1

print('Concatenation of 2 tuples \n', tup)

Explanation:

A tuple is a sequence of immutable Python objects. Tuples are sequences, just like lists. The differences between tuples and lists are, the tuples cannot be changed unlike lists and tuples use parentheses, whereas lists use square brackets.

Output:

tuple:  ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')
Length of the tuple is :  12

tuple:  ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')
tuple showing only items starting from 0 upto 3
 ('abc', 'def', 'ghi')

tuple:  ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')
tuple showing only items starting from 4 to the end
 ('nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')

tuple:  ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')
tuple showing only items starting from 2 upto 6
 ('ghi', 'jklm', 'nopqr', 'st')

tuple:  ('abc', 'def', 'ghi', 'jklm', 'nopqr', 'st', 'uv', 'wxyz', '23', 's98', '123', '87')
tuple items reversed 
 ('87', '123', 's98', '23', 'wxyz', 'uv', 'st', 'nopqr', 'jklm', 'ghi', 'def', 'abc')

first tuple:  ('ere', 'sad')
second tuple:  ('sd', 'ds')
Concatenation of 2 tuples  
 ('ere', 'sad', 'sd', 'ds')

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23