Java for C++ Programmers

Java for C++ Programmers

This tutorial is intended for students who are already familiar with C++ and with data structures, and are interested in learning Java. 

There are 5 "self-guided" lessons that include:

• reading notes
• answering multiple-choice questions about the material (coming soon...)
• writing Java programs

Each set of on-line notes includes some "self-study" questions. The answers are also included in the notes; however, the best way to learn the material is to try to answer the questions yourself when you get to them in the notes. When the questions involve writing code, it is important to try to compile and run the code as well as writing it -- this will give you practice using the Java compiler and interpreter, and it will help you find errors in your code that you otherwise might miss

Lessons( in HTML Format)

1. Java vs C++
2. Java Classes
3. Packages and Exceptions
4. Introduction to Inheritance
5. Inheritance, Interfaces, and I/O

Programming Assignments

1. Program 1: List Class
2. Program 2: List Class Using Linked Lists
3. Program 3: Packages and Exceptions

FAQs

Frequently Asked Questions

Java Debugger

The Java Debugger DDD

JDK Doc

JDK 1.2 Documentation

Analysis of Algorithms (with audio lecture)

Book

• The Stony Brook Algorithm Repository
• Audio files of this lectures

Lecutres (in HTML format)(audio file link with each lecture)

• Lecture 1 - analyzing algorithms
• Lecture 2 - asymptotic notation
• Lecture 3 - recurrence relations
• Lecture 4 - heapsort
• Lecture 5 - quicksort
• Lecture 6 - linear sorting
• Lecture 7 - elementary data structures
• Lecture 8 - binary trees
• Lecture 9 - catch up
• Lecture 10 - tree restructuring
• Lecture 11 - backtracking
• Lecture 12 - introduction to dynamic programming
• Lecture 13 - dynamic programming applications
• Lecture 14 - data structures for graphs
• Lecture 15 - DFS and BFS
• Lecture 16 - applications of DFS and BFS
• Lecture 17 - minimum spanning trees
• Lecture 18 - shortest path algorthms
• Lecture 19 - satisfiability
• Lecture 20 - integer programming
• Lecture 21 - vertex cover
• Lecture 22 - techniques for proving hardness
• Lecture 23 - approximation algorithms and Cook's theorem

Java Distributed Computing

Emerging Technologies

Lecture Notes By Topic (HTML Format)

1. Networks
2. Basic Client-Server
3. Remote AWT
4. Java on Rohan
5. Distributed Object Basics
6. RMI Intro
7. Java Security Model
8. RMI Configuration, API
9. Roaming Remotes
10. Serialization
11. Remote Object Activation
12. RMI Stock Watch Example
13. RMI SocketFactories
14. Activation & rohan
15. Jini Intro
16. Dynamically Downloading Classes
17. Starting Jini Services
18. Simple Jini Example
19. Djinn Groups & Discovery
20. Client-side Server, Unicast Join & Leases
21. Jini on Rohan
22. Client-side Proxies
23. Assignment 1 Comments
24. Jini Leases
25. Jini Distributed Events
26. Reggie Problems Explained
27. More Reggie
28. Jini Transactions
29. Auction - A Transaction Example
30. An Activatable Jini Service
31. Agents & Voyager
32. A Simple Jini Transaction Example
33. More RMI Activation
34. Voyager Agent Basics
35. Agent Communication
36. Jini Overview

Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne

Algorithms, 4th Edition.: essential information that every serious programmer
needs to know about algorithms and data structures

Textbook.

 The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne [ Amazon · Addison-Wesley ] surveys the most important algorithms and data structures in use today. The textbook is organized into six chapters:

• Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions. It also includes our programming model.
• Chapter 2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort, and quicksort. It also includes a binary heap implementation of a priority queue.
• Chapter 3: Searching describes several classic symbol table implementations, including binary search trees, red-black trees, and hash tables.
• Chapter 4: Graphs surveys the most important graph processing problems, including depth-first search, breadth-first search, minimum spanning trees, and shortest paths.
• Chapter 5: Strings investigates specialized algorithms for string processing, including string sorting, substring search, tries, regular expressions, and data compression.
• Chapter 6: Context highlights connections to systems programming, scientific computing, commercial applications, operations research, and intractability.

Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm that we address by examining its impact on specific applications.

Booksite.

 Reading a book and surfing the web are two different activities: This booksite is intended for your use while online (for example, while programming and while browsing the web); the textbook is for your use when initially learning new material and when reinforcing your understanding of that material (for example, when reviewing for an exam). The booksite consists of the following elements:

• Excerpts. A condensed version of the text narrative for reference while online.
• Java code. Here is a list of the algorithms and clients in this textbook.
• Exercise solutions. Solutions to selected exercises.

	PDF SLIDES
0	INTRODUCTION
0	Introduction
1	FUNDAMENTALS
1.1	Programming Model
1.2	Data Abstraction
1.3	Stacks and Queues
1.4	Analysis of Algorithms
1.5	Case Study: Union Find
2	SORTING
2.1	Elementary Sorts
2.2	Mergesort
2.3	Quicksort
2.4	Priority Queues
3	SEARCHING
3.1	Elementary Symbol Tables
3.2	Binary Search Trees
3.3	Balanced Search Trees
3.4	Hash Tables
3.5	Searching Applications
4	GRAPHS
4.1	Undirected Graphs
4.2	Directed Graphs
4.3	Minimum Spanning Trees
4.4	Shortest Paths
5	STRINGS
5.1	String Sorts
5.2	Tries
5.3	Substring Search
5.4	Regular Expressions
5.5	Data Compression

General Computer Science

 Course description.  An introduction to computer science in the context of scientific, engineering, and commercial applications. The goal of the course is to teach basic principles and practical issues, while at the same time preparing students to use computers effectively for applications in computer science, physics, biology, chemistry, engineering, and other disciplines. Topics include: programming in Java; hardware and software systems; algorithms and data structures; fundamental principles of computation; and scientific computing, including simulation, optimization, and data analysis.

Required readings.   R. Sedgewick and K. Wayne, Introduction to Programming in Java: An Interdisciplinary Approach, Addison-Wesley, 2007. ISBN 0-321-49805-4. Available at Labyrinth Bookstore, 122 Nassau Street, or online. Also on reserve at Friend library.

Recommended readings.  D. Harel, Computers Ltd.: What They Really Can't Do, Oxford, 2003. ISBN 0-19-860442-4. Available at the Labyrinth Bookstore, 122 Nassau Street. Also on reserve at Friend library.

Lec#	TOPIC in PDF	INTRO CS
1	Prologue	1
2	Introduction to Java	1.1-1.2
3	Conditionals and Loops	1.3
4	Arrays	1.4
5	Input and Output	1.5
6	Functions and Libraries	2.1-2.2
7	Recursion	2.3
8	Performance	4.1, 9.6
9	Von Neumann Machine I	5.1-5.3 (booksite)
10	Von Neumann Machine II	5.4-5.5 (booksite)
11	Exam 1	-
12	Using Data Types	3.1
13	Creating Data Types	3.2
14	Case Study: Purple America	3.3 (book), 3.5 (booksite)
15	Searching and Sorting	4.2
16	Stacks and Queues	4.3
17	Symbol Tables	4.4
18	Theory of Computation (new 11/21)	7.1-7.3 (booksite and online chapter)
19	Universality and Computability	7.4-7.6 (booksite), Harel 1-2 (optional)
20	Intractability	7.7 (booksite), Harel 3-5 (optional)
21	Combinational Circuits	Circuits Packet
22	Designing a CPU	-
23	AI	-
24	Exam 2	-