Narayan Murthy

Learn More
Students become appreciative of dynamically allocated storage structures when they are led to see problems. Further , students become skillful manipulators of linked lists only by implementing them. A good discussion on linked lists is found in [2]. Linked lists are introduced at the beginning of CS2, which is before students have seen trees and become(More)
Definitions and properties of a complete binary tree and a binary search tree are well known [1]. This short paper discusses a method to construct a binary search tree which is also a complete binary tree. We call such a tree a Complete Binary Search Tree, a CBS Tree for short. Two basic advantages of a CBS tree are that it is a search tree with minimum(More)
To address national needs for computer security education, many universities have incorporated computer and security courses into their undergraduate and graduate curricula. Our department has introduced computer security courses at both the undergraduate and the graduate level. This paper describes our approach, our experiences, and lessons learned in(More)
In the last ten years, the Internet has become an important component of the global economy and security has emerged as a important part of the Information Technology professions. It is clear that universities and colleges must start preparing professionals ready to take on these challenges in the workplace. NSA is actively encouraging universities and(More)
Binary search trees are used to maintain lists that need searching. It is desirable that such a search tree have minimal height. In practice, if you construct a binary search tree with given data, there is no guarantee that it will be well-balanced. In the literature, there are many balanced trees. One such tree is discussed in [5]. Another well-balanced(More)
In his beautiful paper [2], E. W. Dijkstra discusses an algorithm to find the length of the longest upsequence of a given sequence. Given a sequence s of N elements, a subsequence of s is called an upsequence if and only if it contains no element with a right-hand neighbor smaller than itself [2]. This short paper discusses an implementation for finding an(More)
A simple sorting algorithm which can be considered as a double-ended selection sort is presented. The algorithm, called min-max sort is based on the optimal method for simultaneously finding the smallest and the largest elements in an array [2]. The smallest and the largest elements found are pushed respectively to the left and right of the array, and the(More)
  • 1