Objective: To understand FIFO (First-In-First-Out) queue implementations in Python including being able to
determine the big-oh of each operation.
To start the lab: Download and unzip the file at:
Part A: The textbook’s QueueText implementation in lab3/queue_text.py uses a Python list
"Abstract Queue"
items:
Queue Object
List Objects
'w' 'w'
'x' 'x'
'y' 'y'
front front
rear rear
0 1 2
a) Complete the big-oh notation for the above QueueText implementation: ("n" is the # items)
Big-oh
__str__isEmpty( ) size( )peek( )dequeue( )enqueue(item)__init__
b) Explain your big-oh answer for enqueue(item).
c) Explain your big-oh answer for dequeue( )
d) Run the timeQueue.py file which times 100,000 enqueues followed by 100,000 dequeues.
Time for 100,000 enqueues: Time for 100,000 dequeues:
e) Why do the enqueues take so much more time?
After answering the above questions, raise you hand and explain your answers.
Part B: Complete the QueueAlt implementation in lab3/queue_alt.py uses a Python list
"Abstract Queue"
items:
QueueAlt Object
List Objects
'w' 'w'
'x' 'x'
'y' 'y'
front front
rear rear
0 1 2
a) Complete the big-oh notation for the above QueueAlt implementation: ("n" is the # items)
Big-oh
__str__isEmpty( ) size( )peek( )dequeue( )enqueue(item)__init__
b) Run the timeQueueAlt.py file which times 100,000 enqueues followed by 100,000 dequeues.
Time for 100,000 enqueues: Time for 100,000 dequeues:
After completing the QueueAlt class, answering the above questions, raise you hand and demonstrate your code.
Data Structures (CS 1520) Lab 3 Name:_________________
Lab
3
-
1
Docsity.com
