Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Python basics
Search
b4d
November 09, 2016
Programming
0
49
Python basics
Course held at National Institute of Chemistry in Ljubljana, 2016.
b4d
November 09, 2016
Tweet
Share
More Decks by b4d
See All by b4d
ASLR - Address Space Layout Randomization
b4d
0
360
Other Decks in Programming
See All in Programming
Lambda のコードストレージ容量に気をつけましょう
tattwan718
0
110
AIと一緒にレガシーに向き合ってみた
nyafunta9858
0
170
開発者から情シスまで - 多様なユーザー層に届けるAPI提供戦略 / Postman API Night Okinawa 2026 Winter
tasshi
0
190
CSC307 Lecture 02
javiergs
PRO
1
770
プロダクトオーナーから見たSOC2 _SOC2ゆるミートアップ#2
kekekenta
0
200
AIによる高速開発をどう制御するか? ガードレール設置で開発速度と品質を両立させたチームの事例
tonkotsuboy_com
6
1.9k
Architectural Extensions
denyspoltorak
0
270
組織で育むオブザーバビリティ
ryota_hnk
0
170
CSC307 Lecture 07
javiergs
PRO
0
550
余白を設計しフロントエンド開発を 加速させる
tsukuha
7
2.1k
Spinner 軸ズレ現象を調べたらレンダリング深淵に飲まれた #レバテックMeetup
bengo4com
1
230
OCaml 5でモダンな並列プログラミングを Enjoyしよう!
haochenx
0
120
Featured
See All Featured
brightonSEO & MeasureFest 2025 - Christian Goodrich - Winning strategies for Black Friday CRO & PPC
cargoodrich
3
97
Faster Mobile Websites
deanohume
310
31k
How Fast Is Fast Enough? [PerfNow 2025]
tammyeverts
3
450
世界の人気アプリ100個を分析して見えたペイウォール設計の心得
akihiro_kokubo
PRO
66
36k
Between Models and Reality
mayunak
1
180
How Software Deployment tools have changed in the past 20 years
geshan
0
32k
Evolving SEO for Evolving Search Engines
ryanjones
0
120
We Are The Robots
honzajavorek
0
160
Context Engineering - Making Every Token Count
addyosmani
9
650
"I'm Feeling Lucky" - Building Great Search Experiences for Today's Users (#IAC19)
danielanewman
231
22k
How GitHub (no longer) Works
holman
316
140k
Groundhog Day: Seeking Process in Gaming for Health
codingconduct
0
90
Transcript
INTRODUCTION PYTHON
GOALS OUR ? ‣HAVE FUN ‣SAVE TIME ‣DO MAGIC
THERE HOW TO GET ? ‣TIMETABLE ‣HOMEWORK ‣DURATION
None
print “Hello world” PYTHON 01000001 01000111 00001001 01100011 01100001 01000010
01001101 00111011 11010110 01000101 00000111 10101010 00011011 11000100 00100001 01101100 00000001 10010000 00000101 00000000 10101010 10001111 … BINARY CODE (FAKE)
PYTHON WHAT IS ? ‣OPEN ‣FREE ‣EASY*
DIVE INTO SLIDES ARE BORING
None
None
INTRODUCTION PYTHON PART TWO
VARIABLES SPREMENLJIVKE
BOOLEAN a = True b = False BOOLEAN
NUMBERS a = 10 b = 10.2 INTEGER FLOAT
STRINGS a = “niz znakov” INTEGER
OPERATORS ARITHMETIC
MATH OPERATIONS + - * / % **
STRINGS NIZI ZNAKOV
STRINGS a = “char \”escaping\” too” znak = “cats”[0] CHAR
ESCAPE INDEXING
“test”.lower() STRING FUNCTIONS “test”.upper() LOWERCASE UPPERCASE len(“test”) LENGTH
TRICKS VARIOUS
COMMENTS # comment 1 “”” comment 1 comment 2 “””
SINGLE LINE MULTI LINE
print “text” PRINTING print a STRING VARIABLE print “a” +
“b” CONCATENATION
“3”.int() TYPE CASTING str(3) STRING TO INT INT TO STRING
INTRODUCTION PYTHON PART THREE
raw_input(“Ime: ”) INPUT STRING
== != < > <= >= COMPARATORS
and or not BOOLEAN OPERATORS not and or PRIORITY
if x < 9: print “st. x je manjse od
9” elif x > 9: print “st. x je vecje od 9” else: print “st. x je enako 9” CONDITIONAL STATEMENTS
INTRODUCTION PYTHON PART FOUR
INTRODUCTION PYTHON PART FIVE
INTRODUCTION PYTHON PART SIX