Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami wraps up arrays and introduces array lists. CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Uses the Java programming language. Emphasis is on good programming style and the built-in facilities of the Java language. Complete Playlist for the Course: www.youtube.com CS106A at Stanford Unversity: www.stanford.edu Stanford Center for Professional Development: scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on youtube www.youtube.com

Temple University CIS 1048 – 08-09 Semester 2 Video Project: Open Source Software – - – This is an Introduction to Information Science and Technology project. We were asked to create a 1+ minute video on a specific topic, in our case Open Source Software and its implementation in government. We all had to appear in the video. – - – Group: Tony Ly, Gentian Mema, Kaliym Toppin, Ryan Lelache

Link: www.boygeniusreport.com So this video will talk about the new rumored features that the new iphone is going to come with this year and this are the following: 1. New UI now you can interact with your iphone like never before. 2. Multitasking now you can run your applications in the background knowing that you can come back to them when ever you can. 3.New way to sync to your imac or computer trough a new application that your iphone will connect to your computer as soon as you walk in the door.

(October 2, 2009) David Akers discusses the difficulties in testing creation application testing on ease of usability. Akers claims that backtracking events can be effective indicators of usability problems, and can yield a scalable alternative to traditional usability testing for creation-oriented applications. Stanford University: www.stanford.edu Stanford Engineering Everywhere: see.stanford.edu Stanford Channel on youtube: www.youtube.com

Lecture 24 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie introduces hashing and it’s uses in search and retrieval; map implementations and the different kinds of search algorithms are then discussed. Thereafter she explains that logarithmic searches are relatively fast and often finish the search in an immeasurable amount of time. She introduces a different approach to search that works in a faster manner than linear search. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on youtube: www.youtube.com