1. What are some of the pieces of the poverty puzzle?  Healthcare  Education  Livelihood (esp. agriculture)  What issues do you think are the most.

Slides:



Advertisements
Similar presentations
Sorting algorithms Sieve of Eratosthenes
Advertisements

For(int i = 1; i
Back to Sorting – More efficient sorting algorithms.
Garfield AP Computer Science
Analysis of Algorithms CS Data Structures Section 2.6.
Session 3 Algorithm. Algorithm Algorithm is a set of steps that are performed to solve a problem. The example below describes an algorithm Example Check.
HST 952 Computing for Biomedical Scientists Lecture 9.
Recursion. Idea: Some problems can be broken down into smaller versions of the same problem Example: n! 1*2*3*…*(n-1)*n n*factorial of (n-1)
©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11: Sorting and Searching  Searching Linear Binary  Sorting.
CS 206 Introduction to Computer Science II 10 / 14 / 2009 Instructor: Michael Eckmann.
Csci1300 Introduction to Programming Recursion Dan Feng.
S: Application of quicksort on an array of ints: partitioning.
Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Starting Out with C++: Early Objects 5 th Edition Chapter 14 Recursion.
Презентація за розділом “Гумористичні твори”
Центр атестації педагогічних працівників 2014
Галактики і квазари.
Характеристика ІНДІЇ.
Процюк Н.В. вчитель початкових класів Боярської ЗОШ І – ІІІ ст №4
Arrays.
1 © 2006 Pearson Addison-Wesley. All rights reserved Searching and Sorting Linear Search Binary Search -Reading p
1.7 Arrays academy.zariba.com 1. Lecture Content 1.Basic Operations with Arrays 2.Console Input & Output of Arrays 3.Iterating Over Arrays 4.List 5.Cloning.
ALGORITHM ANALYSIS AND DESIGN INTRODUCTION TO ALGORITHMS CS 413 Divide and Conquer Algortihms: Binary search, merge sort.
1 Object-Oriented Programming Using C++ CLASS 2. 2 Linear Recursion Summing the Elements of an Array Recursively Algorithm LinearSum(A, n): Input: An.
Types for Programs and Proofs Lecture 1. What are types? int, float, char, …, arrays types of procedures, functions, references, records, objects,...
David Streader Computer Science Victoria University of Wellington Copyright: David Streader, Victoria University of Wellington Java Arrays and ArrayLists.
Information and Computer Sciences University of Hawaii, Manoa
SEARCHING UNIT II. Divide and Conquer The most well known algorithm design strategy: 1. Divide instance of problem into two or more smaller instances.
1 Searching and Sorting Linear Search Binary Search.
Topic 25 - more array algorithms 1 "To excel in Java, or any computer language, you want to build skill in both the "large" and "small". By "large" I mean.
ES 314 Advanced Programming Instructors: B. Ravikumar J. Agrawal A.Kojoory Department of Engg Science.
Bucket & Radix Sorts. Efficient Sorts QuickSort : O(nlogn) – O(n 2 ) MergeSort : O(nlogn) Coincidence?
Recursion Review: A recursive function calls itself, but with a smaller problem – at least one of the parameters must decrease. The function uses the results.
Духовні символи Голосіївського району
1. Extreme poverty is one of the great challenges facing the world  What are some of the pieces of the poverty puzzle? 2.
WSNA Vs. RFID Ramin-Bakhshi Student No: Supervisor:Reza-Abrishambaf.
Tim Roughgarden Introduction Merge Sort (Analysis ) Design and Analysis of Algorithms I.
Foundations of Data Structures Practical Session #12 Linear Sorting.
1.1 Data Structure and Algorithm Lecture 1 Array Record Sequential Search Binary Search Bubble Sort Recursion Complexity Topics.
Int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion.
Sorting Arrays ANSI-C. Selection Sort Assume want to sort a table of integers, of size length, in increasing order. Sketch of algorithm: –Find position.
Lecture #3 Analysis of Recursive Algorithms
Data Deluge Challenges and Opportunities Vipin Kumar University of Minnesota Infosys Aurora – August 2011.
Data Structure and Algorithms (DDA 1224) Week 1 Introduction to data structures.
2-Digit Subtraction.
كلية المجتمع الخرج البرمجة - المستوى الثاني
Проф. д-р Васил Цанов, Институт за икономически изследвания при БАН
ЗУТ ПРОЕКТ на Закон за изменение и допълнение на ЗУТ
О Б Щ И Н А С И Л И С Т Р А П р о е к т Б ю д ж е т г.
Електронни услуги на НАП
Боряна Георгиева – директор на
РАЙОНЕН СЪД - БУРГАС РАБОТНА СРЕЩА СЪС СЪДЕБНИТЕ ЗАСЕДАТЕЛИ ПРИ РАЙОНЕН СЪД – БУРГАС 21 ОКТОМВРИ 2016 г.
Сътрудничество между полицията и другите специалисти в България
Съобщение Ръководството на НУ “Христо Ботев“ – гр. Елин Пелин
НАЦИОНАЛНА АГЕНЦИЯ ЗА ПРИХОДИТЕ
ДОБРОВОЛЕН РЕЗЕРВ НА ВЪОРЪЖЕНИТЕ СИЛИ НА РЕПУБЛИКА БЪЛГАРИЯ
Съвременни софтуерни решения
ПО ПЧЕЛАРСТВО ЗА ТРИГОДИШНИЯ
от проучване на общественото мнение,
Васил Големански Ноември, 2006
Програма за развитие на селските райони
ОПЕРАТИВНА ПРОГРАМА “АДМИНИСТРАТИВЕН КАПАЦИТЕТ”
БАЛИСТИКА НА ТЯЛО ПРИ СВОБОДНО ПАДАНЕ В ЗЕМНАТА АТМОСФЕРА
МЕДИЦИНСКИ УНИВЕРСИТЕТ – ПЛЕВЕН
Стратегия за развитие на клъстера 2015
Моето наследствено призвание
Правна кантора “Джингов, Гугински, Кючуков & Величков”
Безопасност на движението
Running Time Exercises
Design and Analysis of Algorithms. Presentation Topic Divide & Conquer Paradigm to design/develop algorithms.
Presentation transcript:

1

What are some of the pieces of the poverty puzzle?  Healthcare  Education  Livelihood (esp. agriculture)  What issues do you think are the most important? 2

Do you think technology is a useful tool for these issues? 3

Where can technology help?  Healthcare  Education  Livelihood (esp. agriculture) 4

Any other ICTD projects you know of? 5

What are some roadblocks that ICTD projects run into? 6

Medical projects  Midwife’s ultrasound $1000-$3500 vs $7000-$9000 OR $  E-IMCI  FoneAstra 7

FoneAstra  Cold chain monitoring 8

Education projects  OLPC One Laptop Per Child  Digital StudyHall  Multimouse 9

DSH vs OLPC  What do you think? 10

Livelihood  Kerala Fisheries  Digital Green Main subject of my work 11

Activity  Write a function that takes in an array of integers and sorts it (without using the sort function in Algorithms)  Hint: start by making a function that returns the index of the minimum value in the array  int min(int arr[], int start, int end)  Between indicies start and end  Can you make a recursive one?  Note, there are MANY ways to solve this problem 12

Data Collection and reporting  Not exciting, but widely applicable  Data collection: Open Data Kit Medicine, esp. tracking HIV-positive patients Environmental surveying Fraud monitoring elections 13

Networking  WildNet  Daknet 14