000 03584nam a22004815i 4500
001 978-1-4471-5328-3
003 DE-He213
005 20200420220224.0
007 cr nn 008mamaa
008 130723s2013 xxk| s |||| 0|eng d
020 _a9781447153283
_9978-1-4471-5328-3
024 7 _a10.1007/978-1-4471-5328-3
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
082 0 4 _a005.11
_223
100 1 _aErg�ul, �Ozg�ur.
_eauthor.
245 1 0 _aGuide to Programming and Algorithms Using R
_h[electronic resource] /
_cby �Ozg�ur Erg�ul.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2013.
300 _aXI, 182 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aIntroduction -- Loops -- Recursions -- Complexity of Programs and Algorithms -- Accuracy Issues -- Sorting -- Solutions of Linear Systems of Equations -- File Processing -- Suggested Mini Projects.
520 _aWhen encountering difficult concepts in computer programming for the first time, many students struggle to find simple explanations in their textbooks. Information can also be hard to find on common mistakes made when implementing algorithms and writing programs. This concise and easy-to-follow textbook/guide provides a student-friendly introduction to programming and algorithms. Emphasis is placed on the threshold concepts that present barriers to learning, including the questions that students are often too embarrassed to ask. The book promotes an active learning style in which a deeper understanding is gained from evaluating, questioning, and discussing the material, and practised in hands-on exercises. Although R is used as the language of choice for all programs, strict assumptions are avoided in the explanations in order for these to remain applicable to other programming languages. Topics and features: Provides exercises at the end of each chapter to test the reader's understanding Includes three mini projects in the final chapter that students may enjoy while programming Presents a list of titles for further reading at the end of the book Discusses the key aspects of loops, recursions, program and algorithm efficiency and accuracy, sorting, linear systems of equations, and file processing Requires no prior background knowledge in this area This classroom-tested primer is an essential companion for any undergraduate student approaching the subject of programming and algorithms for the first time, regardless of whether their courses are part of a computer science, electrical engineering, mathematics, or physics degree. Dr. �Ozg�ur Erg�ul is an Assistant Professor in the Department of Electrical and Electronics Engineering at the Middle East Technical University, Ankara, Turkey.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aProgramming languages (Electronic computers).
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Techniques.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aAlgorithms.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781447153276
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4471-5328-3
912 _aZDB-2-SCS
942 _cEBK
999 _c52058
_d52058