Programming for engineers in python

May 4, 2016Download as pptx, pdf

0 likes161 views

This document provides an agenda and notes for a programming lecture. The lecture covers sample problems, hash functions and dictionaries, simulating a car, functions as arguments, checking Fermat's Last Theorem, cumulative sums, estimating e and pi through Taylor expansions, finding words with triple double letters, PyGame for game development, and developing a single-player and two-player car game in PyGame. The document includes code examples and references to further resources.

Recitation 4
Programming for Engineers in Python

Agenda
 Sample problems
 Hash functions & dictionaries (or next week)
 Car simulation
2

A function can be an argument
3
def do_twice(f):
f()
f()
def print_spam():
print 'spam'
>>> do_twice(print_spam)
spam
spam

Fermat’s last theorem
4
 Fermat’s famous theorem claims that for any n>2,
there are no three positive integers a, b, and c
such that:
𝑎 𝑛
+ 𝑏 𝑛
= 𝑐 𝑛
 Let’s check it!
def check_fermat(a,b,c,n):
if n>2 and a**n + b**n == c**n:
print "Fermat was wrong!"
else:
print "No, that doesn't work"
Pierre de Fermat
1601-1665

Fermat’s last theorem
5
>>> check_fermat(3,4,5,2)
No, that doesn't work
>>> check_fermat(3,4,5,3)
No, that doesn't work
 Dirty shortcut since 1995:
def check_fermat(a,b,c,n):
print "Wiles proved it doesn’t work"
Sir Andrew John Wiles
1953-

Cumulative sum
6
 For a given list A we will return a list B such that
B[n] = A[0]+A[1]+…A[n]
 Take 1:
def cumulative_sum(lst):
summ = [ lst[0] ] * len(lst)
for i in range(1, len(lst)):
summ[i] = summ[i-1] + lst[i]
return summ
 Take 2:
def cumulative_sum(lst):
return [sum(lst[0:n]) for n in range(1, len(lst)+1)]

Estimating e by it’s Taylor expansion
7
from math import factorial, e
term = 1
summ = 0
k = 0
while term > 1e-15:
term = 1.0/factorial(k)
summ += term
k += 1
print "Python e:", e
print “Taylor’s e:", summ
print “Iterations:”, k
𝑒 =
𝑘=0
∞
1
𝑘!
= 2 +
1
2
+
1
6
+
1
24
+ ⋯
Brook Taylor,
1685-1731

Estimating π by the Basel
problem
8
from math import factorial, pi, sqrt
term = 1
summ = 0
k = 1
while term > 1e-15:
term = 1.0/k**2
summ += term
k += 1
summ = sqrt(summ*6.0)
print "Python pi:", pi
print “Euler’s pi:", summ
print “Iterations:”, k
𝜋2
6
=
𝑘=1
∞
1
𝑘2 = 1 +
1
4
+
1
9
+
1
16
+ ⋯
Leonard Euler,
1707-1783

Ramanujan’s π estimation (optional)
9
from math import factorial, pi
term = 1
summ = 0
k = 0
while term > 1e-15:
term = factorial(4.0*k) / factorial(k)**4.0
term *= (1103.0+26390.0*k) / 396.0**(4.0*k)
summ += term
k += 1
summ = 1.0/(summ * 2.0*2.0**0.5 / 9801.0)
print "Python Pi:", pi
print "Ramanujan Pi:", summ
print “Iterations:”, k
Srinivasa
Ramanujan,
1887-1920

Triple Double Word
10
 We want to find a word that has three double letters in
it, like aabbcc (which is not a word!)
 Almost qualifiers:
 Committee
 Mississippi
 Write a function to check if a word qualifies
 Write a function that reads a text file and checks all
the words
 Code:
http://www.greenteapress.com/thinkpython/code/carta
lk.py
 Corpus:
http://www.csie.ntu.edu.tw/~pangfeng/Fortran%20exa
mples/words.txt

PyGame
11
 A set of Python modules designed for writing
computer games
 Download & install:
http://pygame.org/ftp/pygame-1.9.2a0.win32-
py2.7.msi

Car game
12
 Control a car moving on the screen
 YouTube demo:
http://www.youtube.com/watch?v=DMOj3HpjemE
 Code: https://gist.github.com/1372753 or in car.py
 Car controlled by
arrows
 Honk with Enter
 Exit with ESC

ToDo List:
13
 Fix stirring problem
 Honk by pressing space
 Car will go from the bottom to top and from one
side to the other (instead of getting stuck)
 Switch to turtle!

2 players car game
14
 Collision avoidance simulator:
 When the cars are too close one of them honks
 Players need to maneuver the cars to avoid honks
 Code: https://gist.github.com/1380291 or cars.py
 Red car controlled by arrows
 Blue car controlled by z, x, c, s

The document discusses the Fourier series expansion of a mathematical function that describes musical harmony and the Pythagorean tuning system. It shows that the ratios between notes in the Pythagorean scale can be expressed as a linear sequence of powers of 2 and 3. This allows the ratios to be written as terms of a Fourier series expansion, with a periodic nature where the exponential resets every time the integer value increases by the period. The Fourier coefficients are then calculated through integration to express the function in its Fourier form.

2Bytesprog2 course_2014_c6_single linked listkinan keshkeh

The document discusses linked lists and procedures for creating, adding, and deleting nodes from single linked lists. It provides examples of procedures to create lists from the first node to last (FIFO) and last to first (FILO). It also includes procedures for adding a node to the list in different cases, and deleting a node by finding and removing the target node. The homework assignments involve writing procedures to search for nodes in a linked list based on values, add a node to a specified position, replace node values, and create and combine two linked lists with different creation orders.

Buzzword poem generator in Pythondelimitry

SortingSaurabh Mishra

