Prior to attending Arkansas State University, I was involved full time in computer programming and consulting activities. I began as a self-taught programmer in Basic and continued developing my skills into the object-oriented programming of Visual Basic. Since 1983 I have developed and written software that is commercially viable and innovative. This experience has given me a firm foundation for my academic studies and enabled me to have greater insight into my University studies.
My study emphasis in my major, computer information systems, is in programming. Because I believe that a solid foundation in business is necessary, in order to apply the information system discipline to the needs of the company, I put forth my best efforts to learn and understand the material presented by the professors in the business core courses.
A well-grounded understanding of data structures and computer algorithms is essential in applied information technology programming. For this reason I chose to take the extra hours to complete a minor in computer science.
In order to take full advantage of the learning experience, I accepted the invitation to join the ASU Honors program. I found that the honors classes were smaller and comprised of high achievers. This situation provided greater challenges and better learning experiences because of the active discussions moderated by the University's best professors. I chose to take two upper level honors classes in which I completed proprietary projects of my own design. In Honors Advanced COBOL the project was a "COBOL Reference Manual" which I still use today. The challenge in Honors Data Structures was to write a program in C++ that demonstrated the AVL Tree, a depth-balanced binary tree. The AVL tree, after Adel´son-Vel´skif and Landis, is described by Mark A. Teribile in his textbook as ". . . a troublesome data structure, and the classical presentation [of it] makes it genuinely recondite." It turned out to be one of the most challenging and enjoyable projects during my undergraduate studies.
![]()