0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (1)
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 3 of 3 matches in All Departments

CS For All - An Introduction to Computer Science Using Python (Paperback): Christine Alvarado, Zachary Dodds, Geoff Kuenning,... CS For All - An Introduction to Computer Science Using Python (Paperback)
Christine Alvarado, Zachary Dodds, Geoff Kuenning, Ran Libeskind-Hadas
R1,467 Discovery Miles 14 670 Ships in 12 - 17 working days

A unique approach to "Intro CS." In a nutshell, the authors of this book's objective is to provide an introduction to computer science as an intellectually rich and vibrant field rather than focusing exclusively on computer programming. While programming is certainly an important and pervasive element of their approach, they emphasize concepts and problem-solving over syntax and programming language features. This book is a companion to the course "CS for All" developed at Harvey Mudd College and subsequently adopted at a variety of colleges and universities. At Mudd, this course is taken by almost every first-year student - irrespective of the student's ultimate major - as part of the college's core curriculum. The offering is also taken by many students at the Claremont Colleges, including students majoring in the humanities, social sciences, and the arts. Thus, it serves as a first computing course for students regardless of their major. This book is intended to be used with the substantial resources that we have developed for the course. These resources include complete lecture slides, a rich collection of weekly assignments, some accompanying software, documentation, and papers that have been published about the course. The authors have deliberately kept this book relatively short and have endeavored to make it fun and readable. The content of this book is an accurate reflection of the content of the course rather than an intimidating encyclopedic tome that can't possibly be covered in a single semester. The book has been written in the belief that a student can read all of it comfortably as the course proceeds.

Fault Covering Problems in Reconfigurable VLSI Systems (Paperback, Softcover reprint of the original 1st ed. 1992): Ran... Fault Covering Problems in Reconfigurable VLSI Systems (Paperback, Softcover reprint of the original 1st ed. 1992)
Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason Cong, Philip McKinley, C.L. Liu
R2,911 Discovery Miles 29 110 Ships in 10 - 15 working days

Fault Covering Problems in Reconfigurable VLSI Systems describes the authors' recent research on reconfiguration problems for fault-tolerance in VLSI and WSI Systems. The book examines solutions to a number of reconfiguration problems. Efficient algorithms are given for tractable covering problems and general techniques are given for dealing with a large number of intractable covering problems. The book begins with an investigation of algorithms for the reconfiguration of large redundant memories. Next, a number of more general covering problems are considered and the complexity of these problems is analyzed. Finally, a general and uniform approach is proposed for solving a wide class of covering problems. The results and techniques described here will be useful to researchers and students working in this area. As such, the book serves as an excellent reference and may be used as the text for an advanced course on the topic.

Fault Covering Problems in Reconfigurable VLSI Systems (Hardcover, 1992 ed.): Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason... Fault Covering Problems in Reconfigurable VLSI Systems (Hardcover, 1992 ed.)
Ran Libeskind-Hadas, Nany Hasan, Jingsheng Jason Cong, Philip McKinley, C.L. Liu
R3,043 Discovery Miles 30 430 Ships in 10 - 15 working days

Fault Covering Problems in Reconfigurable VLSI Systems describes the authors' recent research on reconfiguration problems for fault-tolerance in VLSI and WSI Systems. The book examines solutions to a number of reconfiguration problems. Efficient algorithms are given for tractable covering problems and general techniques are given for dealing with a large number of intractable covering problems. The book begins with an investigation of algorithms for the reconfiguration of large redundant memories. Next, a number of more general covering problems are considered and the complexity of these problems is analyzed. Finally, a general and uniform approach is proposed for solving a wide class of covering problems. The results and techniques described here will be useful to researchers and students working in this area. As such, the book serves as an excellent reference and may be used as the text for an advanced course on the topic.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Unicorn Core 75 Flights (Gripper)
R25 R16 Discovery Miles 160
Jurassic Park Trilogy Collection
Sam Neill, Laura Dern, … Blu-ray disc  (1)
R311 Discovery Miles 3 110
Gloria
Sam Smith CD R238 R185 Discovery Miles 1 850
ZA Cute Butterfly Earrings and Necklace…
R712 R499 Discovery Miles 4 990
Cable Guys Controller and Smartphone…
R399 R359 Discovery Miles 3 590
Bostik Easy Tear Tape (12mm x 33m)
R14 Discovery Miles 140
Marvel Spiderman Fibre-Tip Markers (Pack…
R57 Discovery Miles 570
Docking Edition Multi-Functional…
R1,099 R799 Discovery Miles 7 990
Bantex @School 13cm Kids Blunt Nose…
R16 Discovery Miles 160
Snappy Tritan Bottle (1.5L)(Green)
R229 R180 Discovery Miles 1 800

 

Partners