Creativity, Innovation and Change

This course empowers learners to develop their creative human potential to improve, enhance, and transform their businesses, communities, and personal lives. Processes like Intelligent Fast Failure will teach you rapid prototyping skills, while the Adaption-Innovation creative style spectrum will help you understand how and why your ideas are unique - and how you can work better with others to solve complex problems. Personal reflection tools like CENTER add a character development dimension to the course that is an important first step towards unlocking your creative potential. Joining the team are Dr. Follow us on Twitter @PSUCIC Like our Facebook Page hereJoin our Google+ community hereConnect with the community on LinkedIn here Time-frame: 8 weeks, starting in September 2013 Week 1: Creative Identity The Importance of FailureCreative DiversityEstablishing and Building Character Week 2: Idea Generation Ideation MethodsIdea JournalCreative Divergence Week 3: Idea Evaluation Adventurers.

Functional Programming Principles in Scala About the Course This course introduces the cornerstones of functional programming using the Scala programming language. Functional programming has become more and more popular in recent years because it promotes code that’s safe, concise, and elegant. Furthermore, functional programming makes it easier to write parallel code for today’s and tomorrow’s multiprocessors by replacing mutable variables and loops with powerful ways to define and compose functions. Scala is a language that fuses functional and object-oriented programming in a practical package. In this course you will discover the elements of the functional programming style and learn how to apply them usefully in your daily programming tasks. The course is hands on; most units introduce short programs that serve as illustrations of important concepts and invite you to play with them, modifying and improving them. Course Syllabus Week Three: Defining and using immutable objects, review of inheritance and dynamic binding.

Algorithms II What algorithms and data structures are covered?Part I focuses on elementary data structures, sorting, and searching. Topics include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red-black trees, separate chaining and linear probing hash tables, Graham scan, and kd-trees.Part II focuses on graph and string-processing algorithms. It depends on your background. I am/was not a computer science major.