Insertion sort and merge sort are discussed. Insertion sort works by inserting elements in the proper position one by one. Its worst case time is O(N^2). Merge sort uses a divide and conquer approach to sort elements. It divides the list into halves, recursively sorts the halves, and then merges the sorted halves. Merging two sorted lists takes linear time. The overall time for merge sort is O(N log N). Heaps are discussed as a way to implement priority queues. A heap has the heap property where a node is always less than its children. This allows finding the minimum element and deleting it to take O(log N) time.

Reg ex cheatsheetDieudonne Nahigombeye

This cheat sheet provides a concise summary of regular expression syntax and functions for working with regular expressions in R. It lists common regex patterns and modifiers, explains what they match, and provides examples of functions like grep, grepl, sub, gsub, and regexpr that allow extracting, replacing, and manipulating text using regex patterns in R. Key regex constructs covered include quantifiers, character classes, word boundaries, grouping, lookarounds, conditionals, escaping, and case-insensitive matching.

Learning Algorithms For Life ScientistsBrian Frezza

Brian M. Frezza's document explores learning algorithms in artificial intelligence, defining them as algorithms that predict data behavior based on past performance. It discusses various models such as Bayesian networks, hidden Markov models, genetic algorithms, and neural networks, alongside real-world applications like speech recognition and biological predictions. Additionally, it highlights the importance of training and testing data, and how these algorithms learn from data structures and patterns.

Stacks queuesRajendran

This document discusses data structures and algorithms for stacks and queues. It describes the common operations for stacks and queues like push, pop, enqueue, dequeue. It provides array-based and linked list-based implementations for both stacks and queues. For queues, it discusses two implementations using arrays: one using front and rear indexes, and another using a circular queue approach. The time complexities of common operations on stacks and queues are also analyzed.

Ch17Abbott

This document describes linked lists and operations on linked lists in C++. It discusses the composition of linked lists as series of connected nodes where each node contains data and a pointer to the next node. Common linked list operations like appending, inserting, traversing and displaying nodes are presented with pseudocode algorithms and C++ code implementations. Functions for appending nodes to the end of the list, inserting nodes in the proper sorted position, and traversing the list to display node values are demonstrated through example programs.

Periodic pattern miningAshis Kumar Chanda

The document presents a discussion on periodic pattern mining in time series databases, focusing on key concepts such as time-series definitions, various forms of periodicity, and techniques for detecting these patterns using suffix trees. It covers algorithms proposed for segment and symbol periodicity detection, highlighting their complexities and potential improvements. Additionally, it references existing literature and proposes an algorithm with better efficiency than previous works.

Merge sort algorithmShubham Dwivedi

Python programming for Beginners - IINEEVEE Technologies

Merge sortAbdelrahman Saleh

함수형사고 4장 열심히보다는현명하게박 민규

The document contains code for several purposes: 1) A ClassifierCacheSum class that caches the sum of factors for a number to avoid recomputing. 2) A PrimeIterator class that lazily generates prime numbers. 3) Functions for lazily operating on sequences such as filtering, mapping, limiting, finding values, etc. 4) Classes for classifying numbers as perfect, abundant or deficient based on the sum of their factors.

binary searchAbdelrahman Saleh

Binary search is an algorithm that searches for a target value in a sorted array by repeatedly dividing the search interval in half. It begins with an interval covering the whole array and if the target value is less than the middle element, it narrows the interval to the lower half, otherwise it narrows to the upper half. It repeats this process until the target is found or the interval is empty. The time complexity is O(log n), with the best case when the target is at the middle index and worst case when the target does not exist in the array. Examples in C++, Java, and Python are provided.

Fourier series and transformsPepa Vidosa Serradilla

This document discusses Fourier series and transforms. It begins by introducing periodic functions and their fundamental periods. It then defines Fourier series and derives the formulas for the Fourier coefficients. Several examples of calculating Fourier series are provided. It also covers Fourier series for functions with any period, complex Fourier series, Parseval's identity and its applications, and Dirichlet's theorem. The key topics of Fourier series, Fourier transforms, and their applications in engineering mathematics are covered over multiple sections.

Rabin karp string matching algorithmGajanand Sharma

The Rabin-Karp string matching algorithm calculates a hash value for the pattern and for each substring of the text to compare values efficiently. If hash values match, it performs a character-by-character comparison, otherwise it skips to the next substring. This reduces the number of costly comparisons from O(MN) in brute force to O(N) on average by filtering out non-matching substrings in one comparison each using hash values. Choosing a large prime number when calculating hash values further decreases collisions and false positives.

Counting sort(Non Comparison Sort)Hossain Md Shakhawat

Comparison sorting algorithms work by making pairwise comparisons between elements to determine the order in a sorted list. They have a lower bound of Ω(n log n) time complexity due to needing to traverse a decision tree with a minimum of n log n comparisons. Counting sort is a non-comparison sorting algorithm that takes advantage of key assumptions about the data to count and place elements directly into the output array in linear time O(n+k), where n is the number of elements and k is the range of possible key values.

Asymptote Curve IHirwanto Iwan

2015.3.12 the root of lispChung-Hsiang Ofa Hsueh

The document discusses the origins and key concepts of the Lisp programming language, including: 1) John McCarthy invented Lisp in 1958 and its use of operators and notation for functions formed the basis of a whole new programming language model compared to languages like C. 2) Lisp code and data are made up of the same basic data structures (atoms and lists) and the quote operator distinguishes code from data. Common list-based operators like car, cdr, cons, cond, and lambda are explained. 3) Functions in Lisp are defined using the lambda operator and can take arguments and return values like other expressions, allowing programs to be composed of and evaluated as expressions.

Writing Perl 6 Rxlichtkind

New day 8 examplesjchartiersjsd

This document provides instructions on how to find the secant of an angle and uses trigonometric addition formulas to solve problems involving adding angles. It contains two examples where values for cosine and sine are given for angles in different quadrants and asks to find other trig functions of the sum of the angles, including sine, cosine, coordinates, quadrants, tangent, and cosecant of the sum.

Infix prefix postfixSelf-Employed

