preliminaries
play

Preliminaries CS105 : Saelee Thursday, August 27, 2009 Agenda - PowerPoint PPT Presentation

Sep 10, 2023 •44 likes •324 views

Preliminaries CS105 : Saelee Thursday, August 27, 2009 Agenda 1.Information on a computer 2. ada.cs.iit.edu 3.The command line Thursday, August 27, 2009 (1) Thursday, August 27, 2009 stored program concept Thursday, August 27, 2009 Data,

  1. Preliminaries CS105 : Saelee Thursday, August 27, 2009

  2. Agenda 1.Information on a computer 2. ada.cs.iit.edu 3.The command line Thursday, August 27, 2009

  3. (1) Thursday, August 27, 2009

  4. stored program concept Thursday, August 27, 2009

  5. Data, Instructions CPU Memory Results I/O devices von Neumann machine Thursday, August 27, 2009

  6. zeroes and ones “bits” binary representation Thursday, August 27, 2009

  7. 8 bits = 1 byte 1024 bytes = 1 kilobyte (KB) 1024 x 1024 bytes = 1 megabyte (MB) Thursday, August 27, 2009

  8. bits only text? Thursday, August 27, 2009

  9. A merican S tandard C ode for I nformation I nterchange Thursday, August 27, 2009

  10. 0 nul 1 soh 2 stx 3 etx 4 eot 5 enq 6 ack 7 bel 8 bs 9 ht 10 nl 11 vt 12 np 13 cr 14 so 15 si 16 dle 17 dc1 18 dc2 19 dc3 20 dc4 21 nak 22 syn 23 etb 24 can 25 em 26 sub 27 esc 28 fs 29 gs 30 rs 31 us 32 sp 33 ! 34 " 35 # 36 $ 37 % 38 & 39 ' 40 ( 41 ) 42 * 43 + 44 , 45 ‐ 46 . 47 / 48 0 49 1 50 2 51 3 52 4 53 5 54 6 55 7 56 8 57 9 58 : 59 ; 60 < 61 = 62 > 63 ? 64 @ 65 A 66 B 67 C 68 D 69 E 70 F 71 G 72 H 73 I 74 J 75 K 76 L 77 M 78 N 79 O 80 P 81 Q 82 R 83 S 84 T 85 U 86 V 87 W 88 X 89 Y 90 Z 91 [ 92 \ 93 ] 94 ^ 95 _ 96 ` 97 a 98 b 99 c 100 d 101 e 102 f 103 g 104 h 105 i 106 j 107 k 108 l 109 m 110 n 111 o 112 p 113 q 114 r 115 s 116 t 117 u 118 v 119 w 120 x 121 y 122 z 123 { 124 | 125 } 126 ~ 127 del Thursday, August 27, 2009

  11. plain text file ASCII binary patterns Thursday, August 27, 2009

  12. rich text files formatting Thursday, August 27, 2009

  13. binary files not human readable proprietary format Thursday, August 27, 2009

  14. Demo Thursday, August 27, 2009

  15. ASCII is for humans machine language for the machine (assembly language) Thursday, August 27, 2009

  16. 00: add $t0, $zero, $zero 04: addi $t0, $t0, 1 08: slti $t1, $t0, 4 12: bne $t1, $zero, 04 direct translation to binary “executable” Thursday, August 27, 2009

  17. H igh L evel L anguages ~ English Thursday, August 27, 2009

  18. e.g., C, C++, Objective C, C#, Java, Pascal, Lisp, OCaml, ML, Scheme, Perl, Ruby , Fortran, BASIC, Visual Basic, Icon, Applescript, JavaScript, Ada, Dylan, Tcl, Verilog, VHDL, Lua, ALGOL, ActionScript Thursday, August 27, 2009

  19. compiler translates HLL → machine code Thursday, August 27, 2009

  20. static vs. dynamic compilation vs. interpretation Thursday, August 27, 2009

  21. is interpreted Thursday, August 27, 2009

  22. </1> Thursday, August 27, 2009

  23. ada.cs.iit.edu Thursday, August 27, 2009

  24. Username: <my.iit.edu> Password: @c%h5#sh0 Thursday, August 27, 2009

  25. GNU / Linux s ecure sh ell access command line Thursday, August 27, 2009

  26. work on ada vs. work on your machine, upload to ada Thursday, August 27, 2009

  27. ruby vim, emacs, nano git Thursday, August 27, 2009

  28. Demo Thursday, August 27, 2009

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Preliminaries Programming Coprogramming Advanced Coprogramming Preliminaries Higher-Order

