Many students and programmers familiar with Pascal are now looking to upgrade their skills to a well-structured object-oriented programming language such as C++. This textbook provides such an "upgrade path" by presenting a course on C++ in the spirit of structured programming. Both authors teach this material to a wide variety of students and include numerous programming exercises to test a reader's understanding and to increase their confidence in programming in C++.

The author's aim in this textbook is to provide students with a clear understanding of the relationship between the principles of object-oriented programming and software engineering. Professor Zeigler takes an approach based on state representation to formal specification. Consequently, this book is unique through its - emphasis on formulating primitives from which all other functionality can be built; - integral use of a semi-formal behaviour specification language based on state transition concepts; -differentiation between behaviour and implementation; -a reusable heterogeneous container class library; -ability to show the elegance and power of ensemble methods with non-trivial examples. As a result, students studying software engineering will find this a distinctive and valuable approach to programming and systems engineering.

This textbook provides an in depth course on data structures in the context of object oriented development. Its main themes are abstraction, implementation, encapsulation, and measurement: that is, that the software process begins with abstraction of data types, which then lead to alternate representations and encapsulation, and finally to resource measurement. A clear object oriented approach, making use of Booch components, will provide readers with a useful library of data structure components and experience in software reuse. Students using this book are expected to have a reasonable understanding of the basic logical structures such as stacks and queues. Throughout, Ada 95 is used and the author takes full advantage of Ada's encapsulation features and the ability to present specifications without implementational details. Ada code is supported by two suites available over the World Wide Web.

The aim of this textbook is to present the central and basic concepts, techniques, and tools of computer science. The emphasis is on presenting a problem-solving approach and on providing a survey of all of the most important topics covered in computer science degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach which concentrates on the creation of simple functions that are composed to obtain the desired programming goal. Such simple functions are easily tested individually. This greatly helps in producing programs that work right first time. Throughout, the author presents techniques to aid in the writing of programs and makes liberal use of boxes which present "Mistakes to Avoid." Many programming examples are discussed in detail which illustrate general approaches to programming. These include: * abstracting a problem; * creating pseudo code as an intermediate solution; * top-down and bottom-up design; * building procedural and data abstractions; * writing progams in modules which are easily testable. Numerous exercises help the readers test their understanding of the material and develop some ideas in greater depth. As a result this text will make an ideal first course for all students coming to computer science for the first time.

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

1 The Purpose of This Text This text has been written in response to two trends that have gained considerable momentum over the past few years. The first is the decision by many undergraduate engineering and science departments to abandon the traditional programming course based on the aging Fortran 77 standard. This decision is not surprising, considering the more modem features found in languages such as Pascal and C. However, Pascal never developed a strong following in scientific computing, and its use is in decline. The new Fortran 90 standard defines a powerful, modem language, but this long-overdue redesign of Fortran has come too late to prevent many colleges and universities from switching to C. The acceptance of C by scientists and engineers is based perhaps as. much on their perceptions of C as an important language, which it certainly is, and on C programming experience as a highly marketable skill, as it is on the suitability of C for scientific computation. For whatever reason, C or its derivative C++ is now widely taught as the first and often only programming language for undergraduates in science and engineering. The second trend is the evolving nature of the undergraduate engineering curriculum. At a growing number of institutions, the traditional approach of stressing theory and mathematics fundamentals in the early undergraduate years, and postponing real engineering applications until later in the curriculum, has been turned upside down.

1 The Purpose of This Text This text has been written in response to two trends that have gained considerable momentum over the past few years. The first is the decision by many undergraduate engineering and science departments to abandon the traditional programming course based on the aging Fortran 77 standard. This decision is not surprising, considering the more modem features found in languages such as Pascal and C. However, Pascal never developed a strong following in scientific computing, and its use is in decline. The new Fortran 90 standard defines a powerful, modem language, but this long-overdue redesign of Fortran has come too late to prevent many colleges and universities from switching to C. The acceptance of C by scientists and engineers is based perhaps as. much on their perceptions of C as an important language, which it certainly is, and on C programming experience as a highly marketable skill, as it is on the suitability of C for scientific computation. For whatever reason, C or its derivative C++ is now widely taught as the first and often only programming language for undergraduates in science and engineering. The second trend is the evolving nature of the undergraduate engineering curriculum. At a growing number of institutions, the traditional approach of stressing theory and mathematics fundamentals in the early undergraduate years, and postponing real engineering applications until later in the curriculum, has been turned upside down.

Once programmers have grasped the basics of object-oriented programming and C++, the most important tool that they have at their disposal is the Standard Template Library (STL). This provides them with a library of re-usable objects and standard data structures. It has recently been accepted by the C++ Standards Committee. This textbook is an introduction to data structures and the STL. It provides a carefully integrated discussion of general data structures and their implementation and use in the STL. In so doing, the author is able to teach readers the important features of abstraction and how to develop applications using the STL.

