U.S. News & World Report has released their ranking of 100 best jobs for 2015. Beginning with the occupations that the U.S. Department of Labor Bureau of Labor Statistics predicts will grow the most between 2012 and 2022, the list ranks jobs in a variety of industries based on projected openings, rate of growth, job prospects, unemployment rates, salary, and job satisfaction.
Given the huge demand for highly-trained computer experts and engineers, secondary education is already trending towards a marked increase in computing classes. Now, Congress is considering a bill to help close the skills gap and strengthen our national competitiveness. The bill, currently in the House of Representatives, is the Computer Science Education Act (HR 2536).
Topics: Association for Computing Machinery, Computer Science, Computer Science Education, Computer Science Education, Computer Science Education Act, Computer Science Teachers Association, Congress, CSTA, Early Education, Foundations, House of Representatives, Introduction to Computer Science, Jared Polis, Secondary Education, Susan Brooks
Mercurynews.com reported that, much like the rest of the country, the San Francisco Bay Area needs help motivating young people to take an interest in computer science and technology. According to the nonprofit Code.org, there will be a shortage of 1 million trained computer scientists in the next decade. Yet, only 10 percent of U.S. high schools offer classes in programming.
Written in an incredibly accessible format, Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity, with numerous examples throughout.
This volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.
To help students better understand complex algorithms, the authors use C++ and Java pseudocode, as students are familiar with these languages from their intro programming and data structures courses. Furthermore, students are not required to have a calculus background. College algebra and discrete structures are the prerequisites for the text. The authors, both professors at Northeastern Illinois University, have included a chapter on numerical algorithms with a review of basic number theory, Euclid's Algorithm for finding the greatest common divisor, a review of modular arithmetic, an algorithm for solving modular linear equations, an algorithm for computing modular powers, and the new polynomial-time algorithm for determining whether a number is prime.