High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization


 Laureen Spencer
 9 months ago
 Views:
Transcription
1 What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton for wrtng programs Eamples: C, Java, Intel assemly language An etreme eample: Machne language Hence the need for program translators Eample: gcc Hgh level vs Low Level Englsh: To calculate the smple nterest, multply the prncpal amount y the rate of nterest y the numer of years C: W = X * Y * Z; Even etter C statement: SmpIeInterest = Prncpal * Rate * Years; 6 Hgh level vs Low Level Machne language: (transformed to a human readale form) movss (%rp), %mm movss y(%rp), %mm mulss %mm, %mm movss z(%rp), %mm mulss %mm, %mm movss %mm, w(%rp) C program s made up of statements Machne language program s made up of machne nstructons What does gcc do for you? % gcc hello.c hello.c source : Program that you wrote n the C language and typed nto the fle hello.c gcc a.out eecutale : Fle generated y gcc. The a.out fle contans an equvalent program n machne language that can e eecuted on a computer system 9 Basc Computer Organzaton Processor or CPU Memory The `rans of the computer system Program = Instructons + Data We wll net learn more aout data I/O Bus I/O I/O Where thngs are rememered program, data
2 There are dfferent knds of data How does one pece of data dffer from another? Constant vs Varale Basc vs Structured Of dfferent types Character Integer (unsgned, sgned) Real Others (oolean, comple, ) Data dfferng n ther lfetmes Lfetme: Interval etween tme of creaton and end of estence How long can the lfetme of a datum e? We wll consder 3 possle lfetmes 3 Program Data: Dfferent Lfetmes.. Lfetme = Eecuton tme of program Intalzed/unntalzed data Must e ndcated n eecutale fle The space n memory for all of ths data can e assgned when program eecuton starts (Statc Allocaton) Program Data: Dfferent Lfetmes.. Lfetme = Eecuton tme of program. Lfetme = Tme etween eplct creaton of data & eplct deleton of data Dynamc memory allocaton In C you create new data usng a functon lke malloc() The memory space for ths data s managed dynamcally when the malloc/free s eecuted (Heap allocaton) 4 5 Program Data: Dfferent Lfetmes... Lfetme = Eecuton tme of program. Lfetme = Tme etween eplct creaton of data & eplct deleton of data 3. Lfetme = Durng eecuton of a functon (.e., tme etween functon call and return) Local varales, parameters of the functon The memory space for ths data s assgned when the functon s called and reclamed on return from the functon (Stack allocaton) Stack: Lke a ple of ooks on a tale 6 Stack allocated: Functon Local Varales When the program starts eecutng Top of Stack Ponter Local Varales of man What f man() then calls functon func()? 7
3 Stack allocated: Functon Local Varales. Whle eecutng n functon func() Stack allocated: Functon Local Varales.. Eecutng n man() once agan Local varales of func Local Local Varales of of man Top of Stack Ponter Local Varales of man Top of Stack Ponter What happens on return from the call to func()? 8 9 Recurson vs Iteraton Eample: Compute N!, N > j fact N { nt N, fact, j; j++) for (fact=, j=; j <= N; fact = fact * j; J= J= J=98 J=99 N J= nt factoral (nt j) { f (j == ) return(); )); vod man() { nt N; return (j * factoral(j factoral(n); Durng program eecuton Code (machne language program) Data (ntalzed and unntalzed) Code and Data don t change n sze whle the program s eecutng Heap (for dynamcally allocated data) Stack (for functon local varales) Heap and Stack change n sze as program eecutes Code Intalzed Unntalzed Heap Stack Dgtal Computers As opposed to mechancal computers or analog computers Baage s Analytcal Engne Mechancal computers used mechancal parts lke gears and levers to calculate wkpeda 3
4 Analog Computer Dgtal Computers.. In current dgtal computers, values vary etween dscrete values and hgh and low Volts and 3 Volts Analog computers used contnuously varyng quanttes lke voltage In dgtal computers, dscretely varyng values are used nstead 5 Dgtal Crcuts Electrcal crcuts n whch voltages only take on a dscrete numer of values There are dgtal crcuts that can do calculatons, others that can e used to rememer values, etc 6 Eample: Bnary Addton Bnary: Base numer system You can generalze the decmal numer system, whch uses dgts (,,,9) to work wth any rad or ase ( d n n nd n... ddd ) ten d n dn... d d d n d Bnary dgts (called ts): and ( n n nn... ) two n n... n Eample: Decmal 47 s Bnary Bnary Addton.. t adder A crcut that can add one t to another t The dfferent cases = = =??? = = = = One t adder has nputs and outputs a t adder s c Bnary Addton.. t adder A crcut that can add one t value (a a ) to another t value ( ) s s Full t adder a a + s s s a s c t adder Ths dea can e etended to desgn a 3 t adder or a 64 t adder a 4
5 How s Data Represented? On a dgtal computer Bnary Base numer system Two values: and Bt (Notaton: ); Byte (Notaton: B) 8 ts Other notaton: K, M, G, T, P etc K:, M:, G: 3, etc G =,73,74,84 GB of RAM, TB hard dsk drve Character Data Typcally represented usng the ASCII code ASCII: Amercan Standard Code for Informaton Interchange Each character s represented y a unque 8 t ASCII code word Eample: a s represented y, s represented y 3 3 How s Data Represented? Character data: ASCII code Integer data In computer systems, you usually fnd support for oth sgned ntegers and unsgned ntegers e.g., C programmng nt ; Can take +ve or ve whole numer values unsgned nt y; Can take on +ve whole numer values Unsgned Integer Data Representaton: Bnary numer system ( n n nn... ) two n n... n e.g., Decmal s represented as.e. n 6 ts n 3 ts 3 33 Asde: << C << operator e.g., y = << 3; Left Shft y 3 ts Shfts each t to the left y 3 ts The 3 ts on the etreme left go away 3 Zero s come n at the rght etreme end e.g., n 8 ts, << 3 s Clam: Shftng an unsgned nt left y one t s the same as multplcaton y Qualfcaton: If the product can e computed.e., all of the ts that go away are Zero Asde: <<.. Proof: Consder n t value I = ( nn... ) Shfted left y t and n = we get ( nn3... ) n I n two two 34 5
6 Sgned Integer Data s Complement Representaton The n t quantty n n... represents the sgned nteger value n n n least sgnfcant t Eample: In 8 ts s represented as 3 s represented as 36 How s Data Represented? Character data: ASCII code Sgned Integer data: s complement Real data 37 Real data Real numers: ponts on the nfntely long real numer lne There are an nfntely many ponts etween any two ponts on the real numer lne Real Data: Floatng Pont Representaton IEEE Floatng Pont Standard (IEEE 754) 3 t value wth 3 components ( s, e, f ). s ( t sgn). e (8 t eponent) 3. f (3 t fracton) represents the value s ( ). f e Eample: IEEE Sngle Float Consder the decmal value.5 Equal to. n nary. s ( ). f s:, e: 6, f: e7 In 3 ts, 4 Basc Computer Organzaton Man parts of a computer system: Processor: Eecutes programs Man memory: Holds program and data I/O devces: For communcaton wth outsde Machne nstructon: Descrpton of prmtve operaton that machne hardware s ale to eecute e.g. ADD these two ntegers Instructon Set: Complete specfcaton of all the knds of nstructons that the processor hardware was ult to eecute 4 6
7 Basc Computer Organzaton Processor or CPU Memory Bus I/O I/O I/O 4 Asde: Aout Memory What s memory? Devces that can rememer thngs There are dfferent knds of memory n a computer system Some rememer y the state an electrcal crcut s n e.g., SRAM Others rememer y the amount of electrcal charge stored n a capactor e.g., DRAM Memory Yet others rememer y magnetc or optcal propertes e.g., Hard dsk drve/mag Tape, CD/DVD They can vary sustantally n ther speed and capacty 43 Man Memory. Holds nstructons and data Vew t as a sequence of fed szed locatons, each referred to y a unque memory address In many computers, the sze of each memory locaton s Byte,73,74,83 (f memory s of sze GB) 8 ts 3 Man Memory.. Values that occupy more than 8 ts would occupy more than one, neghourng memory locatons e.g., 3 t sgned nteger would occupy 4 neghourng memory locatons, maye as shown 3,73,74,83 8 ts char A[4] A[] A[] A[] A[3] Data Structures: Arrays rows char B[4][] columns B[][] B[][] B[][] B[][] B[][] B[][] 3 B[3][] B[3][] B[][] B[][] B[][] B[][] B[][] B[][] B[3][] B[3][] struct node { char data; Data Structures: Lnked Lsts struct node *net; / a ponter: 3 ts n sze struct node *head; / a character: 8 ts n sze / a ponter: 3 ts n sze / n memory at address < z z > 7
Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationNews. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton JanApr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationLecture 3: Computer Arithmetic: Multiplication and Division
8447 Lecture 3: Computer Arthmetc: Multplcaton and Dvson James C. Hoe Dept of ECE, CMU January 26, 29 S 9 L3 Announcements: Handout survey due Lab partner?? Read P&H Ch 3 Read IEEE 754985 Handouts:
More informationHarvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)
Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationAssembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.
IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language
More informationOverview. CSC 2400: Computer Systems. Pointers in C. Pointers  Variables that hold memory addresses  Using pointers to do callbyreference in C
CSC 2400: Comuter Systems Ponters n C Overvew Ponters  Varables that hold memory addresses  Usng onters to do callbyreference n C Ponters vs. Arrays  Array names are constant onters Ponters and Strngs
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memorymanagement methods normally requres the entre process
More informationParallel matrixvector multiplication
Appendx A Parallel matrxvector multplcaton The reduced transton matrx of the threedmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationEsc101 Lecture 1 st April, 2008 Generating Permutation
Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For
More informationIntroduction to Programming. Lecture 13: Container data structures. Container data structures. Topics for this lecture. A basic issue with containers
1 2 Introducton to Programmng Bertrand Meyer Lecture 13: Contaner data structures Last revsed 1 December 2003 Topcs for ths lecture 3 Contaner data structures 4 Contaners and genercty Contan other objects
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract In the study of data representaton n dgtal desgn and computer
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
More informationCache Memories. Lecture 14 Cache Memories. Inserting an L1 Cache Between the CPU and Main Memory. General Org of a Cache Memory
Topcs Lecture 4 Cache Memores Generc cache memory organzaton Drect mapped caches Set assocate caches Impact of caches on performance Cache Memores Cache memores are small, fast SRAMbased memores managed
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce  1. Introducton Vector 3D model representaton n computer graphcs requres
More informationFor instance, ; the five basic numbersets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationCS221: Algorithms and Data Structures. Priority Queues and Heaps. Alan J. Hu (Borrowing slides from Steve Wolfman)
CS: Algorthms and Data Structures Prorty Queues and Heaps Alan J. Hu (Borrowng sldes from Steve Wolfman) Learnng Goals After ths unt, you should be able to: Provde examples of approprate applcatons for
More informationCHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar
CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vdyanagar Faculty Name: Am D. Trved Class: SYBCA Subject: US03CBCA03 (Advanced Data & Fle Structure) *UNIT 1 (ARRAYS AND TREES) **INTRODUCTION TO ARRAYS If we want
More informationRADIX10 PARALLEL DECIMAL MULTIPLIER
RADIX10 PARALLEL DECIMAL MULTIPLIER 1 MRUNALINI E. INGLE & 2 TEJASWINI PANSE 1&2 Electroncs Engneerng, Yeshwantrao Chavan College of Engneerng, Nagpur, Inda Emal : mrunalngle@gmal.com, tejaswn.deshmukh@gmal.com
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT09105, Phone: (3705) , Fax: (3705) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths userfrendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (SemCentralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of IllnosUrbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan ScentfcResearch and DesgnProspectng Insttute of Energetc AZ1012, Ave HZardab94 Emal:aydn_murad@yahoocom Importance of
More informationNachos Project 3. Speaker: ShengWei Cheng 2010/12/16
Nachos Project Speaker: ShengWe Cheng //6 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson Agenda Motvaton User Programs n Nachos Related Nachos
More informationMotivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:
4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://etellgentnternetmarketng.com/webste/frustratedcomputeruser2/
More informationGiving credit where credit is due
CSCE 23J Computer Organzaton Cache Memores Dr. Stee Goddard goddard@cse.unl.edu Gng credt where credt s due Most of sldes for ths lecture are based on sldes created by Drs. Bryant and O Hallaron, Carnege
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of BozenBolzano Faculty of Computer Scence Academc Year 01101 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More information4/11/17. Agenda. Princeton University Computer Science 217: Introduction to Programming Systems. Goals of this Lecture. Storage Management.
//7 Prnceton Unversty Computer Scence 7: Introducton to Programmng Systems Goals of ths Lecture Storage Management Help you learn about: Localty and cachng Typcal storage herarchy Vrtual memory How the
More informationNotes on Organizing Java Code: Packages, Visibility, and Scope
Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng
More informationHigh Performance Computing Lecture 1. Matthew Jacob Indian Institute of Science
High Performance Computing Lecture 1 Matthew Jacob Indian Institute of Science Agenda 1. Program execution: Compilation, Object files, Function call and return, Address space, Data & its representation
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationQ.f f fractional bits : [2 b1 / 2 f, (2 b11) / 2 f ] e.g. Q.15 Needs f+1 bits at least, b>f Resolution 2 f
Fxed Pont Numer Representaton A Fxed Pont Numer s essentally an nteger that s scaled y a certan factor. Usually radx (nary) (or ) No need to store the scale 3.4 = 34/ Scalng s t shft n nary case s complement,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) Inplace Merge Sort T(n) = Θ(n lg(n)) Not nplace Selecton Sort (from homework) T(n) = Θ(n 2 ) Inplace
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationArea Efficient Self Timed Adders For Low Power Applications in VLSI
ISSN(Onlne): 23198753 ISSN (Prnt) :23476710 Internatonal Journal of Innovatve Research n Scence, Engneerng and Technology (An ISO 3297: 2007 Certfed Organzaton) Area Effcent Self Tmed Adders For Low
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationMemory and I/O Organization
Memory and I/O Organzaton 81 Prncple of Localty Localty small proporton of memory accounts for most run tme Rule of thumb For 9% of run tme next nstructon/data wll come from 1% of program/data closest
More informationInsertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array
Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then
More informationMATHEMATICS FORM ONE SCHEME OF WORK 2004
MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationReport on Online Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More information2D Raster Graphics. Integer grid Sequential (leftright, topdown) scan. Computer Graphics
2D Graphcs 2D Raster Graphcs Integer grd Sequental (leftrght, topdown scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves
More informationOutline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011
9/8/2 2 Outlne Appendx C: The Bascs of Logc Desgn TDT4255 Computer Desgn Case Study: TDT4255 Communcaton Module Lecture 2 Magnus Jahre 3 4 Dgtal Systems C.2: Gates, Truth Tables and Logc Equatons All sgnals
More informationPass by Reference vs. Pass by Value
Pass by Reference vs. Pass by Value Most methods are passed arguments when they are called. An argument may be a constant or a varable. For example, n the expresson Math.sqrt(33) the constant 33 s passed
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationAgenda & Reading. Simple If. DecisionMaking Statements. COMPSCI 280 S1C Applications Programming. Programming Fundamentals
Agenda & Readng COMPSCI 8 SC Applcatons Programmng Programmng Fundamentals Control Flow Agenda: Decsonmakng statements: Smple If, Ifelse, nested felse, Select Case s Whle, DoWhle/Untl, For, For Each, Nested
More informationOutline. CIS 110: Introduction to Computer Programming. Review: Interactive Sum. More Cumulative Algorithms. Interactive Sum Trace (2)
Outlne CIS 110: Introducton to Computer Programmng More on Cumulatve Algorthms Processng Text Tacklng Programmng Problems Lecture 11 Text Processng and More On Desgn ( 4.24.3) 10/17/2011 CIS 110 (11fa)
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the freeresponse questons and the allocaton of ponts for
More informationThis chapter discusses aspects of heat conduction. The equilibrium heat conduction on a rod. In this chapter, Arrays will be discussed.
1 Heat Flow n a Rod Ths chapter dscusses aspects of heat conducton. The equlbrum heat conducton on a rod. In ths chapter, Arrays wll be dscussed. Arrays provde a mechansm for declarng and accessng several
More informationLoad Balancing for HexCell Interconnection Network
Int. J. Communcatons, Network and System Scences,,,  Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for HexCell Interconnecton Network Saher Manaseer,
More informationImproved Symoblic Simulation By Dynamic Funtional Space Partitioning
Improved Symoblc Smulaton By Dynamc Funtonal Space Parttonng Tao Feng, L.Wang, KwangTng heng Department of EE, USanta Barbara, U.S.A tfeng,lcwang, tmcheng @ece.ucsb.edu Andy . Ln adence Desgn Systems,
More informationCS240: Programming in C. Lecture 12: Polymorphic Sorting
CS240: Programmng n C ecture 12: Polymorphc Sortng Sortng Gven a collecton of tems and a total order over them, sort the collecton under ths order. Total order: every tem s ordered wth respect to every
More informationSorting. Sorting. Why Sort? Consistent Ordering
Sortng CSE 6 Data Structures Unt 15 Readng: Sectons.1. Bubble and Insert sort,.5 Heap sort, Secton..6 Radx sort, Secton.6 Mergesort, Secton. Qucksort, Secton.8 Lower bound Sortng Input an array A of data
More informationCPE 628 Chapter 2 Design for Testability. Dr. Rhonda Kay Gaede UAH. UAH Chapter Introduction
Chapter 2 Desgn for Testablty Dr Rhonda Kay Gaede UAH 2 Introducton Dffcultes n and the states of sequental crcuts led to provdng drect access for storage elements, whereby selected storage elements are
More informationSorting: The Big Picture. The steps of QuickSort. QuickSort Example. QuickSort Example. QuickSort Example. Recursive Quicksort
Sortng: The Bg Pcture Gven n comparable elements n an array, sort them n an ncreasng (or decreasng) order. Smple algorthms: O(n ) Inserton sort Selecton sort Bubble sort Shell sort Fancer algorthms: O(n
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More information5.1 The ISR: Overvieui. chapter
chapter 5 The LC3 n Chapter 4, we dscussed the basc components of a computer ts memory, ts processng unt, ncludng the assocated temporary storage (usually a set of regsters), nput and output devces, and
More informationSetup and Use. Version 3.7 2/1/2014
Verson 3.7 2/1/2014 Setup and Use MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com Contents Text2Bd checklst 3 Preparng
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483  Confguraton Software Instructon Manual VBD 6124 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded realtme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationThe AVL Balance Condition. CSE 326: Data Structures. AVL Trees. The AVL Tree Data Structure. Is this an AVL Tree? Height of an AVL Tree
CSE : Data Structures AL Trees Neva Cernavsy Summer Te AL Balance Condton AL balance property: Left and rgt subtrees of every node ave egts dfferng by at most Ensures small dept ll prove ts by sowng tat
More informationRandom Kernel Perceptron on ATTiny2313 Microcontroller
Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationFPGA IMPLEMENTATION OF RADIX10 PARALLEL DECIMAL MULTIPLIER
FPGA IMPLEMENTATION OF RADIX10 PARALLEL DECIMAL MULTIPLIER A Dssertaton Submtted In Partal Fulflment of the Requred for the Degree of MASTER OF TECHNOLOGY In VLSI Desgn Submtted By GEETA Roll no. 601361009
More informationStorage Binding in RTL synthesis
Storage Bndng n RTL synthess Pe Zhang Danel D. Gajsk Techncal Report ICS037 August 0th, 200 Center for Embedded Computer Systems Department of Informaton and Computer Scence Unersty of Calforna, Irne
More informationUsing Delayed Addition Techniques to Accelerate Integer and FloatingPoint Calculations in Configurable Hardware
Draft submtted for publcaton. Please do not dstrbute Usng Delayed Addton echnques to Accelerate Integer and FloatngPont Calculatons n Confgurable Hardware Zhen Luo, Nonmember and Margaret Martonos, Member,
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981x manuscrpts OPEN ACCES UbCC Journal ISSN 19928424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More information12/2/2009. Announcements. Parametric / Nonparametric. CaseBased Reasoning. NearestNeighbor on Images. NearestNeighbor Classification
Introducton to Artfcal Intellgence V22.0472001 Fall 2009 Lecture 24: NearestNeghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UTAustn Last tme: wndowbased generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationLLVM passes and Intro to Loop Transformation Frameworks
LLVM passes and Intro to Loop Transformaton Frameworks Announcements Ths class s recorded and wll be n D2L panapto. No quz Monday after sprng break. Wll be dong mdsemester class feedback. Today LLVM passes
More informationSpecifications in 2001
Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secretkey
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationBITPLANE AG IMARISCOLOC. Operating Instructions. Manual Version 1.0 January the image revolution starts here.
BITPLANE AG IMARISCOLOC Operatng Instructons Manual Verson 1.0 January 2003 the mage revoluton starts here. Operatng Instructons BITPLANE AG Copyrght Ths document contans propretary nformaton protected
More informationCHAPTER 4. Applications of Boolean Algebra/ Minterm and Maxterm Expansions
Fundaentals o Logc Desgn hap. 4 HAPTER 4 /8 Applcatons o Boolean Algebra/ Mnter and Maxter Expansons Ths chapter n the book ncludes: Objectves Study Gude 4. onverson o Englsh Sentences to Boolean Equatons
More informationAlgorithm To Convert A Decimal To A Fraction
Algorthm To Convert A ecmal To A Fracton by John Kennedy Mathematcs epartment Santa Monca College 1900 Pco Blvd. Santa Monca, CA 90405 jrkennedy6@gmal.com Except for ths comment explanng that t s blank
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More information