The document covers infix, postfix, and prefix notations in mathematics, explaining the order of operations and how to convert between these forms. It details the evaluation of postfix expressions using a stack and provides examples for both infix to postfix conversions and prefix evaluation. Additionally, it discusses recursion, its advantages and disadvantages, and illustrates a recursive algorithm for solving the Tower of Hanoi problem.

Basic python laboratoty_ PSPP Manual .docxKirubaburi R

Python.pptxAKANSHAMITTAL2K21AFI

This document provides a quick tour of the Python programming language. It introduces basic Python concepts like data types, variables, operators, conditional statements, loops, and functions. It explains how to get user input, perform type conversions, and work with common data types like integers, floats, strings, and booleans. It also demonstrates how to define functions, use default arguments and keyword arguments, and handle global variables. The document uses examples to illustrate concepts like arithmetic operations, string slicing, indexing, concatenation, and repetition.

Pratt Parser in PythonPercolate

This document describes a Pratt parser implementation in Python. It begins with an example mathematical expression to parse and reasons for writing one's own parser. It then provides an overview of Pratt parsing, describing it as an efficient, modular technique. The document proceeds to describe the parser implementation including token and node classes. It defines the grammar using token precedence rather than BNF. Overall, the document presents a Python implementation of a Pratt precedence parser for arithmetic expressions.

Free Monads Getting StartedKent Ohashi

1. Free monads allow defining monadic interpreters for domain-specific languages (DSLs) by representing the DSL's abstract syntax tree as a recursive data type and making it an instance of the Functor typeclass. 2. The document provides an example of defining a DSL for reverse polish notation (RPN) expressions using a Free monad. This includes defining the RPNExpr data type, making it a Functor, lifting it into a Free monad, and writing functions for evaluation, parsing, and pretty-printing RPN expressions. 3. By defining the interpreter as a monad, the RPN expressions can be combined in a composable manner while retaining the ability to run,

cel shading as PDF and Python descriptionMarcosLuis32

This document provides an overview of fundamental concepts in Python programming, such as variables, data types, operators, and expressions. It emphasizes the importance of variable naming conventions and the use of comments for better code understanding, while also explaining how to handle user input and perform type conversions. It includes examples of arithmetic operations, variable assignments, and the differences between integers and floating-point numbers.

Go ahead, make my dayTor Ivry

Folding Unfolded - Polyglot FP for Fun and Profit - Haskell and Scala - Part 4Philip Schwarz

The document discusses the concept of folds in functional programming, particularly focusing on right folds and their ability to work with infinite lists. It explains the implementation of functions such as filter and heador using foldr, exploring the nuances of predicate matching and the lazy evaluation characteristics of certain functions. Additionally, it highlights the importance of understanding how the accumulator technique and applicative functions operate in this context.

More Related Content

What's hot (14)

Ch17Abbott

Periodic pattern miningAshis Kumar Chanda

Merge sort algorithmShubham Dwivedi

Python programming for Beginners - IINEEVEE Technologies

Merge sortAbdelrahman Saleh

함수형사고 4장 열심히보다는현명하게박 민규

binary searchAbdelrahman Saleh

Fourier series and transformsPepa Vidosa Serradilla

Rabin karp string matching algorithmGajanand Sharma

Counting sort(Non Comparison Sort)Hossain Md Shakhawat

Asymptote Curve IHirwanto Iwan

2015.3.12 the root of lispChung-Hsiang Ofa Hsueh

Writing Perl 6 Rxlichtkind

New day 8 examplesjchartiersjsd

Ch17Abbott

Periodic pattern miningAshis Kumar Chanda

Merge sort algorithmShubham Dwivedi

Python programming for Beginners - IINEEVEE Technologies

Merge sortAbdelrahman Saleh

함수형사고 4장 열심히보다는현명하게박 민규

binary searchAbdelrahman Saleh

Fourier series and transformsPepa Vidosa Serradilla

Rabin karp string matching algorithmGajanand Sharma

Counting sort(Non Comparison Sort)Hossain Md Shakhawat

Asymptote Curve IHirwanto Iwan

2015.3.12 the root of lispChung-Hsiang Ofa Hsueh

Writing Perl 6 Rxlichtkind

New day 8 examplesjchartiersjsd

Similar to Programming for engineers in python (20)

Infix prefix postfixSelf-Employed

Basic python laboratoty_ PSPP Manual .docxKirubaburi R

Python.pptxAKANSHAMITTAL2K21AFI

Pratt Parser in PythonPercolate

Free Monads Getting StartedKent Ohashi

cel shading as PDF and Python descriptionMarcosLuis32

Go ahead, make my dayTor Ivry

Folding Unfolded - Polyglot FP for Fun and Profit - Haskell and Scala - Part 4Philip Schwarz

Folding Unfolded - Polyglot FP for Fun and Profit - Haskell and Scala - Part ...Philip Schwarz

The document discusses the implementation of functional programming techniques, focusing on folds, particularly right folds, to handle lists including those with infinite elements. It delves into the filter function, explaining how to replace constructors to filter elements based on a predicate, and introduces the heador function that returns the first element of a list or a default value if the list is empty. Key concepts such as lazy evaluation, the applicative functor, and the implications for performance and behavior when working with infinite lists are also explored.

Python intro ch_e_compPaulo Castro

This document discusses using Python to solve chemical engineering problems presented in the book Introduction to Chemical Engineering Computing. It provides Python code to solve examples involving equations of state from Chapters 2, 3, 4, and 8 of the book. The code mirrors the use of MATLAB in the book. Additional Python commands and examples are also summarized that can be used independently of chemical engineering applications.

Matlab differentialpramodkumar1804

The document discusses various methods for computing derivatives and solving differential equations in MATLAB. Some key points: - MATLAB's diff command is used to compute symbolic derivatives of functions. It can find 1st, 2nd and higher order derivatives. - Common rules of differentiation like product rule, quotient rule, chain rule are demonstrated. Derivatives of exponential, logarithmic and trigonometric functions are provided. - Finding critical points/stationary points of a function involves taking the derivative and setting it equal to zero. - The dsolve command can be used to find symbolic solutions to differential equations, including specifying initial/boundary conditions.

