Programming in Modula-2


Book Description

This text is an introduction to programming in general, and a manual for programming with the language Modula-2 in particular. It is oriented primarily towards people who have already acquired some basic knowledge of programming and would like to deepen their understanding in a more structured way. Nevertheless, an introductory chapter is included for the benefit of the beginner, displaying in a concise form some of the fundamental concepts of computers and their programming. The text is therefore also suitable as a self-contained tutorial. The notation used is Modula-2, which lends itself well for a structured approach and leads the student to a working style that has generally become known under the title of structured programming. As a manual for programming in Modula-2, the text covers practically all facilities of that language. Part 1 covers the basic notions of the variable, expression, assignment, conditional and repetitive statement, and array data structure. Together with Part 2 which introduces the important concept of the procedure or subroutine, it contains essentially the material commonly discussed in introductory programming courses. Part 3 concerns data types and structures and constitutes the essence of an advanced course on programming. Part 4 introduces the notion of the module, a concept that is fundamental to the design of larger programmed systems and to programming as team work. The most commonly used utility programs for input and output are presented as examples of modules. And fmally, Part 5 covers facilities for system programming, device handling, and multiprogramming.










Programming in Modula-2


Book Description

This text is an introduction to programming in general, and a manual for programmjng with the language Modula-2 in particular. It is oriented primarily towards people who have already acquired some basic knowledge of programming and would like to deepen their understanding in a more structured way. Nevertheless, an introductory chapter is included for the benefit of the beginner, displaying in a concise form some of the fundamental concepts of computers and their programming. The text is therefore also suitable as a self-contained tutorial. The notation used is Modula-2, which lends itself well for a structured approach and leads the student to a working style that has generally become known under the title of structured programming. As a manual for programming in Modula-2, the text covers practically all facilities of that language. Part 1 covers the basic notions of the variable, expression, assignment, conditional and repetitive statement, and array data structure. Together with Part 2 which introduces the important concept of the procedure or subroutine, it contains essentially the material commonly discussed in introductory programming courses. Part 3 concerns data types and structures and constitutes the essence of an advanced course on programming. Part 4 introduces the notion of the module, a concept that is fundamental to the design of larger programmed systems and to programming as team work. The most commonly used utility programs for input and output are presented as examples of modules. And finally, Part 5 covers facilities for system programming, device handling, and multiprogramming.




Data Structures Using Modula-2


Book Description

This intermediate-level treatment surveys data structures used in programming, concepts of programming in Modula-2, and algorithms useful for manipulating data structures. Emphasizes programming style and offers a wealth of examples, including complete, real-world programs. Approach to developing algorithms is very clear, making it easy to apply the principles of good programming. Chapters cover elementary Modula-2, essential language features, fundamental abstract data types, linked lists, binary trees, sorting algorithms, applications, and additional data structures. Each chapter contains a review section, practice test, and programming problems.




Modula-2


Book Description




Data Structures Using Modula-2


Book Description

Offers a modern treatment of data structures featuring the use of abstract data types and generics. Designed for freshman/sophomore courses in data structures and/or advanced programming. Introduces data structure concepts before their implementation and details the salient differences between Pascal and Modula-2. Advanced topics include virtual hashing, balanced tress, and B trees.




Data Structures Using Modula-2


Book Description

This intermediate-level treatment surveys data structures used in programming, concepts of programming in Modula-2, and algorithms useful for manipulating data structures. The programming style is emphasized and many examples are offered, including complete, real-life programs. The approach to developing algorithms is very clear, making it easy to apply the principles of good programming. The book covers elementary Modula- 2, essential language features, fundamental abstract data types, linked lists, binary trees, sorting algorithms, applications and additional data structures. Each chapter contains a review section, practice test, and programming problems.




A Guide to Modula-2


Book Description

Modula-2 is a simple yet powerful programming language that is suitable for a wide variety of applications. It is based on Pascal, a successful programming language that was introduced in 1970 by Niklaus Wirth. During the 1970's Pascal became the most widely taught programming language and it gained acceptance in science and industry. In 1980 Dr. Wirth released the Modula-2 program ming language. Modula-2 is an evolution of Pascal. It improves on the successes of Pascal while adding the MODULE - a tool for ex pressing the relations between the major parts of programs. In ad dition Modula-2 contains low-level features for systems program ming and coroutines for concurrent programming. Programming languages are important because they are used to express ideas. Some programming languages are so limited that certain ideas can't be easily expressed. For example languages that lac k floating point arithmetic are inappropriate for scientific com putations. Languages such as Basic and Fortran that lack recur sion are unsuitable for text processing or systems programming. Sometimes a programming language is useable for a certain appli cation but it is far from ideal. A good example is the difficulty of writing large programs in pure Pascal. Pascal is a poor language for large jobs because it lacks facilities for partitioning a program viii Preface 6




Modula-2


Book Description