TAILIEUCHUNG - Lecture Object Oriented Programing - Chapter 17: Data structures

After completing this unit, you should be able to: To form linked data structures using references, self-referential classes and recursion, the type-wrapper classes that enable programs to process primitive data values as objects, to use autoboxing to convert a primitive value to an object of the corresponding type-wrapper class, to use auto-unboxing to convert an object of a type-wrapper class to a primitive value. | 17 Data Structures Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd ‘Will you walk a little faster?’ said a whiting to a snail, ‘There’s a porpoise close behind us, and he’s treading on my tail.’ Lewis Carroll There is always room at the top. Daniel Webster Push on—keep moving. Thomas Morton I’ll turn over a new leaf. Miguel de Cervantes OBJECTIVES In this chapter you will learn: To form linked data structures using references, self-referential classes and recursion. The type-wrapper classes that enable programs to process primitive data values as objects. To use autoboxing to convert a primitive value to an object of the corresponding type-wrapper class. To use auto-unboxing to convert an object of a type-wrapper class to a primitive value. To create and manipulate dynamic data structures, such as linked lists, queues, stacks and binary trees. Various important applications of linked data structures. How to create reusable data structures

• Kỹ thuật lập trình
• Object Oriented Programing
• Lecture Object Oriented Programing
• Programming languages
• Data structures
• Type wrapper classes
• Dynamic memory allocation
• Direct superclass
• Indirect superclass
• Software engineering
• Effect polymorphism
• Demonstrating polymorphic behavior
• Abstract classes
• Data hierarchy
• Class file
• Object serialization
• Class string
• Class character
• Concatenating strings
• Computer organization
• Early operating systems
• World Wide Web
• Java applications
• Displaying text
• Java application programming
• Instance variables
• Initializing Objects
• Primitive types
• Control statements
• Control structures
• Formulating algorithms
• Counter controlled repetition
• Program modules in Java
• Declaring methods
• Method overloading
• Declaring arrays
• Creating arrays
• Passing arrays to methods
• Controlling access
• Overloaded constructors
• Graphical user interfaces
• Look and feel observation
• Java coordinate system
• Graphics contexts
• Drawing Arcs
• Exception handling
• Java exception hierarchy
• Infinite recursion
• Recursive backtracking
• Searching algorithms
• Sorting algorithms
• Linear search
• Class arrays
• Collections algorithms
• Synchronized collections
• Loading images
• Displaying images
• Scaling images
• Pluggable look and feel
• Manipulate sliders
• Thread states
• Executing threads
• Thread synchronization