Elementary Synchronous Programming: in C++ and Java via algorithms / Edition 1

Elementary Synchronous Programming: in C++ and Java via algorithms / Edition 1

by Ali S. Janfada
ISBN-10:
3110615495
ISBN-13:
9783110615494
Pub. Date:
06/04/2019
Publisher:
De Gruyter
ISBN-10:
3110615495
ISBN-13:
9783110615494
Pub. Date:
06/04/2019
Publisher:
De Gruyter
Elementary Synchronous Programming: in C++ and Java via algorithms / Edition 1

Elementary Synchronous Programming: in C++ and Java via algorithms / Edition 1

by Ali S. Janfada

Paperback

$59.99
Current price is , Original price is $59.99. You
$59.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

Algorithms are the essence of programming. After their construction, they have to be translated to the codes of a specific programming language. There exists a maximum of ten basic algorithmic templates. This textbook aims to provide the reader with a more convenient and efficient method to create a program by translating algorithms, template by template with C++ and Java. This is the slogan of the book: You will be a professional programmer whenever you become a skilled algorithm designer.

This book attempts to gradually strengthen the readers’ ability to identify and analyze the mental commands which are issued and implemented in their brains for solving the problems in which mathematical computations are applied and try to design an algorithm based on their understanding and analyses. It then seeks to encourage the readers to develop their skills in algorithm-writing for computational problems and synchronously teach them to translate the algorithms into C++ and Java codes using the least necessary keywords.


Product Details

ISBN-13: 9783110615494
Publisher: De Gruyter
Publication date: 06/04/2019
Series: De Gruyter STEM
Pages: 409
Product dimensions: 6.69(w) x 9.45(h) x (d)
Age Range: 18 Years

About the Author

Dr. Ali S. Janfada, Urmia University, Iran

Table of Contents

Foreword VII

1 Basic concepts of Algorithm 1

1.1 Algorithm 1

1.2 Flowchart 7

2 Fundamental concepts of programming in C++ 17

2.1 Primary concepts 18

2.1.1 Reserved words 18

2.1.2 Identifiers 18

2.1.3 Datatypes 19

2.1.4 Variables 21

2.1.5 Constants 23

2.1.6 Operators 23

2.1.7 Library (predefined) functions 28

2.1.8 Arithmetic and logical expressions 29

2.2 Introduction to programming in C++ language 31

2.2.1 Output statement 33

2.2.2 Input statement 37

2.2.3 Formatted output 41

2.3 Pointers 43

3 Fundamental concepts of programming in Java 47

3.1 Primary concepts 48

3.1.1 Datatypes 49

3.1.2 Literals and variables 50

3.1.3 Operators 51

3.2 Introduction to programming in Java 53

3.2.1 Output and input statements 55

3.2.2 Formatted output 61

3.3 Object-oriented programming (OOP) system 64

3.3.1 Objects and class 64

3.3.2 Types of variables 70

3.3.3 Constructors and destructors 71

3.3.4 Destructors and namespaces (C++ only) 74

3.3.5 Static elements 77

3.3.6 The this keyword 82

4 Decision making and branching templates 84

4.1 The if-else template 86

4.2 The if template 89

4.3 The if-else-if template 95

4.4 The switch statement 107

4.5 More applications of the if template 112

4.5.1 Transferring the program execution 112

4.5.2 Terminating the program execution 114

Exercises 118

5 Sub-algorithms and subprograms 121

5.1 Sub-algorithms 121

5.2 Subprograms 124

5.2.1 Functions 126

5.2.2 Multi-return sub-algorithm (subprograms) 136

5.3 Self-calling (recursive) functions 141

Exercises 150

6 Automated loops 155

6.1 The for template 155

6.2 Series 182

Exercises 190

Supplementary exercises 194

7 Conditional loops 197

7.1 The while and do-while templates 197

7.2 More applications of the conditional loops 216

7.3 The if-goto loops (C++ only) 239

Exercises 241

Supplementary exercises 244

8 One-dimensional arrays 246

8.1 Vectors 246

8.2 More applications of the arrays 275

Exercises 297

Supplementary exercises 300

9 Two-dimensional arrays 304

9.1 Matrices 304

9.2 Solving linear equations system 341

9.2.1 Direct ways 342

9.2.2 Iterative methods 346

Exercises 361

Supplementary exercises 363

Hints for the exercises 365

Bibliography 389

Index 393

From the B&N Reads Blog

Customer Reviews