By now, Scheme is a well-established programming language and is finding increasing popularity in programming courses for undergraduates. Its expressive capabilities are matched by a simplicity of language and ease-of-use which have made its adherents disciples! This textbook provides a comprehensive first course in Scheme and covers all of its major features: abstraction, functional programming, data types, recursion, and semantic programming. Although the primary goal of this text is to teach students to program in Scheme, it will be suitable for any student studying a general programming principles course. Each chapter is divided into three sections: core, appendix , and problems. Most essential topics are covered in the core section, but it is assumed that most students will read the appendices and solve most of the problems. (Nearly all of the problems require students to write short Scheme procedures.) As well as providing a thorough grounding in Scheme, the author discusses in depth different programming paradigms. An important theme throughout is that of "meta-programming": the perspective that programs themselves can be treated as data, and hence can be analyzed and modified as objects. This provides insight into topics such as type-checking and overloading which might otherwise be missed.

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

This textbook provides an in depth course on data structures in the context of object oriented development. Its main themes are abstraction, implementation, encapsulation, and measurement: that is, that the software process begins with abstraction of data types, which then lead to alternate representations and encapsulation, and finally to resource measurement. A clear object oriented approach, making use of Booch components, will provide readers with a useful library of data structure components and experience in software reuse. Students using this book are expected to have a reasonable understanding of the basic logical structures such as stacks and queues. Throughout, Ada 95 is used and the author takes full advantage of Ada's encapsulation features and the ability to present specifications without implementational details. Ada code is supported by two suites available over the World Wide Web.

Many students and programmers familiar with Pascal are now looking to upgrade their skills to a well-structured object-oriented programming language such as C++. This textbook provides such an "upgrade path" by presenting a course on C++ in the spirit of structured programming. Both authors teach this material to a wide variety of students and include numerous programming exercises to test a reader's understanding and to increase their confidence in programming in C++.

The author's aim in this textbook is to provide students with a clear understanding of the relationship between the principles of object-oriented programming and software engineering. Professor Zeigler takes an approach based on state representation to formal specification. Consequently, this book is unique through its - emphasis on formulating primitives from which all other functionality can be built; - integral use of a semi-formal behaviour specification language based on state transition concepts; -differentiation between behaviour and implementation; -a reusable heterogeneous container class library; -ability to show the elegance and power of ensemble methods with non-trivial examples. As a result, students studying software engineering will find this a distinctive and valuable approach to programming and systems engineering.

Many students and programmers familiar with Pascal are now looking to upgrade their skills to a well-structured object-oriented programming language such as C++. This textbook provides such an "upgrade path" by presenting a course on C++ in the spirit of structured programming. Both authors teach this material to a wide variety of students and include numerous programming exercises to test a reader's understanding and to increase their confidence in programming in C++.

The author's aim in this textbook is to provide students with a clear understanding of the relationship between the principles of object-oriented programming and software engineering. Professor Zeigler takes an approach based on state representation to formal specification. Consequently, this book is unique through its - emphasis on formulating primitives from which all other functionality can be built; - integral use of a semi-formal behaviour specification language based on state transition concepts; -differentiation between behaviour and implementation; -a reusable heterogeneous container class library; -ability to show the elegance and power of ensemble methods with non-trivial examples. As a result, students studying software engineering will find this a distinctive and valuable approach to programming and systems engineering.

This textbook provides an in depth course on data structures in the context of object oriented development. Its main themes are abstraction, implementation, encapsulation, and measurement: that is, that the software process begins with abstraction of data types, which then lead to alternate representations and encapsulation, and finally to resource measurement. A clear object oriented approach, making use of Booch components, will provide readers with a useful library of data structure components and experience in software reuse. Students using this book are expected to have a reasonable understanding of the basic logical structures such as stacks and queues. Throughout, Ada 95 is used and the author takes full advantage of Ada's encapsulation features and the ability to present specifications without implementational details. Ada code is supported by two suites available over the World Wide Web.

The aim of this textbook is to present the central and basic concepts, techniques, and tools of computer science. The emphasis is on presenting a problem-solving approach and on providing a survey of all of the most important topics covered in computer science degree programmes. Scheme is used throughout as the programming language and the author stresses a functional programming approach which concentrates on the creation of simple functions that are composed to obtain the desired programming goal. Such simple functions are easily tested individually. This greatly helps in producing programs that work right first time. Throughout, the author presents techniques to aid in the writing of programs and makes liberal use of boxes which present "Mistakes to Avoid." Many programming examples are discussed in detail which illustrate general approaches to programming. These include: * abstracting a problem; * creating pseudo code as an intermediate solution; * top-down and bottom-up design; * building procedural and data abstractions; * writing progams in modules which are easily testable. Numerous exercises help the readers test their understanding of the material and develop some ideas in greater depth. As a result this text will make an ideal first course for all students coming to computer science for the first time.

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