Ch2kinnarshah8888

This document provides an overview of building a simple one-pass compiler to generate bytecode for the Java Virtual Machine (JVM). It discusses defining a programming language syntax, developing a parser, implementing syntax-directed translation to generate intermediate code targeting the JVM, and generating Java bytecode. The structure of the compiler includes a lexical analyzer, syntax-directed translator, and code generator to produce JVM bytecode from a grammar and language definition.

datastructure-1 lab manual journals practicalAlameluIyer3

The document is a practical manual for Python programming, covering installation of Python and MySQL connectivity. It includes detailed practical exercises that demonstrate control statements, data structures, functions, file handling, and class concepts in Python. Each practical section provides code examples and expected outcomes for tasks such as creating functions, handling lists and dictionaries, and implementing class inheritance.

The Ring programming language version 1.5.4 book - Part 19 of 185Mahmoud Samir Fayed

Working with functions.pptx. Hb.sabarivelan111007

The document serves as an introduction to Python functions, detailing their purpose, structure, and types such as user-defined, built-in, and lambda functions. It outlines how to define functions with proper syntax, including function arguments and the return statement, while highlighting advantages like code modularity and reusability. Additionally, it covers the flow of function execution, variable scopes, and practical examples for better understanding.

What is Algorithm - An OverviewRamakant Soni

The document provides an introduction to algorithms, including definitions, examples, and applications across various fields such as travel routing, disease curing, and programming. It covers algorithm analysis, including time and space complexity, and details specific algorithms like insertion sort, merge sort, quick sort, linear search, and binary search. Additionally, it discusses asymptotic notations and the master theorem for analyzing divide-and-conquer algorithms.

Python lambda functions with filter, map & reduce functionARVIND PANDE

Lambda functions allow the creation of small anonymous functions and can be passed as arguments to other functions. The map() function applies a lambda function to each element of a list and returns a new list. The filter() function filters a list based on the return value of a lambda function. The reduce() function iteratively applies a lambda function to consecutive pairs in a list and returns a single value. User-defined functions in Python can perform tasks like converting between temperature scales, finding max/min/average of lists, generating Fibonacci series, reversing strings, summing digits in numbers, and calculating powers using recursion.

Python for Scientific ComputingAlbert DeFusco

The document provides an overview of Python programming for scientific computing, covering essential concepts such as syntax, data structures, and object-oriented programming. It highlights the advantages of Python, including its simplicity, portability, and extensive libraries for scientific applications. Additionally, it includes examples of Python functions, structures, and programming exercises to illustrate key concepts effectively.

Introduction to functional programming using Ocamlpramode_ce

The document provides an introduction to functional programming concepts using Ocaml as the teaching language. It outlines the workshop plan which will cover Ocaml syntax, important functional programming concepts, and understanding the functional paradigm through Ocaml. It then discusses Ocaml background, where Ocaml is used, the Ocaml REPL, function definition, type inference, recursion, tail calls and TCO, higher order functions, algebraic data types, pattern matching, immutability, and more.

Mcq cpuptahir_ali786

Infix prefix postfixSelf-Employed

Basic python laboratoty_ PSPP Manual .docxKirubaburi R

Python.pptxAKANSHAMITTAL2K21AFI

Pratt Parser in PythonPercolate

Free Monads Getting StartedKent Ohashi

cel shading as PDF and Python descriptionMarcosLuis32

Go ahead, make my dayTor Ivry

Folding Unfolded - Polyglot FP for Fun and Profit - Haskell and Scala - Part 4Philip Schwarz

Folding Unfolded - Polyglot FP for Fun and Profit - Haskell and Scala - Part ...Philip Schwarz

Python intro ch_e_compPaulo Castro

Matlab differentialpramodkumar1804

Ch2kinnarshah8888

datastructure-1 lab manual journals practicalAlameluIyer3

The Ring programming language version 1.5.4 book - Part 19 of 185Mahmoud Samir Fayed

Working with functions.pptx. Hb.sabarivelan111007

What is Algorithm - An OverviewRamakant Soni

Python lambda functions with filter, map & reduce functionARVIND PANDE

Python for Scientific ComputingAlbert DeFusco

Introduction to functional programming using Ocamlpramode_ce

Mcq cpuptahir_ali786

More from Hoang Nguyen (20)

Rest api to integrate with your siteHoang Nguyen

This document discusses Easyrec, an open source recommender engine that provides recommendations based on user actions like views, purchases, and ratings of products. It has an API that allows integrating recommendations into a website by passing a user ID and token. The API can take in user data and return recommendations based on what other similar users viewed, purchased, or rated highly. While Easyrec is easy to use, it has limitations in flexibility and only supports collaborative filtering recommendations.

How to build a rest apiHoang Nguyen

This document outlines an agenda to introduce REST and building APIs with ASP.NET Web API. It begins with a quick demo, then discusses what REST is as an architectural style based on HTTP using resources and verbs. It covers HTTP concepts like requests, responses and status codes. Finally, it demonstrates building a REST API with ASP.NET Web API and discusses advantages of REST like using the well-defined HTTP protocol and enabling caching.

Api crashHoang Nguyen

This document provides an overview of APIs, including what they are, why they are useful, common data formats like JSON and XML, RESTful API design principles, and how to consume and create APIs. It discusses API concepts like resources, HTTP verbs, caching, authentication, and error handling. It also provides examples of consuming APIs with tools like Postman and creating a simple API in Node.js.

Smm and cachingHoang Nguyen

This document discusses caching and the SMRR mechanism introduced by Intel to prevent cache poisoning attacks on SMRAM. It explains that: 1) Memory caching types like write-back can allow data in CPU caches to be modified without writing to physical memory. 2) Early researchers exploited this to poison SMRAM caches and gain unauthorized access to protected memory. 3) Intel addressed this with the System Management Range Register (SMRR) that defines a restricted memory range for SMRAM and prevents caching of that memory when not in SMM.

