This textbook presents both a conceptual framework and detailed implementation guidelines for computer science (CS) teaching. Updated with the latest teaching approaches and trends, and expanded with new learning activities, the content of this new edition is clearly written and structured to be applicable to all levels of CS education and for any teaching organization. Features: provides 110 detailed learning activities; reviews curriculum and cross-curriculum topics in CS; explores the benefits of CS education research; describes strategies for cultivating problem-solving skills, for assessing learning processes, and for dealing with pupils’ misunderstandings; proposes active-learning-based classroom teaching methods, including lab-based teaching; discusses various types of questions that a CS instructor or trainer can use for a range of teaching situations; investigates thoroughly issues of lesson planning and course design; examines the first field teaching experiences gained by CS teachers.

Gain a thorough understanding of today's sometimes daunting, ever-changing world of technology as you learn how to apply the latest technology to your academic, professional and personal life with TECHNOLOGY FOR SUCCESS: COMPUTER CONCEPTS. Written by a team of best-selling technology authors and based on extensive research and feedback from students like you, this edition breaks each topic into brief, inviting lessons that address the �what, why and how� behind digital? advancements to ensure deep understanding and application to today's real world. Optional online MindTap and SAM (Skills Assessment Manager) learning tools offer hands-on and step-by-step training, videos that cover the more difficult concepts and simulations that challenge you to solve problems in the actual world. You leave this course able to read the latest technology news and understand its impact on your daily life, the economy and society.

Concepts embody our knowledge of the kinds of things there are in the world. Tying our past experiences to our present interactions with the environment, they enable us to recognize and understand new objects and events. Concepts are also relevant to understanding domains such as social situations, personality types, and even artistic styles. Yet like other phenomenologically simple cognitive processes such as walking or understanding speech, concept formation and use are maddeningly complex. Research since the 1970s and the decline of the "classical view" of concepts have greatly illuminated the psychology of concepts. But persistent theoretical disputes have sometimes obscured this progress. The Big Book of Concepts goes beyond those disputes to reveal the advances that have been made, focusing on the major empirical discoveries. By reviewing and evaluating research on diverse topics such as category learning, word meaning, conceptual development in infants and children, and the basic level of categorization, the book develops a much broader range of criteria than is usual for evaluating theories of concepts.

Coding teaches our students the essence of logical thinking and problem solving while also preparing them for a world in which computing is becoming increasingly pervasive. While there's excitement and enthusiasm about programming becoming an intrinsic part of K-12 curricula the world over, there's also growing anxiety about preparing teachers to teach effectively at all grade levels.This book strives to be an essential, enduring, practical guide for every K-12 teacher anywhere who is either teaching or planning to teach computer science and programming at any grade level. To this end, readers will discover:? An A-to-Z organization that affords comprehensive insight into teaching introductory programming.? 26 chapters that cover foundational concepts, practices and well-researched pedagogies related to teaching introductory programming as an integral part of K-12 computer science. Cumulatively these chapters address the two salient building blocks of effective teaching of introductory programming-what content to teach (concepts and practices) and how to teach (pedagogy).? Concrete ideas and rich grade-appropriate examples inspired by practice and research for classroom use.? Perspectives and experiences shared by educators and scholars who are actively practicing and/or examiningthe teaching of computer science and programming in K-12 classrooms.

An accessible and rigorous textbook for introducing undergraduates to computer science theory What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference. The book covers the standard topics in the theory of computation, including Turing machines and finite automata, universal computation, nondeterminism, Turing and Karp reductions, undecidability, time-complexity classes such as P and NP, and NP-completeness, including the Cook-Levin Theorem. But the book also provides a broader view of computer science and its historical development, with discussions of Turing's original 1936 computing machines, the connections between undecidability and Gödel's incompleteness theorem, and Karp's famous set of twenty-one NP-complete problems. Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book's examples and other content allow readers to view demonstrations of—and to experiment with—a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation. An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation Features a practical, interactive approach using real computer programs (Python in the text, with forthcoming Java alternatives online) to enhance motivation and understanding Gives equal emphasis to computability and complexity Includes special topics that demonstrate the profound nature of key ideas in the theory of computation Lecture slides and Python programs are available at whatcanbecomputed.com

Discovering Computers 2011: Complete provides students with a current and thorough introduction to computers by integrating the use of technology with the printed text. This Shelly Cashman Series text offers a dynamic and engaging solution to successfully teach students the most important computer concepts in today’s digital world through exciting new exercises that focus on problem solving and critical thinking, along with online reinforcement tools on the unparalleled Online Companion. Updated for currency, students will learn the latest trends in technology and computer concepts and how these topics are integrated into their daily lives. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.