1 The Purpose of This Text This text has been written in response to two trends that have gained considerable momentum over the past few years. The first is the decision by many undergraduate engineering and science departments to abandon the traditional programming course based on the aging Fortran 77 standard. This decision is not surprising, considering the more modem features found in languages such as Pascal and C. However, Pascal never developed a strong following in scientific computing, and its use is in decline. The new Fortran 90 standard defines a powerful, modem language, but this long-overdue redesign of Fortran has come too late to prevent many colleges and universities from switching to C. The acceptance of C by scientists and engineers is based perhaps as. much on their perceptions of C as an important language, which it certainly is, and on C programming experience as a highly marketable skill, as it is on the suitability of C for scientific computation. For whatever reason, C or its derivative C++ is now widely taught as the first and often only programming language for undergraduates in science and engineering. The second trend is the evolving nature of the undergraduate engineering curriculum. At a growing number of institutions, the traditional approach of stressing theory and mathematics fundamentals in the early undergraduate years, and postponing real engineering applications until later in the curriculum, has been turned upside down.

1 The Purpose of This Text This text has been written in response to two trends that have gained considerable momentum over the past few years. The first is the decision by many undergraduate engineering and science departments to abandon the traditional programming course based on the aging Fortran 77 standard. This decision is not surprising, considering the more modem features found in languages such as Pascal and C. However, Pascal never developed a strong following in scientific computing, and its use is in decline. The new Fortran 90 standard defines a powerful, modem language, but this long-overdue redesign of Fortran has come too late to prevent many colleges and universities from switching to C. The acceptance of C by scientists and engineers is based perhaps as. much on their perceptions of C as an important language, which it certainly is, and on C programming experience as a highly marketable skill, as it is on the suitability of C for scientific computation. For whatever reason, C or its derivative C++ is now widely taught as the first and often only programming language for undergraduates in science and engineering. The second trend is the evolving nature of the undergraduate engineering curriculum. At a growing number of institutions, the traditional approach of stressing theory and mathematics fundamentals in the early undergraduate years, and postponing real engineering applications until later in the curriculum, has been turned upside down.

Once programmers have grasped the basics of object-oriented programming and C++, the most important tool that they have at their disposal is the Standard Template Library (STL). This provides them with a library of re-usable objects and standard data structures. It has recently been accepted by the C++ Standards Committee. This textbook is an introduction to data structures and the STL. It provides a carefully integrated discussion of general data structures and their implementation and use in the STL. In so doing, the author is able to teach readers the important features of abstraction and how to develop applications using the STL.

By now, Scheme is a well-established programming language and is finding increasing popularity in programming courses for undergraduates. Its expressive capabilities are matched by a simplicity of language and ease-of-use which have made its adherents disciples! This textbook provides a comprehensive first course in Scheme and covers all of its major features: abstraction, functional programming, data types, recursion, and semantic programming. Although the primary goal of this text is to teach students to program in Scheme, it will be suitable for any student studying a general programming principles course. Each chapter is divided into three sections: core, appendix , and problems. Most essential topics are covered in the core section, but it is assumed that most students will read the appendices and solve most of the problems. (Nearly all of the problems require students to write short Scheme procedures.) As well as providing a thorough grounding in Scheme, the author discusses in depth different programming paradigms. An important theme throughout is that of "meta-programming": the perspective that programs themselves can be treated as data, and hence can be analyzed and modified as objects. This provides insight into topics such as type-checking and overloading which might otherwise be missed.

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

This textbook provides an in depth course on data structures in the context of object oriented development. Its main themes are abstraction, implementation, encapsulation, and measurement: that is, that the software process begins with abstraction of data types, which then lead to alternate representations and encapsulation, and finally to resource measurement. A clear object oriented approach, making use of Booch components, will provide readers with a useful library of data structure components and experience in software reuse. Students using this book are expected to have a reasonable understanding of the basic logical structures such as stacks and queues. Throughout, Ada 95 is used and the author takes full advantage of Ada's encapsulation features and the ability to present specifications without implementational details. Ada code is supported by two suites available over the World Wide Web.

Many students and programmers familiar with Pascal are now looking to upgrade their skills to a well-structured object-oriented programming language such as C++. This textbook provides such an "upgrade path" by presenting a course on C++ in the spirit of structured programming. Both authors teach this material to a wide variety of students and include numerous programming exercises to test a reader's understanding and to increase their confidence in programming in C++.

The author's aim in this textbook is to provide students with a clear understanding of the relationship between the principles of object-oriented programming and software engineering. Professor Zeigler takes an approach based on state representation to formal specification. Consequently, this book is unique through its - emphasis on formulating primitives from which all other functionality can be built; - integral use of a semi-formal behaviour specification language based on state transition concepts; -differentiation between behaviour and implementation; -a reusable heterogeneous container class library; -ability to show the elegance and power of ensemble methods with non-trivial examples. As a result, students studying software engineering will find this a distinctive and valuable approach to programming and systems engineering.