Jones & Bartlett Learning Computer Science Blog

    Customizing Your Computer Science Curriculum Content is Now Easier Than Ever with Jones & Bartlett Learning PUBLISH

    Posted by admin on May 14, 2012 12:46:47 PM

    Perhaps you are covering JavaScript in your introduction to computer science course but you do not need an entire textbook. Or maybe you want to include a lesson on cyberethics in your information security course. The bottom line is, you know the material you want to teach, so why not customize the content to meet your exact curriculum needs?

    Read More

    Topics: Computer Science, computing, Information Security, Introduction to Computer Science, PUBLISH, Algorithms, Computer Architecture, Computer Organization, Cyberethics, Java, java, JavaScript, Programming

    Ensure Your Students Have a Clear Grasp on Complex Algorithms

    Posted by admin on Apr 14, 2011 2:37:00 PM

    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.

    Read More

    Topics: New Edition, Foundations, new edition, Algorithms, algorithms, foundations

    Subscribe to Email Updates

    Recent Posts

    Posts by Topic

    see all