Name: Algorithms Unlocked
SKU: 91165155
Price: 46000 KRW
Availability: InStock
Author: Thomas H. Cormen
ISBN: 9780262313230

카트

이미지 검색을 사용해 보세요

검색창 이전화면 이전화면

최근 검색어: 전체삭제

인기 검색어

닫기

공유하기

소득공제 정가제 Free EPUB

eBook Algorithms Unlocked

EPUB

Thomas H. Cormen 저

MIT Press 2013.03.01.

회원리뷰 첫번째 리뷰어가 되어주세요

가격: 46,000원

46,000

YES포인트?: 2,300원 (5%)

5만원 이상 구매 시 2천원 추가 적립

앱 다운 시 1천원 상품권

결제혜택: 최대 1,000원 적립

eBook 안내: 이 상품은 구매 후 지원 기기에서 예스24 eBook앱 설치 후 바로 이용 가능한 상품이며, 배송되지 않습니다.

시리즈 태그 업체 공지사항 구성 소개 특별 구성 MD 한마디 카드뉴스 상세 이미지 소개 관련 동영상 목차 미리듣기 저자 소개 관련분류 품목정보 만든이 코멘트 예스24 리뷰 책 속으로 줄거리 캐스팅 관련 자료 부가 영상 출판사 리뷰 전문가 리뷰 추천평

펼치기/닫기

소개

For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms.Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen?coauthor of the leading college textbook on the subject?provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems.Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order (“sorting”); how to solve basic problems that can be modeled in a computer with a mathematical structure called a “graph” (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.

소개 더보기펼치기

저자 소개

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).