Optimizing shared caches in chip multiprocessorsHoang Nguyen

Chip multiprocessors, which place multiple processors on a single chip, have become common in modern processors. There are various approaches to managing caches in chip multiprocessors, including private caches for each processor core or shared caches that all cores can access. The optimal approach balances factors like minimizing traffic between cores, avoiding duplication of cached data, and reducing latency.

How analysis services caching worksHoang Nguyen

This document discusses how Analysis Services caching works and provides strategies for warming the Storage Engine cache and Formula Engine cache. It explains that the Storage Engine handles data retrieval from disk while the Formula Engine determines which data is needed for queries. Caching can improve performance but requires understanding when Analysis Services is unable to cache data. The document recommends using the CREATE CACHE statement and running regular queries to pre-populate the caches with commonly used data. Memory usage must also be considered when warming the caches.

Hardware managed cacheHoang Nguyen

The document proposes optimizing DRAM caches for latency rather than hit rate. It summarizes previous work on DRAM caches like Loh-Hill Cache that treated DRAM cache similarly to SRAM cache. This led to high latency and low bandwidth utilization. The document introduces the Alloy Cache design which avoids tag serialization and keeps tags and data in the same DRAM row for lower latency. It also proposes a Memory Access Predictor to selectively use parallel or serial access models for the lowest latency. Simulation results show Alloy Cache with a predictor outperforms previous designs like SRAM-Tags. The design achieves most of the potential latency benefits with a simple approach.

Directory based cache coherenceHoang Nguyen

The document discusses non-uniform cache architectures (NUCA), cache coherence, and different implementations of directories in multicore systems. It describes NUCA designs that map data to banks based on distance from the controller to exploit non-uniform access times. Cache coherence is maintained using directory-based protocols that track copies of cache blocks. Directories can be implemented off-chip in DRAM or on-chip using duplicate tag stores or distributing the directory among cache banks. Examples of systems like SGI Origin2000 and Tilera Tile64 that use these techniques are also outlined.

Cache recapHoang Nguyen

The document discusses memory hierarchy and caching techniques. It begins by explaining the need for a memory hierarchy due to differing access times of memory technologies like SRAM, DRAM, and disk. It then covers concepts like cache hits, misses, block size, direct mapping, set associativity, compulsory misses, capacity misses, and conflict misses. Finally, it discusses using a second-level cache to reduce memory access times by capturing misses from the first-level cache.

Python your new best friendHoang Nguyen

This document provides an introduction to Python programming for astronomers. It discusses: - Setting up the Python environment and selecting the correct version (2.6/2.7 vs 3.x) - Why Python is popular for astronomy (free, packages like CASA are in Python) - Getting started with Python scripts and the Python interpreter - Important syntax aspects like indentation, importing modules, and creating functions - Examples of useful Python modules for astronomy like NumPy, SciPy, Matplotlib, and Astropy

Python language data typesHoang Nguyen

This document provides an introduction to the Python language and discusses Python data types. It covers how to install Python, interact with the Python interpreter through command line and IDLE modes, and learn basic Python parts like data types, operators, functions, and control structures. The document discusses numeric, string, and other data types in Python and how to manipulate them using built-in functions and operators. It also introduces Python library modules and the arcpy package for geoprocessing in ArcGIS.

Python basicsHoang Nguyen

A program is a sequence of instructions that are run by the processor. To run a program, it must be compiled into binary code and given to the operating system. The OS then gives the code to the processor to execute. Functions allow code to be reused by defining operations and optionally returning values. Strings are sequences of characters that can be manipulated using indexes and methods. Common string methods include upper() and concatenation using +.

Learning pythonHoang Nguyen

Extending burp with pythonHoang Nguyen

1. Burp extensions can overcome web application hurdles through the Burp API. Interfaces like IMessageEditorTab and ITab allow creating new views of requests and responses, while processHTTPMessage and doPassiveScan can automate tasks by catching and rewriting traffic. 2. Examples include decoding custom encodings, signing requests, viewing unique response headers, and passively scanning for encoded values in cookies. Common problems are solved with minimal Python coding against the Burp API.

Cobol, lisp, and pythonHoang Nguyen

The document provides information on three programming languages: COBOL, LISP, and Python. COBOL was released in 1959 and was used for 80% of business transactions due to its reliability. LISP was the second high-level language created in 1958 and introduced innovations like garbage collection and recursion using linked lists. Python was developed in the 1990s and prioritizes readability through features like whitespace and a simple grammar.

Object oriented programming using c++Hoang Nguyen

Object-oriented programming uses abstraction and encapsulation through abstract data types (ADTs). An ADT defines a data type and its interface independently of its implementation. This allows information hiding and modular program design. Common languages like C++, Java, and Ruby support ADTs through classes or modules, which package data with methods, support inheritance and polymorphism, and provide visibility control through private/public access specifiers. Parameterized ADTs allow a data type to work with different element types. Namespaces and packages provide separate scopes to avoid naming conflicts.

Object oriented analysisHoang Nguyen

Object-oriented analysis and design (OOAD) emphasizes investigating requirements rather than solutions, and conceptual solutions that fulfill requirements rather than implementations. OOAD focuses on identifying domain concepts and defining software objects and how they collaborate. The unified process model includes inception, elaboration, construction, and transition phases with iterations and milestones leading to final product releases. Main OO concepts are encapsulation, abstraction, inheritance, and polymorphism.

Object modelHoang Nguyen

The document discusses the key elements of the object model, including abstraction, encapsulation, modularity, and hierarchy. It explains that abstraction is one of the fundamental ways to cope with complexity in software design. Abstraction focuses on the essential characteristics of an object that distinguish it from other objects, from the perspective of the viewer. The object model provides a conceptual framework for object-oriented programming that is based on these elements.

Data structures and algorithmsHoang Nguyen

The document discusses abstract data types (ADTs), specifically queues. It defines a queue as a linear collection where elements are added to one end and removed from the other end, following a first-in, first-out (FIFO) approach. The key queue operations are enqueue, which adds an element, and dequeue, which removes the element that has been in the queue longest. Queues can be implemented using arrays or linked lists.

