The book is intended to be a supplement for CS1 and CS2 courses that use Java as a programming language. Students can use it to practice recursion. It was written because recursion is typically one of the most challenging topics in programming courses. The examples are grouped into chapters covering recursion on integers, recursion on arrays, recursion on linked lists, recursion on linked trees and recursive examples of graphical nature. The level of examples is suitable to be given on an exam in CS1 or CS2 courses.
Irena Pevac is an Associate Professor in the Department of Computer Science at Central Connecticut State University. She holds a BA in mathematics, an MS in Automata Theory, and a PhD in Artificial Intelligence from the University of Belgrade.
Her teaching includes introductory computer science courses using Java, Visual Basic, and Delphi, along with Data Structures, Algorithms, Theoretical Computer Science, Databases, Artificial Intelligence, and Theory of Computation.
She coauthored the monographs Mathematical and Programming Problems of ArtificiaI Intelligence in the Area of Automated Theorem Proving, published by Naucna knjiga,1988 and 1991, and Practicing Recursion in Pascal, published by Simon & Schuster, 1995. She has authored numerous papers published in journals and conference proceedings, and is a member of ACM and of the IEEE society.
|
