Elementary Synchronous Programming : : in C++ and Java via algorithms / / Ali S. Janfada.

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...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter DG OWV ebook Paket Lehrbücher Technik und Informatik 2019
VerfasserIn:
Place / Publishing House:München ;, Wien : : De Gruyter Oldenbourg, , [2019]
©2019
Year of Publication:2019
Language:English
Series:De Gruyter STEM
Online Access:
Physical Description:1 online resource (XIII, 396 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9783110616484
ctrlnum (DE-B1597)499242
(OCoLC)1104714334
collection bib_alma
record_format marc
spelling Janfada, Ali S., author. aut http://id.loc.gov/vocabulary/relators/aut
Elementary Synchronous Programming : in C++ and Java via algorithms / Ali S. Janfada.
München ; Wien : De Gruyter Oldenbourg, [2019]
©2019
1 online resource (XIII, 396 p.)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
De Gruyter STEM
Frontmatter -- Foreword -- Contents -- 1. Basic concepts of Algorithm -- 2. Fundamental concepts of programming in C++ -- 3. Fundamental concepts of programming in Java -- 4. Decision making and branching templates -- 5. Sub-algorithms and subprograms -- 6. Automated loops -- 7. Conditional loops -- 8. One-dimensional arrays -- 9. Two-dimensional arrays -- Hints for the exercises -- Bibliography -- Index
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
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.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)
C++ (Computer program language).
Computer algorithms.
Computer programming.
Java (Computer program language).
Computer Sciences.
COMPUTERS / Programming / General. bisacsh
Title is part of eBook package: De Gruyter DG OWV ebook Paket Lehrbücher Technik und Informatik 2019 9783110608908 ZDB-23-OTI
Title is part of eBook package: De Gruyter DG Plus eBook-Package 2019 9783110719567
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2019 English 9783110610765
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2019 9783110664232 ZDB-23-DGG
Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2019 English 9783110610154
Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2019 9783110606096 ZDB-23-DEI
EPUB 9783110616736
print 9783110615494
https://doi.org/10.1515/9783110616484
https://www.degruyter.com/isbn/9783110616484
Cover https://www.degruyter.com/cover/covers/9783110616484.jpg
language English
format eBook
author Janfada, Ali S.,
Janfada, Ali S.,
spellingShingle Janfada, Ali S.,
Janfada, Ali S.,
Elementary Synchronous Programming : in C++ and Java via algorithms /
De Gruyter STEM
Frontmatter --
Foreword --
Contents --
1. Basic concepts of Algorithm --
2. Fundamental concepts of programming in C++ --
3. Fundamental concepts of programming in Java --
4. Decision making and branching templates --
5. Sub-algorithms and subprograms --
6. Automated loops --
7. Conditional loops --
8. One-dimensional arrays --
9. Two-dimensional arrays --
Hints for the exercises --
Bibliography --
Index
author_facet Janfada, Ali S.,
Janfada, Ali S.,
author_variant a s j as asj
a s j as asj
author_role VerfasserIn
VerfasserIn
author_sort Janfada, Ali S.,
title Elementary Synchronous Programming : in C++ and Java via algorithms /
title_sub in C++ and Java via algorithms /
title_full Elementary Synchronous Programming : in C++ and Java via algorithms / Ali S. Janfada.
title_fullStr Elementary Synchronous Programming : in C++ and Java via algorithms / Ali S. Janfada.
title_full_unstemmed Elementary Synchronous Programming : in C++ and Java via algorithms / Ali S. Janfada.
title_auth Elementary Synchronous Programming : in C++ and Java via algorithms /
title_alt Frontmatter --
Foreword --
Contents --
1. Basic concepts of Algorithm --
2. Fundamental concepts of programming in C++ --
3. Fundamental concepts of programming in Java --
4. Decision making and branching templates --
5. Sub-algorithms and subprograms --
6. Automated loops --
7. Conditional loops --
8. One-dimensional arrays --
9. Two-dimensional arrays --
Hints for the exercises --
Bibliography --
Index
title_new Elementary Synchronous Programming :
title_sort elementary synchronous programming : in c++ and java via algorithms /
series De Gruyter STEM
series2 De Gruyter STEM
publisher De Gruyter Oldenbourg,
publishDate 2019
physical 1 online resource (XIII, 396 p.)
contents Frontmatter --
Foreword --
Contents --
1. Basic concepts of Algorithm --
2. Fundamental concepts of programming in C++ --
3. Fundamental concepts of programming in Java --
4. Decision making and branching templates --
5. Sub-algorithms and subprograms --
6. Automated loops --
7. Conditional loops --
8. One-dimensional arrays --
9. Two-dimensional arrays --
Hints for the exercises --
Bibliography --
Index
isbn 9783110616484
9783110608908
9783110719567
9783110610765
9783110664232
9783110610154
9783110606096
9783110616736
9783110615494
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA76
callnumber-sort QA 276.9 A43 J36 42019
url https://doi.org/10.1515/9783110616484
https://www.degruyter.com/isbn/9783110616484
https://www.degruyter.com/cover/covers/9783110616484.jpg
illustrated Not Illustrated
doi_str_mv 10.1515/9783110616484
oclc_num 1104714334
work_keys_str_mv AT janfadaalis elementarysynchronousprogrammingincandjavaviaalgorithms
status_str n
ids_txt_mv (DE-B1597)499242
(OCoLC)1104714334
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter DG OWV ebook Paket Lehrbücher Technik und Informatik 2019
Title is part of eBook package: De Gruyter DG Plus eBook-Package 2019
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2019 English
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2019
Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2019 English
Title is part of eBook package: De Gruyter EBOOK PACKAGE Engineering, Computer Sciences 2019
is_hierarchy_title Elementary Synchronous Programming : in C++ and Java via algorithms /
container_title Title is part of eBook package: De Gruyter DG OWV ebook Paket Lehrbücher Technik und Informatik 2019
_version_ 1806144478675730432
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04841nam a22008175i 4500</leader><controlfield tag="001">9783110616484</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20192019gw fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110616484</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110616484</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)499242</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1104714334</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A43</subfield><subfield code="b">J36 2019</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM051000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Janfada, Ali S., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elementary Synchronous Programming :</subfield><subfield code="b">in C++ and Java via algorithms /</subfield><subfield code="c">Ali S. Janfada.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München ;</subfield><subfield code="a">Wien : </subfield><subfield code="b">De Gruyter Oldenbourg, </subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (XIII, 396 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">De Gruyter STEM</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Foreword -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">1. Basic concepts of Algorithm -- </subfield><subfield code="t">2. Fundamental concepts of programming in C++ -- </subfield><subfield code="t">3. Fundamental concepts of programming in Java -- </subfield><subfield code="t">4. Decision making and branching templates -- </subfield><subfield code="t">5. Sub-algorithms and subprograms -- </subfield><subfield code="t">6. Automated loops -- </subfield><subfield code="t">7. Conditional loops -- </subfield><subfield code="t">8. One-dimensional arrays -- </subfield><subfield code="t">9. Two-dimensional arrays -- </subfield><subfield code="t">Hints for the exercises -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">C++ (Computer program language).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer programming.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Java (Computer program language).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Sciences.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DG OWV ebook Paket Lehrbücher Technik und Informatik 2019</subfield><subfield code="z">9783110608908</subfield><subfield code="o">ZDB-23-OTI</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">DG Plus eBook-Package 2019</subfield><subfield code="z">9783110719567</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2019 English</subfield><subfield code="z">9783110610765</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2019</subfield><subfield code="z">9783110664232</subfield><subfield code="o">ZDB-23-DGG</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Engineering, Computer Sciences 2019 English</subfield><subfield code="z">9783110610154</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Engineering, Computer Sciences 2019</subfield><subfield code="z">9783110606096</subfield><subfield code="o">ZDB-23-DEI</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">EPUB</subfield><subfield code="z">9783110616736</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9783110615494</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110616484</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9783110616484</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9783110616484.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-061015-4 EBOOK PACKAGE Engineering, Computer Sciences 2019 English</subfield><subfield code="b">2019</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-061076-5 EBOOK PACKAGE COMPLETE 2019 English</subfield><subfield code="b">2019</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-071956-7 DG Plus eBook-Package 2019</subfield><subfield code="b">2019</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DEI</subfield><subfield code="b">2019</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield><subfield code="b">2019</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-OTI</subfield><subfield code="b">2019</subfield></datafield></record></collection>