Preliminaries Programming Coprogramming Advanced Coprogramming Preliminaries Higher-Order

Certified Functional (Co)programming with Jasmin Andreas Andrei Dmitriy Blanchette Lochbihler Popescu Traytel Partly based on material by Tobias Nipkow Preliminaries Programming Coprogramming Advanced Coprogramming Preliminaries

1.76k views • 161 slides
Outline 2 Introduction Introduction Preliminaries Preliminaries Problem formulation Problem

Outline 2 Introduction Introduction Preliminaries Preliminaries Problem formulation Problem

FF-Bond: Multi-bit Flip-flop Bonding at Placement C HANG -C HENG T SAI Y IYU S HI G UOJIE L UO I RIS H UI -R U J IANG IRIS Lab NCTU MST PKU ISPD-13 Outline 2 Introduction Introduction Preliminaries Preliminaries Problem formulation

1.04k views • 46 slides
Preliminaries Q1 Is p &amp; G(p -&gt; XX p) a solution to the p on even states but saying

Preliminaries Q1 Is p &amp; G(p -&gt; XX p) a solution to the p on even states but saying

Preliminaries Q1 Is p &amp; G(p -&gt; XX p) a solution to the p on even states but saying nothing about odd states puzzle? A: no if p holds in an odd state, then it holds in all future odd states. We didnt want this. Preliminaries

1.06k views • 66 slides
1 Preliminaries Outline Scoping the tutorial Behind the P2P Moniker

1 Preliminaries Outline Scoping the tutorial Behind the P2P Moniker

Architectures and Algorithms for Internet-Scale (P2P) Data Management Joe Hellerstein Intel Research &amp; UC Berkeley Overview Preliminaries Ongoing Research What, Why Structured Overlays: DHTs The Platform Query

930 views • 58 slides
preliminaries: Kolmogorov complexity U(p) = T i (p) K(x) = min p { p : U(p) = x }

preliminaries: Kolmogorov complexity U(p) = T i (p) K(x) = min p { p : U(p) = x }

A safe &amp; computable approximation to Kolmogorov complexity Peter Bloem, Francisco Mota, Steven de Rooij, Lus Antunes &amp; Pieter Adriaans preliminaries: Kolmogorov complexity U(p) = T i (p) K(x) = min p { p : U(p) = x }

563 views • 30 slides
Talk Outline Core Computation for Data Exchange 1. Preliminaries Vadim Savenkov 2. Computing

Talk Outline Core Computation for Data Exchange 1. Preliminaries Vadim Savenkov 2. Computing

Talk Outline Core Computation for Data Exchange 1. Preliminaries Vadim Savenkov 2. Computing the core Vienna University of Technology DEIS 2010 November 9, 2010 Preliminaries: Labeled nulls and homomorphisms Embedded implicational

302 views • 5 slides
Outline Morning program Preliminaries Text matching I Text matching II Afternoon program

Outline Morning program Preliminaries Text matching I Text matching II Afternoon program

Outline Morning program Preliminaries Text matching I Text matching II Afternoon program Learning to rank Modeling user behavior Generating responses Wrap up 8 Outline Morning program Preliminaries Feedforward neural network Back

1.05k views • 43 slides
Outline Morning program Preliminaries Modeling user behavior Semantic matching Learning to

Outline Morning program Preliminaries Modeling user behavior Semantic matching Learning to

