1. Professor Evan Korth Fall 2017
PAC I
Professor Evan Korth
Fall 2017

2. Road Map for Today Welcome to PAC I! Course Description
What material will we cover?
What am I getting myself into?
Administrative Issues
Course Web Page, Text Book, Exams, Office Hours, Homework, Grading, Cheating Policy, etc.
Syllabus
Survey
Start covering material

3. Who is here?
Who am I?
Who are you?

4. Course Prerequisites Prerequisite: Who should be taking this course:
Programming experience in any language
Moderate math sophistication is expected
Who should be taking this course:
Applicants to the master’s programs who have insufficient background in computer science, but are otherwise admissible are referred to PAC.
Other graduate students who want a solid foundation in CS
Who should NOT be taking this course
Students that know Java and data structures 4

5. PAC Description PREPARATORY ACCELERATED COURSE (PAC)
The PAC Program is a two-course sequence designed to fulfill the minimum prerequisites for beginning a master's degree program in computer science or information systems. PAC I is offered in the fall semester and PAC II is offered in the spring semester. The courses should be taken in sequence, as PAC I is a prerequisite for PAC II. 5

6. Course Description
An accelerated introduction to the fundamental concepts of computer science for students who lack a formal background in the field. Topics include algorithm design and program development; data types; control structures; subroutines and parameter passing; recursion; data structures; searching and sorting; dynamic storage allocation; abstract data types, such as stacks, queues, lists, and tree structures; and an introduction to the principles of object-oriented programming. The primary programming language used in the course will be Java. Students should expect an average of hours of programming and related course work per week.

7. What the class is really about
The main goals of this course:
Foundations of Java
We will focus on Java’s object orientated concepts.
Foundations of Algorithm Development
Foundations of Software Development
Foundations of Abstract Data Types (ADT)
What is a data structure?
Examples of data structures and their real world uses.
Foundations of Asymptotic Analysis
How do we rate the efficiency of an algorithm?
How does choosing the right ADT effect an algorithm's efficiency? 7

8. 1. Foundations of Java Programming
Java is a popular programming language, widely used in industry.
We will learn all the specifics of how to program in Java.
This includes all the rules that are specific to Java.
First we will cover Java’s implementation of the fundamentals: Variables, Arithmetic, If / Else, For Loops, While Loops, Methods, Arrays, etc.
Then will then cover Java’s object orientated concepts. 8

9. 2. Algorithm development
We will look at problem solving methods that involve analyzing the problem and designing an algorithm before we start to write code.

10. 3 Learn the Principles of Software Development
Building high quality software is very difficult.
The course presents the syntax and concepts of programming, and also presents strategies for building real software that address real problems.
I will also try to bring my real-world industry experience to class. 10

11. 4 Foundations of Abstract Data Types
An abstract data type (ADT) is a set of objects together with a set of operations. For example:
Stack
Queue
Dictionary
Tree
Priority queue 11

12. 5 Introduction to Algorithm analysis
Basically, we want to solve any given problem using the fewest possible computer instructions.
Two algorithms may solve the same problem. One may take a few seconds while the other takes a few years. We will analyze our data structures to see why one works better than the other for a given set of data.
For example, we will learn several sort algorithms and analyze the efficiency of each.
Insertion sort
Merge sort
Quick Sort
Heap sort
See:

13. Administrative Matters13

14. Course Website Course web site is available at:
Web site contains the following information:
Administrative information
Course Syllabus
Homework assignments
Class notes
Class programs
Link to the class mailing list 14

15. Class mailing list First assignment is to join it. Do it today! Go to:
and follow the instructions
All assignments and news will be sent to the class list
Homework questions should be sent to the list and answered by students when possible. 15

16. Course Text Book
Introduction to Java Programming (11th Edition) Brief Version
Available at the NYU Bookstore
Lecture notes will follow the book.
Please keep up with the reading! 16

17. Course Text Book
Data Structures and Algorithms in Java, 6th edition, Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
ISBN :
Should be available at the NYU Bookstore
Please keep up with the reading! 17

18. Software
For the course, you may use any IDE you are comfortable using. I will use one or more of the following in the classroom:
Eclipse
Netbeans
I will mostly use the command line and Sublime as a text editor
All these products can be downloaded from the web for free.
If you do not have your own computer, the computer labs on campus have the software. 18

19. Grading Your grade will be determined as follows:
Programming assignments(40%)
Midterm (and quizzes) (30%)
Final Exam (30%)
We will experiment with non-graded quizes this semester
Class participation will help your grade! 19

20. homework
If you do not do the homework programs, you cannot pass the course.
If home work is late, 25% is deducted.
After one week of lateness, home work will not be accepted.
Style counts.
Submit the program via to the IA (more on this later)
Back-up your files: For you own good you must save all programs in several places (make back-up copies!!). Computer crashes or lost programs are not valid excuses for not handing in an assignment. 20

