找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Computational Thinking; First Algorithms, Th Paolo Ferragina,Fabrizio Luccio Textbook 20181st edition Springer Nature Switzerland AG 2018 A

[復(fù)制鏈接]
查看: 31700|回復(fù): 48
樓主
發(fā)表于 2025-3-21 18:47:29 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Computational Thinking
副標(biāo)題First Algorithms, Th
編輯Paolo Ferragina,Fabrizio Luccio
視頻videohttp://file.papertrans.cn/234/233192/233192.mp4
概述Accessible introduction, suitable for undergraduate and high-school students, and for self-study.Assumes basic computing skills only as a prerequisite.Authors are highly experienced lecturers
圖書封面Titlebook: Computational Thinking; First Algorithms, Th Paolo Ferragina,Fabrizio Luccio Textbook 20181st edition Springer Nature Switzerland AG 2018 A
描述.This book offers a gentle motivation and introduction to computational thinking, in particular to algorithms and how they can be coded to solve significant, topical problems from domains such as finance, cryptography, Web search, and data compression...The book is suitable for undergraduate students in computer science,?engineering, and applied mathematics, university students in other fields, high-school students with an interest in STEM subjects, and professionals who want an insight into algorithmic solutions and the?related mindset. While the authors assume only basic mathematical?knowledge, they uphold the scientific rigor that is indispensable for?transforming general ideas into executable algorithms. A supporting website contains examples and Python code for implementing the?algorithms in the book..
出版日期Textbook 20181st edition
關(guān)鍵詞Algorithms; Algorithmic Thinking; Computational Thinking; Sorting; Search; Cryptology; Compression; Program
版次1
doihttps://doi.org/10.1007/978-3-319-97940-3
isbn_softcover978-3-030-07424-1
isbn_ebook978-3-319-97940-3
copyrightSpringer Nature Switzerland AG 2018
The information of publication is updating

書目名稱Computational Thinking影響因子(影響力)




書目名稱Computational Thinking影響因子(影響力)學(xué)科排名




書目名稱Computational Thinking網(wǎng)絡(luò)公開度




書目名稱Computational Thinking網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computational Thinking被引頻次




書目名稱Computational Thinking被引頻次學(xué)科排名




書目名稱Computational Thinking年度引用




書目名稱Computational Thinking年度引用學(xué)科排名




書目名稱Computational Thinking讀者反饋




書目名稱Computational Thinking讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:34:36 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:20:50 | 只看該作者
地板
發(fā)表于 2025-3-22 06:45:22 | 只看該作者
5#
發(fā)表于 2025-3-22 08:52:33 | 只看該作者
6#
發(fā)表于 2025-3-22 16:11:43 | 只看該作者
The Tournament,ght winning teams emerge that meet in the quarterfinals; the four winning teams play in the semifinals, and finally two teams play in the final from which the world champion team emerges. Note that these numbers 16, 8, 4, 2, and 1 are all powers of 2 with decreasing exponents: the last one is 2. = 1.
7#
發(fā)表于 2025-3-22 19:12:44 | 只看該作者
Secret Messages,nd they are sequences of characters and their transformation into a disguised form, and their subsequent interpretation, require appropriate algorithms. Let’s then enter into the field of ., etymologically “hidden writing”, where we will find new interesting forms of coding.
8#
發(fā)表于 2025-3-22 21:49:09 | 只看該作者
Putting Things in Order,nce of special marks that could easily identify some of them, any deck of cards in good condition is okay in all games for leisure, .. But how can we establish that it is? Or, better, considering the subject of this text, how can we establish this condition as quickly as possible?
9#
發(fā)表于 2025-3-23 04:10:38 | 只看該作者
10#
發(fā)表于 2025-3-23 05:43:07 | 只看該作者
Structure and Phylogeny of , Speciesh . that the authors of the pages had associated to them. The search proceeded on the words contained in the archived pages using a linear scan similar to that described in Chapter 3: this was possible due to the limited number of pages existing on the Web at that time and the queries sent to the search engine.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 10:41
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
鹤山市| 长沙市| 佛山市| 渝北区| 三台县| 望城县| 保亭| 清水河县| 崇明县| 贵德县| 子洲县| 平原县| 湾仔区| 惠水县| 奉化市| 收藏| 奉节县| 宜阳县| 扶风县| 汉阴县| 许昌县| 元朗区| 萍乡市| 光山县| 新巴尔虎左旗| 浠水县| 聂荣县| 宁河县| 灌云县| 都匀市| 屯门区| 康乐县| 贵溪市| 萝北县| 淳安县| 老河口市| 蓬莱市| 永川市| 灵台县| 双鸭山市| 贵港市|