Instructor's Manual t/a Structure and Interpretation of Computer Programs, second edition
Instructor's Manual t/a Structure and Interpretation of Computer Programs, second edition

Author: Julie Sussman

Publisher: MIT Press

Published: 1998-09-15

Total Pages: 0

ISBN-13: 0262692201

DOWNLOAD EBOOK

This instructor's manual and reader's guide accompanies the secondedition of Structure and Interpretation of Computer Programs,by Harold Abelson and Gerald Jay Sussman with Julie Sussman. This instructor's manual and reader's guide accompanies the second edition of Structure and Interpretation of Computer Programs, by Harold Abelson and Gerald Jay Sussman with Julie Sussman. It contains discussions of exercises and other material in the text as well as supplementary material, additional examples and exercises, and teaching suggestions. An appendix summarizes the Scheme programming language as used in the text, showing at what point in the text each element of Scheme is introduced.

Guide to Teaching Computer Science
Guide to Teaching Computer Science

Author: Orit Hazzan

Publisher: Springer

Published: 2015-01-07

Total Pages: 306

ISBN-13: 1447166302

DOWNLOAD EBOOK

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.

Introduction to Algorithms, third edition
Introduction to Algorithms, third edition

Author: Thomas H. Cormen

Publisher: MIT Press

Published: 2009-07-31

Total Pages: 1313

ISBN-13: 0262258102

DOWNLOAD EBOOK

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.