21. Final Exam Final exam is scheduled for December 19th.
The last class is December 5th.
I plan to move the final exam to Dec 13th.
That is the usual recitation time so you should all be available.
See me today if that is not the case
The final will go to 9:40pm that night. Recitation usually ends at 8:00pm
Please do not make plans to leave NYC before the final. It is mandatory.

22. A Word About Cheating
For the purposes of this class, cheating is defined as by the CS Department’s academic integrity policy
Discussing homework concepts is fine, but you must submit your own work.
If you are caught cheating, you will receive an immediate FAILURE for the course. 22

23. Student Civility
In an effort to make this class enjoyable for everybody…
Please be on time to class!
Please do not talk to your friends and neighbors in class! It disturbs everyone, and makes it hard to concentrate. If you have a question, just ask me!
Please turn your and cell-phones off! 23

24. Getting Help
Help is always available!
Option 1: Come to my Office Hours
Tuesday 11:15am – 12:15pm 9: :00pm (I may change the time of my office hours)
Location: Room 319 Warren Weaver Hall
I get bored when nobody visits!
If you cannot make my office hours, I will be happy to make an appointment with you. Please try to give me advance warning when you need an appointment.
Option 2: Write to the class mailing list. Please do not send homework code to the list.
Option 3: Our TA. 24

25. Java syllabus Java from the Liang book:
1 Introduction to Computers, Programs, and Java
2 Elementary Programming
3 Selections
4 Mathematical Functions, Characters, and Strings
5 Loops
6 Methods
7 Single-Dimensional Arrays
8 Multidimensional Arrays
9 Objects and Classes
10 Object-Oriented Thinking
11 Inheritance and Polymorphism
12 Exception Handling and Text I/O (partial)
13 Abstract Classes and Interfaces
18 Recursion
Appendix A Java Keywords
Appendix B The ASCII Character Set
Appendix C Operator Precedence Chart
Appendix D Java Modifiers

26. data structures syllabus
Here is a tentative list of the topics we will cover (note: this is most of the second text – we may not cover all these topics):
Recursion
Asymptotic Analysis of Algorithms: We will just scratch the surface as we look at the efficiency of some of our structures and algorithms
Lists
Stacks
Queues
Trees
Heaps
Sorting & Searching
Hashing
Graphs
Huffman Codes

27. recitation
This class has a mandatory recitation. If you are not registered for the recitation, you must do so.
Recitation will be led by our IA. His name is Derek Obrien.
Quizzes will be held in recitation.
HW will be discussed in recitation.
Recitation starts tomorrow!

28. Object Orientated Programming
Objects
Reusable software components that model items in the real world
Meaningful software units
Date objects, time objects, paycheck objects, invoice objects, audio objects, video objects, file objects, record objects, etc.
Any noun can be represented as an object
Very reusable
More understandable, better organized, and easier to maintain than procedural programming
Favor modularity 28
 Prentice Hall, Inc. All rights reserved.

29. History of Java
A group of 13 Sun employees including James Gosling started the “Green Project” in 1991 with the intention of planning for the next wave in computing.
They designed the *7 which was “an interactive, handheld home-entertainment device controller with an animated touchscreen user interface”
Gosling’s contribution to the project was an entirely new processor independent language call “Oak”. 29

30. History of Java (continued)
To make a long story short, people at Sun decided to use this new language for the web.
At the Sun World conference in May 1995, Marc Andreessen of Netscape announced an agreement to integrate Java into its browser – in a nutshell - webpages were no longer going to be static.
Over the next few years, java became very popular for writing applets (small programs included on webpages)
Today in addition to writing applets, Java is used for writing large applications as well as applications for mobile devices
For more on the history of Java, check out:

31. Basics of a Typical Java Environment
Java programs normally undergo five phases
Edit
Programmer writes program (and stores program on disk)
Compile
Compiler creates bytecodes from program
Load
Class loader stores bytecodes in memory
Verify
Verifier ensures bytecodes do not violate security requirements
Execute
Interpreter translates bytecodes into machine language
 Prentice Hall, Inc. All rights reserved.

32. Typical Java environment
Primary
Memory .
Disk
Editor
Compiler
Class Loader
Program is created in an editor and stored on disk in a file ending with .java.
Compiler creates bytecodes and stores them on disk in a file ending with .class.
Class loader reads .class files containing bytecodes from disk and puts those bytecodes in memory.
Phase 1
Phase 2
Phase 3
Bytecode Verifier
Bytecode verifier confirms that all bytecodes are valid and do not violate Java’s security restrictions.
Phase 4
Interpreter
Interpreter reads bytecodes and translates them into a language that the computer can understand, possibly storing data values as the program executes.
Phase 5
Typical Java environment
 Prentice Hall, Inc. All rights reserved.