Fourth Grade Technology: 32 Lessons Every Fourth Grader Can Accomplish on a Computer Reviews

Fourth Grade Technology: 32 Lessons Every Fourth Grader Can Accomplish on a Computer





The six-volume K-5 Structured Learning Technology Curriculum is a project-based, skill-based approach to teaching computers and the current choice of more than one-hundred school districts across the country. It provides a timeline (tested on thousands of K-5 students in real classrooms) of which skills to introduce when at each level of computer learning. Part Five (Fourth Grade technology) provides 32 age-appropriate lesson plans (one-year s worth) that integrate with classroom units of inquiry in areas such as science, math, history, literature, grammar, word study, writing, and critical thinking. Included are age-appropriate technology skills (such as keyboarding), internet use, vocabulary and problem-solving skills as well as step-by-step directions for each activity, samples and reproducibles. All lessons are aligned with ISTE and NCLB National Standards. They are appropriate for the computer lab specialist in a public or private school, a homeschooler and a classroom teacher. Programs used include MS Word, Excel, PowerPoint, Publisher, Google Earth, keyboarding and a variety of the most popular internet edutainment sites. For free downloads and more details, see the publisher's website at structuredlearning.net. For a limited time, order a textbook and get its PDF FREE by sending the Amazon proof of purchase to the publisher.









List Price: $ 22.99



Price: $ 22.99



Extremal Combinatorics: With Applications in Computer Science





The book is a concise, self-contained and up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called gems of the theory. A wide spectrum of most powerful combinatorial tools is presented: methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A throughout discussion of some recent applications to computer science motivates the liveliness and inherent usefulness of these methods to approach problems outside combinatorics. No special combinatorial or algebraic background is assumed. All necessary elements of linear algebra and discrete probability are introduced before their combinatorial applications. Aimed primarily as an introductory text for graduates, it provides also a compact source of modern extremal combinatorics for researchers in computer science and other fields of discrete mathematics.









List Price: $ 99.00



Price: $ 79.20







Find More Computers Products