Data abstraction the wallsHoang Nguyen

The document discusses abstract data types (ADTs) and their implementation in C++. It describes how ADTs use encapsulation, inheritance and polymorphism to separate a data structure from its implementation. This allows operations on a data type to be defined independently of how its data is stored. The document also covers how C++ classes can be used to implement ADTs by bundling related data and functions into objects that hide their underlying representations. Exceptions are discussed as a mechanism for handling errors during program execution.

Rest api to integrate with your siteHoang Nguyen

How to build a rest apiHoang Nguyen

Api crashHoang Nguyen

Smm and cachingHoang Nguyen

Optimizing shared caches in chip multiprocessorsHoang Nguyen

How analysis services caching worksHoang Nguyen

Hardware managed cacheHoang Nguyen

Directory based cache coherenceHoang Nguyen

Cache recapHoang Nguyen

Python your new best friendHoang Nguyen

Python language data typesHoang Nguyen

Python basicsHoang Nguyen

Learning pythonHoang Nguyen

Extending burp with pythonHoang Nguyen

Cobol, lisp, and pythonHoang Nguyen

Object oriented programming using c++Hoang Nguyen

Object oriented analysisHoang Nguyen

Object modelHoang Nguyen

Data structures and algorithmsHoang Nguyen

Data abstraction the wallsHoang Nguyen

Recently uploaded (20)

Crypto Super 500 - 14th Report - June2025.pdfStephen Perrenod

This OrionX's 14th semi-annual report on the state of the cryptocurrency mining market. The report focuses on Proof-of-Work cryptocurrencies since those use substantial supercomputer power to mint new coins and encode transactions on their blockchains. Only two make the cut this time, Bitcoin with $18 billion of annual economic value produced and Dogecoin with $1 billion. Bitcoin has now reached the Zettascale with typical hash rates of 0.9 Zettahashes per second. Bitcoin is powered by the world's largest decentralized supercomputer in a continuous winner take all lottery incentive network.

MuleSoft for AgentForce : Topic Center and API Catalogshyamraj55

This presentation dives into how MuleSoft empowers AgentForce with organized API discovery and streamlined integration using Topic Center and the API Catalog. Learn how these tools help structure APIs around business needs, improve reusability, and simplify collaboration across teams. Ideal for developers, architects, and business stakeholders looking to build a connected and scalable API ecosystem within AgentForce.

Artificial Intelligence in the Nonprofit Boardroom.pdfOnBoard

FIDO Seminar: Targeting Trust: The Future of Identity in the Workforce.pptxFIDO Alliance

FME for Distribution & Transmission Integrity Management Program (DIMP & TIMP)Safe Software

Peoples Gas in Chicago, IL has changed to a new Distribution & Transmission Integrity Management Program (DIMP & TIMP) software provider in recent years. In order to successfully deploy the new software we have created a series of ETL processes using FME Form to transform our gas facility data to meet the required DIMP & TIMP data specifications. This presentation will provide an overview of how we used FME to transform data from ESRI’s Utility Network and several other internal and external sources to meet the strict data specifications for the DIMP and TIMP software solutions.

Securing Account Lifecycles in the Age of Deepfakes.pptxFIDO Alliance

“Addressing Evolving AI Model Challenges Through Memory and Storage,” a Prese...Edge AI and Vision Alliance

For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2025/06/addressing-evolving-ai-model-challenges-through-memory-and-storage-a-presentation-from-micron/ Wil Florentino, Senior Segment Marketing Manager at Micron, presents the “Addressing Evolving AI Model Challenges Through Memory and Storage” tutorial at the May 2025 Embedded Vision Summit. In the fast-changing world of artificial intelligence, the industry is deploying more AI compute at the edge. But the growing diversity and data footprint of transformers and models such as large language models and large multimodal models puts a spotlight on memory performance and data storage capacity as key bottlenecks. Enabling the full potential of AI in industries such as manufacturing, automotive, robotics and transportation will require us to find efficient ways to deploy this new generation of complex models. In this presentation, Florentino explores how memory and storage are responding to this need and solving complex issues in the AI market. He examines the storage capacity and memory bandwidth requirements of edge AI use cases ranging from tiny devices with severe cost and power constraints to edge servers, and he explains how new memory technologies such as LPDDR5, LPCAMM2 and multi-port SSDs are helping system developers to meet these challenges.

Security Tips for Enterprise Azure SolutionsMichele Leroux Bustamante

Delivering solutions to Azure may involve a variety of architecture patterns involving your applications, APIs data and associated Azure resources that comprise the solution. This session will use reference architectures to illustrate the security considerations to protect your Azure resources and data, how to achieve Zero Trust, and why it matters. Topics covered will include specific security recommendations for types Azure resources and related network security practices. The goal is to give you a breadth of understanding as to typical security requirements to meet compliance and security controls in an enterprise solution.

“From Enterprise to Makers: Driving Vision AI Innovation at the Extreme Edge,...Edge AI and Vision Alliance

For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2025/06/from-enterprise-to-makers-driving-vision-ai-innovation-at-the-extreme-edge-a-presentation-from-sony-semiconductor-solutions/ Amir Servi, Edge Deep Learning Product Manager at Sony Semiconductor Solutions, presents the “From Enterprise to Makers: Driving Vision AI Innovation at the Extreme Edge” tutorial at the May 2025 Embedded Vision Summit. Sony’s unique integrated sensor-processor technology is enabling ultra-efficient intelligence directly at the image source, transforming vision AI for enterprises and developers alike. In this presentation, Servi showcases how the AITRIOS platform simplifies vision AI for enterprises with tools for large-scale deployments and model management. Servi also highlights his company’s collaboration with Ultralytics and Raspberry Pi, which brings YOLO models to the developer community, empowering grassroots innovation. Whether you’re scaling vision AI for industry or experimenting with cutting-edge tools, this presentation will demonstrate how Sony is accelerating high-performance, energy-efficient vision AI for all.