Outline Morning program Preliminaries Modeling user behavior Semantic matching Learning to rank Afternoon program Entities Generating responses Recommender systems Industry insights Q &amp; A 235 Outline Morning program Preliminaries

1.11k views • 40 slides
Outline Morning program Preliminaries Modeling user behavior Semantic matching Learning to

Outline Morning program Preliminaries Modeling user behavior Semantic matching Learning to

Outline Morning program Preliminaries Modeling user behavior Semantic matching Learning to rank Afternoon program Entities Generating responses Recommender systems Industry insights Q &amp; A 193 Outline Morning program Preliminaries

677 views • 42 slides
Outline Morning program Preliminaries Semantic matching Learning to rank Entities Afternoon

Outline Morning program Preliminaries Semantic matching Learning to rank Entities Afternoon

Outline Morning program Preliminaries Semantic matching Learning to rank Entities Afternoon program Modeling user behavior Generating responses Recommender systems Industry insights Q &amp; A 182 Outline Morning program Preliminaries

812 views • 42 slides
Structural attacks on block ciphers Sondre Rnjom NSM/UiB September 2, 2017 1 Preliminaries 2

Structural attacks on block ciphers Sondre Rnjom NSM/UiB September 2, 2017 1 Preliminaries 2

Structural attacks on block ciphers Sondre Rnjom NSM/UiB September 2, 2017 1 Preliminaries 2 Subspaces in block ciphers 3 From subspace trails to invariant subspaces in Simpira 4 Zero-di ff erence cryptanalysis of AES Preliminaries Block

2.18k views • 146 slides
Outline Preliminaries A brief introduction Random processes LIESSE Fourier representation of

Outline Preliminaries A brief introduction Random processes LIESSE Fourier representation of

Preliminaries Weakly stationary processes Random fields with orthogonal increments Linear filtering in the spectral domain Preliminaries Weakly stationary processes Random fields with orthogonal increments Linear filtering in the spectral

479 views • 11 slides
1. Preliminaries Let F be a number field. For each place v of F , let F v be the completion of F at

1. Preliminaries Let F be a number field. For each place v of F , let F v be the completion of F at

