We describe an efficient, purely functional implementation of deques with catenation. In addition to being an intriguing problem in its own right, finding a purely functional implementation of catenable deques is required to add certain sophisticated programming constructs to functional programming languages. Our solution has a worst-case running time of O(1) for each push, pop, inject, eject and catenation. The best previously known solution has an O(log k) time bound for the k deque operation. Our solution is not only faster but simpler. A key idea used in our result is an algorithmic technique related to the redundant digital representations used to avoid carry propagation in binary counting.

Abstract not found

Abstract not found

In this paper a data structure is presented to efficiently maintain the 2and 3-edge-connected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O(nlogn-[- e) time in total. The data structure allows for insertions of nodes also (in the same time bounds, taking n as the final number of nodes).

We shall focus on the following three problems in data structures 1. The Union-find problem. 2. Constructing optimal alphabetic binary trees. 3. The suffix tree. Depending upon the number of students participating we may touch other topics as well.