AI vs Human Writing: Can You Tell the Difference?Shashi Sathyanarayana, Ph.D

FIDO Seminar: Authentication for a Billion Consumers - Amazon.pptxFIDO Alliance

“Why It’s Critical to Have an Integrated Development Methodology for Edge AI,...Edge AI and Vision Alliance

For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2025/06/why-its-critical-to-have-an-integrated-development-methodology-for-edge-ai-a-presentation-from-lattice-semiconductor/ Sreepada Hegade, Director of ML Systems and Software at Lattice Semiconductor, presents the “Why It’s Critical to Have an Integrated Development Methodology for Edge AI” tutorial at the May 2025 Embedded Vision Summit. The deployment of neural networks near sensors brings well-known advantages such as lower latency, privacy and reduced overall system cost—but also brings significant challenges that complicate development. These challenges can be addressed effectively by choosing the right solution and design methodology. The low-power FPGAs from Lattice are well poised to enable efficient edge implementation of models, while Lattice’s proven development methodology helps to mitigate the challenges and risks associated with edge model deployment. In this presentation, Hegade explains the importance of an integrated framework that tightly consolidates different aspects of edge AI development, including training, quantization of networks for edge deployment, integration with sensors and inferencing. He also illustrates how Lattice’s simplified tool flow helps to achieve the best trade-off between power, performance and efficiency using low-power FPGAs for edge deployment of various AI workloads.

Bridging the divide: A conversation on tariffs today in the book industry - T...BookNet Canada

A collaboration-focused conversation on the recently imposed US and Canadian tariffs where speakers shared insights into the current legislative landscape, ongoing advocacy efforts, and recommended next steps. This event was presented in partnership with the Book Industry Study Group. Link to accompanying resource: https://bnctechforum.ca/sessions/bridging-the-divide-a-conversation-on-tariffs-today-in-the-book-industry/ Presented by BookNet Canada and the Book Industry Study Group on May 29, 2025 with support from the Department of Canadian Heritage.

OpenACC and Open Hackathons Monthly Highlights June 2025OpenACC

The OpenACC organization focuses on enhancing parallel computing skills and advancing interoperability in scientific applications through hackathons and training. The upcoming 2025 Open Accelerated Computing Summit (OACS) aims to explore the convergence of AI and HPC in scientific computing and foster knowledge sharing. This year's OACS welcomes talk submissions from a variety of topics, from Using Standard Language Parallelism to Computer Vision Applications. The document also highlights several open hackathons, a call to apply for NVIDIA Academic Grant Program and resources for optimizing scientific applications using OpenACC directives.

TrustArc Webinar - 2025 Global Privacy SurveyTrustArc

How does your privacy program compare to your peers? What challenges are privacy teams tackling and prioritizing in 2025? In the sixth annual Global Privacy Benchmarks Survey, we asked global privacy professionals and business executives to share their perspectives on privacy inside and outside their organizations. The annual report provides a 360-degree view of various industries' priorities, attitudes, and trends. See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe. This webinar features an expert panel discussion and data-driven insights to help you navigate the shifting privacy landscape. Whether you are a privacy officer, legal professional, compliance specialist, or security expert, this session will provide actionable takeaways to strengthen your privacy strategy. This webinar will review: - The emerging trends in data protection, compliance, and risk - The top challenges for privacy leaders, practitioners, and organizations in 2025 - The impact of evolving regulations and the crossroads with new technology, like AI Predictions for the future of privacy in 2025 and beyond

AI VIDEO MAGAZINE - June 2025 - r/aivideo1pcity Studios, Inc

Providing an OGC API Processes REST Interface for FME FlowSafe Software

This presentation will showcase an adapter for FME Flow that provides REST endpoints for FME Workspaces following the OGC API Processes specification. The implementation delivers robust, user-friendly API endpoints, including standardized methods for parameter provision. Additionally, it enhances security and user management by supporting OAuth2 authentication. Join us to discover how these advancements can elevate your enterprise integration workflows and ensure seamless, secure interactions with FME Flow.

Floods in Valencia: Two FME-Powered Stories of Data ResilienceSafe Software

In October 2024, the Spanish region of Valencia faced severe flooding that underscored the critical need for accessible and actionable data. This presentation will explore two innovative use cases where FME facilitated data integration and availability during the crisis. The first case demonstrates how FME was used to process and convert satellite imagery and other geospatial data into formats tailored for rapid analysis by emergency teams. The second case delves into making human mobility data—collected from mobile phone signals—accessible as source-destination matrices, offering key insights into population movements during and after the flooding. These stories highlight how FME's powerful capabilities can bridge the gap between raw data and decision-making, fostering resilience and preparedness in the face of natural disasters. Attendees will gain practical insights into how FME can support crisis management and urban planning in a changing climate.

FIDO Alliance Seminar State of Passkeys.pptxFIDO Alliance

No-Code Workflows for CAD & 3D Data: Scaling AI-Driven InfrastructureSafe Software

When projects depend on fast, reliable spatial data, every minute counts. AI Clearing needed a faster way to handle complex spatial data from drone surveys, CAD designs and 3D project models across construction sites. With FME Form, they built no-code workflows to clean, convert, integrate, and validate dozens of data formats – cutting analysis time from 5 hours to just 30 minutes. Join us, our partner Globema, and customer AI Clearing to see how they: -Automate processing of 2D, 3D, drone, spatial, and non-spatial data -Analyze construction progress 10x faster and with fewer errors -Handle diverse formats like DWG, KML, SHP, and PDF with ease -Scale their workflows for international projects in solar, roads, and pipelines If you work with complex data, join us to learn how to optimize your own processes and transform your results with FME.

Crypto Super 500 - 14th Report - June2025.pdfStephen Perrenod

MuleSoft for AgentForce : Topic Center and API Catalogshyamraj55

Artificial Intelligence in the Nonprofit Boardroom.pdfOnBoard