1. Preliminaries Let F be a number field. For each place v of F , let F v be the completion of F at v . For each finite v , let O v be the ring of integers of F v and denote by P v its maximal ideal. Let v be a generator of P v . Let q v = [ O

1.19k views • 104 slides
[0] The Function (and other mathematical and computational preliminaries) Set terminology and

[0] The Function (and other mathematical and computational preliminaries) Set terminology and

[0] The Function (and other mathematical and computational preliminaries) Set terminology and notation Set: an unordered collection of objects. Example: { , , , } : indicates that an object belongs to a set (equivalently, that

316 views • 27 slides
Modeling with UML Chapter 2, Preliminaries (1) Students from other departments than Informatik:

Modeling with UML Chapter 2, Preliminaries (1) Students from other departments than Informatik:

Object-Oriented Software Engineering Conquering Complex and Changing Systems Modeling with UML Chapter 2, Preliminaries (1) Students from other departments than Informatik: How do I get a Schein for this lecture? Hrerschein: just ask

607 views • 49 slides
Preliminaries CS 331: Data Structures and Algorithms Michael Lee &lt;lee@iit.edu&gt; Michael Lee

Preliminaries CS 331: Data Structures and Algorithms Michael Lee &lt;lee@iit.edu&gt; Michael Lee

Preliminaries CS 331: Data Structures and Algorithms Michael Lee &lt;lee@iit.edu&gt; Michael Lee - lee@iit.edu - http://moss.cs.iit.edu - Office: SB 226C - Hours: Wed/Fri 1-2PM (on Discord/Zoom) Agenda - Course overview &amp; Administrivia

910 views • 21 slides
Strings Repetition Hans-Joachim Bckenhauer and Dennis Komm Digital Medicine I: Introduction to

Strings Repetition Hans-Joachim Bckenhauer and Dennis Komm Digital Medicine I: Introduction to

Strings Repetition Hans-Joachim Bckenhauer and Dennis Komm Digital Medicine I: Introduction to Programming Logical Values and Control Structures Autumn 2019 October 17, 2019 Strings Characters The Unicode Table Strings are lists

408 views • 12 slides
Sky-position reconstruction abilities for different ET geometries and layouts Alexander Dietz

Sky-position reconstruction abilities for different ET geometries and layouts Alexander Dietz

Sky-position reconstruction abilities for different ET geometries and layouts Alexander Dietz Benoit Mours 23 Feb 2010 NIKHEF WG4 meeting 1 Outline Outline Overview Technical details Preliminary results SNR based

440 views • 20 slides
A 3D Nonlinear Simulation Study 1 , S.S. Kim 1 , T. Rhee 1 , H.G. Jhang 1 , G.Y. Park 1,2 , I.

A 3D Nonlinear Simulation Study 1 , S.S. Kim 1 , T. Rhee 1 , H.G. Jhang 1 , G.Y. Park 1,2 , I.

25 th IAEA Fusion Energy Conference, 13-18 Oct. 2014, Saint Petersburg, Russia L H Transition Criterion: A 3D Nonlinear Simulation Study 1 , S.S. Kim 1 , T. Rhee 1 , H.G. Jhang 1 , G.Y. Park 1,2 , I. Cziegler 2 , G. Tynan 2 , and P.H.

295 views • 13 slides
HACMS kickoff meeting: TA4 Technical Area 4: Integration John Rushby Computer Science Laboratory

HACMS kickoff meeting: TA4 Technical Area 4: Integration John Rushby Computer Science Laboratory

HACMS kickoff meeting: TA4 Technical Area 4: Integration John Rushby Computer Science Laboratory SRI International Menlo Park, CA John Rushby, SR I Evidential Tool Bus 1 Overview There are several parts to our effort under TA4 Bob

433 views • 17 slides
Topological Bandstructures for Ultracold Atoms Nigel Cooper Cavendish Laboratory, University of

Topological Bandstructures for Ultracold Atoms Nigel Cooper Cavendish Laboratory, University of

Optically Induced Gauge Fields Optical Flux Lattices Z 2 Topological Insulators Topological Bandstructures for Ultracold Atoms Nigel Cooper Cavendish Laboratory, University of Cambridge New quantum states of matter in and out of equilibrium

618 views • 29 slides
The symplectic type of congruences between elliptic curves John Cremona University of Warwick

The symplectic type of congruences between elliptic curves John Cremona University of Warwick

The symplectic type of congruences between elliptic curves John Cremona University of Warwick joint work with Nuno Freitas (Warwick) AGC 2 T Luminy, 10 June 2019 Overview 1. Elliptic curves, mod p Galois representations, Weil pairing. 2.

954 views • 70 slides
FUNDAMENTAL SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS INVOLVING FRACTIONAL POWERS OF

FUNDAMENTAL SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS INVOLVING FRACTIONAL POWERS OF

FUNDAMENTAL SOLUTIONS FOR FRACTIONAL DIFFERENTIAL EQUATIONS INVOLVING FRACTIONAL POWERS OF FINITE DIFFERENCES OPERATORS J. G onzalez-Camus (USACH) and P.J. Miana (UZ) Workshop on Banach spaces and Banach lattices ICMAT, September 2019,

567 views • 38 slides
Infinitesimal rigidity for unitarily invariant matrix norms Derek Kitson Lancaster University

Infinitesimal rigidity for unitarily invariant matrix norms Derek Kitson Lancaster University

Rigidity in normed spaces Rigidity in ( M n , ) Infinitesimal rigidity for unitarily invariant matrix norms Derek Kitson Lancaster University IWOTA, TU Chemnitz 17th August 2017 Derek Kitson Lancaster University Infinitesimal

721 views • 34 slides

More recommend