Scribd
Upload
276 views10 pages

Abstract Data Types in Python

The document discusses using object-oriented programming in Python to represent abstract data types (ADTs). It provides examples of implementing common ADTs like stacks, queues, and rational numbers as classes in Python. The stack and queue classes define methods for common operations on those data structures like push, pop, size, etc. Similarly, the rational number class defines methods for arithmetic operations and comparisons. Representing ADTs as classes provides abstraction that separates the interface from the implementation.

Uploaded by

Max
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
276 views10 pages

Abstract Data Types in Python

The document discusses using object-oriented programming in Python to represent abstract data types (ADTs). It provides examples of implementing common ADTs like stacks, queues, and rational numbers as classes in Python. The stack and queue classes define methods for common operations on those data structures like push, pop, size, etc. Similarly, the rational number class defines methods for arithmetic operations and comparisons. Representing ADTs as classes provides abstraction that separates the interface from the implementation.

Uploaded by

Max
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Abstract

 Data  Type  using    


Object-­‐Oriented  
Programming  in  Python  
Abstrac:on  
Abstrac:on  is  one  of  the  most  powerful  ideas  in  
computer  science.  It  separates  the  what  from  the  how.  
 
Abstrac:on  provides  modularity.  
 
Classes  are  the  Python  representa:on  for  “Abstract  Data  
Types,”  (ADT)  a  very  useful  no:on  in  any  programming  
language.  
 
An  ADT  involves  both  data  and  opera:ons  on  that  data.  
Example:  Stack  
A  stack  is  a  LIFO  (last  in,  first  out)  list  with  the  
following  opera:ons:  Push,  Pop,  Create  (Init),  
Top,  IsEmpty,  Size.  (Such  a  list  is  called  a  
Signature  or  the  Interface  to  the  ADT.)  
 
Stack  ADT  
 
 Stack()  
  creates  a  new  stack  that  is  empty.  It  needs  no  parameters  
and  returns  an  empty  stack.  
push(item)  adds  a  new  item  to  the  top  of  the  stack.  It  needs  the  
item  and  returns  nothing.  
pop()  removes  the  top  item  from  the  stack.  It  needs  no  
parameters  and  returns  the  item.  The  stack  is  modified.  
top()  returns  the  top  item  from  the  stack  but  does  not  remove  it.  
It  needs  no  parameters.  The  stack  is  not  modified.  
isEmpty()  tests  to  see  whether  the  stack  is  empty.  It  needs  no  
parameters  and  returns  a  boolean  value.  
size()  returns  the  number  of  items  on  the  stack.  It  needs  no  
parameters  and  returns  an  integer.  
Stack  ADT  as  a  Class  
class Stack:!
def __init__(self):!
[Link] = []!
def IsEmpty(self):!
return [Link] == []!
def push(self,item):!
[Link](item)!
def pop(self):!
return [Link]()!
def top(self):!
return [Link][len([Link])-1]!
def size(self):!
return len([Link])!
Example:Queue  
A  Queue  is  a  FIFO  (first  in,  first  out)  list  with  the  
following  opera:ons:  Enqueue,  Dequeue,  Size,  
Font.  
 
 
Queue  ADT  
 
 Queue()  
  creates  a  new  queue  that  is  empty.  It  needs  no  
parameters  and  returns  an  empty  queue.  
Enqueue(item)  adds  a  new  item  to  the  rear  of  the  queue.  It  
needs  the  item  and  returns  nothing.  
Dequeue()  removes  the  item  from  the  front  of  the  queue.  It  
needs  no  parameters  and  returns  the  item.  The  queue  is  
modified.  
Front()  returns  the  front  item  from  the  queue  but  does  not  
remove  it.  It  needs  no  parameters.  The  queue  is  not  modified.  
isEmpty()  tests  to  see  whether  the  queue  is  empty.  It  needs  no  
parameters  and  returns  a  boolean  value.  
size()  returns  the  number  of  items  on  the  queue.  It  needs  no  
parameters  and  returns  an  integer.  
Queue  ADT  as  a  Class  
Class Queue:!
def __init__(self):!
[Link] = []!
def IsEmpty(self):!
return [Link] == []!
def enqueue(self,item):!
[Link](item)!
def dequeue(self):!
return [Link](0)!
def front(self):!
return [Link][len([Link])-1]!
def size(self):!
return len([Link])!
Ra:onal  ADT  as  a  Class  
class Rational:!
def __init__(self,n,d):!
if d==0:!
print 'The denominator is ZERO, can not proceed'!
else:!
g=gcd(n,d)!
[Link]=n/g!
[Link]=d/g!
def show(self):!
print [Link],'/',[Link]!
def add(self,a):!
n=[Link]*[Link] + [Link]*[Link]!
d=[Link]*[Link]!
return Rational(n,d)!
Ra:onal  ADT  as  a  Class  
def sub(self,a):!
n=[Link]*[Link] - [Link]*[Link]!
d=[Link]*[Link]!
return Rational(n,d)!
def mult(self,a):!
n=[Link]*[Link]!
d=[Link]*[Link]!
return Rational(n,d)!
def divide(self,a):!
n=[Link]*[Link]!
d=[Link]*[Link]!
return Rational(n,d)!
def equal(self,a):!
a1=[Link]*[Link]!
a2=[Link]*[Link]!
return (a1==a2)!

You might also like