FIDO Seminar: Targeting Trust: The Future of Identity in the Workforce.pptxFIDO Alliance

FME for Distribution & Transmission Integrity Management Program (DIMP & TIMP)Safe Software

Securing Account Lifecycles in the Age of Deepfakes.pptxFIDO Alliance

“Addressing Evolving AI Model Challenges Through Memory and Storage,” a Prese...Edge AI and Vision Alliance

Security Tips for Enterprise Azure SolutionsMichele Leroux Bustamante

“From Enterprise to Makers: Driving Vision AI Innovation at the Extreme Edge,...Edge AI and Vision Alliance

AI vs Human Writing: Can You Tell the Difference?Shashi Sathyanarayana, Ph.D

FIDO Seminar: Authentication for a Billion Consumers - Amazon.pptxFIDO Alliance

“Why It’s Critical to Have an Integrated Development Methodology for Edge AI,...Edge AI and Vision Alliance

Bridging the divide: A conversation on tariffs today in the book industry - T...BookNet Canada

OpenACC and Open Hackathons Monthly Highlights June 2025OpenACC

TrustArc Webinar - 2025 Global Privacy SurveyTrustArc

AI VIDEO MAGAZINE - June 2025 - r/aivideo1pcity Studios, Inc

Providing an OGC API Processes REST Interface for FME FlowSafe Software

Floods in Valencia: Two FME-Powered Stories of Data ResilienceSafe Software

FIDO Alliance Seminar State of Passkeys.pptxFIDO Alliance

No-Code Workflows for CAD & 3D Data: Scaling AI-Driven InfrastructureSafe Software

Programming for engineers in python

1. Recitation 4 Programming for Engineers in Python

2. Agenda  Sample problems  Hash functions & dictionaries (or next week)  Car simulation 2

3. A function can be an argument 3 def do_twice(f): f() f() def print_spam(): print 'spam' >>> do_twice(print_spam) spam spam

4. Fermat’s last theorem 4  Fermat’s famous theorem claims that for any n>2, there are no three positive integers a, b, and c such that: 𝑎 𝑛 + 𝑏 𝑛 = 𝑐 𝑛  Let’s check it! def check_fermat(a,b,c,n): if n>2 and a**n + b**n == c**n: print "Fermat was wrong!" else: print "No, that doesn't work" Pierre de Fermat 1601-1665

5. Fermat’s last theorem 5 >>> check_fermat(3,4,5,2) No, that doesn't work >>> check_fermat(3,4,5,3) No, that doesn't work  Dirty shortcut since 1995: def check_fermat(a,b,c,n): print "Wiles proved it doesn’t work" Sir Andrew John Wiles 1953-

6. Cumulative sum 6  For a given list A we will return a list B such that B[n] = A[0]+A[1]+…A[n]  Take 1: def cumulative_sum(lst): summ = [ lst[0] ] * len(lst) for i in range(1, len(lst)): summ[i] = summ[i-1] + lst[i] return summ  Take 2: def cumulative_sum(lst): return [sum(lst[0:n]) for n in range(1, len(lst)+1)]

7. Estimating e by it’s Taylor expansion 7 from math import factorial, e term = 1 summ = 0 k = 0 while term > 1e-15: term = 1.0/factorial(k) summ += term k += 1 print "Python e:", e print “Taylor’s e:", summ print “Iterations:”, k 𝑒 = 𝑘=0 ∞ 1 𝑘! = 2 + 1 2 + 1 6 + 1 24 + ⋯ Brook Taylor, 1685-1731

8. Estimating π by the Basel problem 8 from math import factorial, pi, sqrt term = 1 summ = 0 k = 1 while term > 1e-15: term = 1.0/k**2 summ += term k += 1 summ = sqrt(summ*6.0) print "Python pi:", pi print “Euler’s pi:", summ print “Iterations:”, k 𝜋2 6 = 𝑘=1 ∞ 1 𝑘2 = 1 + 1 4 + 1 9 + 1 16 + ⋯ Leonard Euler, 1707-1783

9. Ramanujan’s π estimation (optional) 9 from math import factorial, pi term = 1 summ = 0 k = 0 while term > 1e-15: term = factorial(4.0*k) / factorial(k)**4.0 term *= (1103.0+26390.0*k) / 396.0**(4.0*k) summ += term k += 1 summ = 1.0/(summ * 2.0*2.0**0.5 / 9801.0) print "Python Pi:", pi print "Ramanujan Pi:", summ print “Iterations:”, k Srinivasa Ramanujan, 1887-1920

10. Triple Double Word 10  We want to find a word that has three double letters in it, like aabbcc (which is not a word!)  Almost qualifiers:  Committee  Mississippi  Write a function to check if a word qualifies  Write a function that reads a text file and checks all the words  Code: http://www.greenteapress.com/thinkpython/code/carta lk.py  Corpus: http://www.csie.ntu.edu.tw/~pangfeng/Fortran%20exa mples/words.txt

11. PyGame 11  A set of Python modules designed for writing computer games  Download & install: http://pygame.org/ftp/pygame-1.9.2a0.win32- py2.7.msi

12. Car game 12  Control a car moving on the screen  YouTube demo: http://www.youtube.com/watch?v=DMOj3HpjemE  Code: https://gist.github.com/1372753 or in car.py  Car controlled by arrows  Honk with Enter  Exit with ESC

13. ToDo List: 13  Fix stirring problem  Honk by pressing space  Car will go from the bottom to top and from one side to the other (instead of getting stuck)  Switch to turtle!

14. 2 players car game 14  Collision avoidance simulator:  When the cars are too close one of them honks  Players need to maneuver the cars to avoid honks  Code: https://gist.github.com/1380291 or cars.py  Red car controlled by arrows  Blue car controlled by z, x, c, s

Programming for engineers in python

Recommended

More Related Content

What's hot (14)

Similar to Programming for engineers in python (20)

More from Hoang Nguyen (20)

Recently uploaded (20)

Programming for engineers in python