Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Ruby on rails - Ruby Basics by Emad Elsaid 551 views
- Ruby on rails3 - introduction to rails by Emad Elsaid 729 views
- GenPORT_RS2_AcademicCareerV1_23DEC2015 by Rachel Palmen 50 views
- Roles & Responsibilities Chart by Maria J. Burt 335 views
- Education Center Proposal by Maria J. Burt 976 views
- Mercy Spirituality by Maria J. Burt 1796 views

- 1. Modern web development
- 2. Emad Elsaid Education Work Experience @blaz_boy www.pixelwa.re www.madeinportsaid.com
- 3. Ruby Rails HAML SASS
- 4. Yukihiro Matsumoto (Matz) First paper 1993 Ruby 1.0 (Dec 1996) Latest 1.9.3 Ruby 2.0 (24 Feb 2013) Gem www.ruby-lang.org
- 5. David Heinmemeier Hansson 37 Signals Basecamp , Campfire, Highrise Rework www.rubyonrails.org
- 6. Norman Clarke HTML (HTML Abstraction Markup Language) Why? Markup should be beautiful DRY Markup should be well-indented XHTML structure should be clear www.haml.info
- 7. Hampton Catlin SASS (Syntactically Awesome Stylesheets) Why? nested rules Variables Mixins selector inheritance www.sass-lang.com
- 8. Form Teams We’ll create a blog Choose features to add Show results to your friends
- 9. Ruby Installer SublimeText2
- 10. Puts “Hello World” Save Run for your life
- 11. Ifwe list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.
- 12. sum =0 for i in 1...1000 do if (i%3==0 or i%5==0) sum += i end end puts sum
- 13. By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10 001st prime number?
- 14. require mathn counter =0 last = nil Prime.each(100000000000) do |i| counter += 1 last = i break if counter==10001 end print last
- 15. Watch this http://net.tutsplus.com/sessions/ruby-for- newbies/ Solve this : http://projecteuler.net/problem=2 http://projecteuler.net/problem=13
- 16. Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
- 17. Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. 371072875339021027987979982208375902465 10135740250 463…………….124896970078050417018260538 743249861995247410594742333095130581237 26617309629

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment