Nitin Arora

Modified Non-Recursive Algorithm for Reconstructing a Binary Tree

tree traversal refers to the process of visiting each node in a specified order. Given the inorder traversal of a binary tree, along with one of its preorder or postorder traversals, the original binary tree can be uniquely identified. Many recursive and non recursive method of construction of the tree from inorder and any of the postorder or preorder traversal have been proposed. In this paper one of the proposed algorithms has been examined. This algorithm computes the wrong tree for some input sequences. We show a particular situation in which the algorithm fails and a solution for this situation is proposed. The proposed a modified non-recursive algorithm for reconstructing a binary tree which generates the correct tree otherwise an error has been reported.

A New Technique for Finding Min-cut Tree

In this paper we propose a new approximation algorithm for calculating the min-cut tree of an undirected edge-weighted graph. Our algorithm runs in O(V 2 .logV + V 2 .d), where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not produce correct result for all sorts of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviation from actual result is very less (usually for less than 5% pairs) and for most of the pairs we obtain correct values of max-flow or min-cut.

Two way Linear Search Algorithm

Linear search is the basic search algorithm used in data structures. If is also called as sequential search. Linear search is used to find a particular element in an array. It is not compulsory to arrange an array in any order (Ascending or Descending) as in the case of binary search. Linear search starts by sequentially scanning the elements in the array and if the element has been found, if will display the particular element and the index value of that element in that array. In this paper we present a novel searching algorithm Two Way Linear Search, which modified version of linear search algorithm and is based on comparing the elements from both ends.We have also compared the Two Way Linear search algorithm with Linear Search Algorithm. We used MATLAB 8.0 for implementation and Analysis of CPU time taken by both the algorithms. We have checked the algorithms with input sequences of lengths10000, 50000, 100000, and 5000000.Result shows that Two Way Searching Algorithm is working well for all input values and it takes lesser time if the element to be search is after the middle of the array, otherwise it takes same time as in case of linear search.

Browsing Pattern Analysis: What user browsing Patterns Indicate

With the advent of the Internet of Things (IoT) the number of users and the number of websites in the World Wide Web increase exponentially by the day. Consequently, the users have issues searching required content in the plethora of available websites. Optimisation, speed, and convenience of browsing through data have never been more important. This is where the role of user preference mapping through the process of browsing pattern analysis comes in. The process of user browsing pattern analysis using the experimental setup of a self-constructed tool LAZY has been done to show a sample of browsing pattern analysis and the effects it might have on todays applications. Why is it needed? The tool analyses the browser data of the user and places the user into certain demographic which is greatly beneficial to the user who now receives suggestions for relevant content. It is also beneficial to the content developers who can now receive data about user preferences which could further boost the navigability of the website and thereby the profitability of the website.

A Novel String Matching Algorithm and Comparison with KMP Algorithm

In today’s world, we need fast algorithm with minimum errors for solving the problems. Pattern matching method is a real time problem. There exist different types of data in web application problems, for example, text files, image files, audio files and video files searching. For searching different types of data search engine is required and every search algorithm are used by every search engine for handling different types of data. This paper provides a modified version of KMP algorithm for text matching. This algorithm is implemented in C language and has been checked with arbitrary input arrangement of length 10,100,1000,5000,10000. The results reflect that the performance of modified KMP algorithms is better than that of KMP algorithm.

Novel Approximation Algorithm for Calculating Maximum Flow in a Graph

In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in