Day 18 (September 23, 2013)  
Assignment to be done in class and as exercises.

Assignment 1: 
Write a object oriented program in C++ that implements the ADT 
queue. The functions that you need to support are 
(i) creation of a queue, 
(ii) checking whether the queue is full, 
(iii) adding an element onto the queue,  
(iv) checking whether the queue is empty,
(v) deleting an element from the queue

Implement the above using linked lists. 

Assignment 2: 

Write a program in C++ that uses queue to solve the round robin 
scheduling problem described next. Jobs are put on a queue for 
a processor that serves request on a first-come first-served basis. 
Each job has a completion time (say T); generate the times randomly. 
The processor allocates a fixed time (say t) to each job. If the job 
finishes within that time, the job is deleted from the queue, else 
the job is added to the queue with a completion time of T-t. Jobs 
can arrive dynamically. 

Implement the queue using dynamically allocated arrays. 
 
Assignment 3: 
Write a program in C to convert an infix expression to a postfix 
expression. 

Assignment 4: 
Write a program in C to create a binary tree; an user would at 
each step specify the new nodes to be added as left or right child 
of existing nodes. 

Assignment 5: 
Write a recursive program in C that implements (a) inorder; (b) preorder 
and (c) postorder traversals of a binary tree. 

Assignment 6: 
Write a non-recursive program in C that implements (a) inorder; (b) preorder 
and (c) postorder traversals of a binary tree. 

Assignment 7: Write a program in C that takes as input an inorder and 
preorder traversal sequences of a binary tree and reconstructs the 
binary tree from these traversal sequences. 

------------------------------------------------------------------------
At the top of each of your program files, add the following. If you are 
writing multi-file programs, then each file should have it. 

/*------------------------------------------------------------------
Name: 
Roll Number:
Date of Submission:
Deadline date:  
Program description:
Acknowledgements: 
--------------------------------------------------------------------*/