000 03430nam a22003615i 4500
001 286480
003 MX-SnUAN
005 20160429154502.0
007 cr nn 008mamaa
008 150903s2013 xxk| o |||| 0|eng d
020 _a9781447153283
_99781447153283
024 7 _a10.1007/9781447153283
_2doi
035 _avtls000340069
039 9 _a201509030321
_bVLOAD
_c201404300409
_dVLOAD
_y201402061016
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.6-76.66
100 1 _aErgül, Özgür.
_eautor
_9315119
245 1 0 _aGuide to Programming and Algorithms Using R /
_cby Özgür Ergül.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2013.
300 _axI, 182 páginas 28 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
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. Özgür Ergül is an Assistant Professor in the Department of Electrical and Electronics Engineering at the Middle East Technical University, Ankara, Turkey.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9781447153276
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4471-5328-3
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c286480
_d286480