Java : a framework for program design and data structures / Kenneth A. Lambert & Martin Osborne.
Publication details: Australia ; Singapore ; Canada : Brooks/Cole, c2000.Description: xxii, 677 p. : ill. ; 24 cmISBN:- 9780534366919
- 0534366910
- 005.133 22 LAM
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book Open Access
|
Engineering Library | 005.133 LAM 1 (Browse shelf(Opens below)) | 1 | Available | BUML23100906 |
Browsing Engineering Library shelves Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005.133 JOH 1 Professional Graphics programming in the X window system / | 005.133 JON 1 Problem solving using Turbo Pascal / | 005.133 KRU 1 Data structures and program design in C++ / | 005.133 LAM 1 Java : a framework for program design and data structures / | 005.133 LEW 1 Java software solutions : foundations of program design / | 005.133 LEW 1 Java software structures : designing and using data structures / | 005.133 LIA 1 Introduction to Java programming with sun ONE studio 4 / |
Content
Chapter 1 overview
1.1 Collections
1.2 Abstract data types
1.3 Algorithm analysis
1.4 Algorithm type
etc.
Chapter 2 Review of object-oriented programming in JAVA
2.1 Classes and objects
2.2 An employee class
2.3 Inheritance and polymorphism
2.4 Implementing a simple shape hierarchy
etc.
Chapter 3 Introduction to GUI-based applications with Java
3.1 Brief overview of breezy UI and its features
3.2 Some simple example programs
3.3 Building more complex GUI programs
etc.
Chapter 4 Complexity
4.1 Measuring the efficiency of Algorithms
4.2 Big-O analysis
4.3 Search algorithms
4.4 Sort algorithms
etc.
Chapter 5Arrays and linked data structures.
5.1 Characteristics of arrays
5.2 Operations on arrays
5.3 Linked structures
5.4 Operations on singly linked structures
etc.
Chapter 6 Overview of collections
6.1 Introduction
6.2 Multiple implementations
6.3 Collections and casting
etc.
Chapter 7 Stacks
7.1 Overview of stacks
7.2 A stack prototype
7.3 Using a stack
7.4 Implementation of the stack prototype
etc.
Chapter 8 Queues
8.1 Overview of queues
8.2 A queue prototype
8.3 Implementations of the queue prototype
8.4 Two applications of queues
etc.
Chapter 9 Lists
9.1 Overview of lists
9.2 A lits protototype
9.3 Using lists
9.4 Implementations of the prototype
etc.
10 Recursion, searching, sorting, and backtracking
10.1 Overview of recursion
10.2 Recursion and searching
10.3 Recursion and sorting
10.4 Recursion and backtracking
etc
Chapter 11 Introduction to trees
11.1 Overview of trees
11.2 Representations of trees
11.3 Binary tree operations
11.4 Case three operations
etc
Chapter 12 Special purpose trees
12.1 Heaps
12.2 Binary search trees
12.3 Better binary searching (optional)
Chapter 13 Unordered collections: sets, maps, and bags
13.1 Overview of sets, map, and bags
13.2 Implementation considerations.
13.4 Prototype class for bags
etc
Chapter 14 Graphs
14.1 Introduction
14.2 Terminology
14.3 Representations of graphs
14.4 Graphs Traversals.
etc
Chapter Multithreading, networking and client server programming
15.1 Threads and processes
15.2 Networks, servers and clients
Case study: A campus directory
Glossary : p. 655-672 . _ Indexes : p. 673 - 677
There are no comments on this title.