Preview

Questions on Java Collection

Good Essays
Open Document
Open Document
4040 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Questions on Java Collection
Java Collection Interview Questions

Q: | What is the Collections API? | A: | The Collections API is a set of classes and interfaces that support operations on collections of objects. | Q: | What is the List interface? | A: | The List interface provides support for ordered collections of objects. | Q: | What is the Vector class? | A: | The Vector class provides the capability to implement a growable array of objects. | Q: | What is an Iterator interface? | A: | The Iterator interface is used to step through the elements of a Collection . | Q: | Which java.util classes and interfaces support event handling? | A: | The EventObject class and the EventListener interface support event processing. | Q: | What is the GregorianCalendar class? | A: | The GregorianCalendar provides support for traditional Western calendars | Q: | What is the Locale class? | A: | The Locale class is used to tailor program output to the conventions of a particular geographic, political, or cultural region . | | | |

Q: | What is the SimpleTimeZone class? | A: | The SimpleTimeZone class provides support for a Gregorian calendar . | | | |

Q: | What is the Map interface? | A: | The Map interface replaces the JDK 1.1 Dictionary class and is used associate keys with values. | | | |

Q: | What is the highest-level event class of the event-delegation model? | A: | The java.util.EventObject class is the highest-level class in the event-delegation class hierarchy. | | | |

Q: | What is the Collection interface? | A: | The Collection interface provides support for the implementation of a mathematical bag - an unordered collection of objects that may contain duplicates. | | | |

Q: | What is the Set interface? | A: | The Set interface provides methods for accessing the elements of a finite mathematical set. Sets do not allow duplicate elements. | | | |

Q: | What is the typical use of Hashtable? | A: |

You May Also Find These Documents Helpful

  • Good Essays

    ECET 370 Week 5 Lab 5

    • 650 Words
    • 3 Pages

    Exercise 1: Review of the Lecture Content Create a project using the ArrayList class and the Main class provided in DocSharing. The ArrayList class contains implementations of the first three search methods explained in this week's lecture: sequential, sorted, and binary search. The Main class uses these three methods. These programs test the code discussed in the lecture. Compile the project, run it, and review the code that is given carefully.…

    • 650 Words
    • 3 Pages
    Good Essays
  • Good Essays

    | |control method whereby the |through the use of lists is |network some additional |…

    • 572 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Nt1210 Chapter 1 Review

    • 1315 Words
    • 6 Pages

    B. Provides a convenient way to name a set of data for easier operations like copying and moving…

    • 1315 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    It/210 Course Design

    • 2571 Words
    • 11 Pages

       Identify at least three processes (capabilities) needed to keep track of your collection. Identify the input data required for each process. Identify a logical name for each data output item and type of data output: real number, integer, or text. Post the table as an attachment. Day 5 15 3 Course Design Guide IT/210 Version 5 4 Week Two: Software Application Development Details…

    • 2571 Words
    • 11 Pages
    Satisfactory Essays
  • Good Essays

    5. The double equal sign (==) is the symbol used to represent Java's equal to operator.…

    • 719 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    It 210

    • 2960 Words
    • 12 Pages

    Although the value of a variable may change during execution of a program, in all our programs so far, a single value has been associated with each variable name at any given time. In this chapter, we will discuss the concept of an array—a collection of variables of the same type and referenced by the same name. We will discuss one-dimensional arrays (lists) at length and focus briefly on twodimensional arrays (tables). You will learn how to set up and use arrays to accomplish various tasks.…

    • 2960 Words
    • 12 Pages
    Powerful Essays
  • Powerful Essays

    situations of adding to, take from, putting together, taking apart, and comparing, with unknowns in all positions, e.g., by using objects, drawings, and equations with a symbol for the unknown number to represent the problem.…

    • 1755 Words
    • 8 Pages
    Powerful Essays
  • Good Essays

    Cs229

    • 9150 Words
    • 37 Pages

    1, . . . , m}—is called a training set. Note that the superscript “(i)” in the…

    • 9150 Words
    • 37 Pages
    Good Essays
  • Good Essays

    Java

    • 490 Words
    • 3 Pages

    Write a Java program to demonstrate using bitmaps and bitwise operators to sort and remove duplicates from a file of random phone numbers. Do not confuse the term bitmap used for compressing data into smaller spaces with the bitmap that has come to mean a graphic image.…

    • 490 Words
    • 3 Pages
    Good Essays
  • Better Essays

    Symbol Table

    • 1792 Words
    • 8 Pages

    A symbol table mechanism must allow us to add new entries and find existing entries. The two symbol table mechanisms are linear lists and hash tables. Each scheme is evaluated on the basis of time required to add n entries and make e inquiries. A linear list is the simplest to implement, but its performance is poor when n and e are large. Hashing schemes provide better performance for greater programming effort and space overhead.…

    • 1792 Words
    • 8 Pages
    Better Essays
  • Powerful Essays

    Book of Proof

    • 105259 Words
    • 422 Pages

    1.1. 1.2. 1.3. 1.4. 1.5. 1.6. 1.7. 1.8. Introduction to Sets The Cartesian Product Subsets Power Sets Union, Intersection, Difference Complement Venn Diagrams Indexed Sets…

    • 105259 Words
    • 422 Pages
    Powerful Essays
  • Satisfactory Essays

    Data Structure

    • 328 Words
    • 2 Pages

    Data structure is a mechanism for storing data and organizing it in some way. The data structures you use in Alice are list and arrays.…

    • 328 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    REPORT ON PRO E

    • 1655 Words
    • 7 Pages

    · List duplicate occurrences of model data individually or as a group in a report, drawing table, or layout table.…

    • 1655 Words
    • 7 Pages
    Powerful Essays
  • Satisfactory Essays

    What Is Super Key in Dbms

    • 1055 Words
    • 5 Pages

    Superkey - A superkey is defined in the relational model as a set ofattributes of a relation variable (relvar) for which it holds that inall relations assigned to that variable there are no two distincttuples (rows) that have the same values for the attributes...…

    • 1055 Words
    • 5 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Algorith Analysis Text Book

    • 387199 Words
    • 1549 Pages

    Introduction 1 3 The Role of Algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology 11 Getting Started 16 2.1 Insertion sort 16 2.2 Analyzing algorithms 23 2.3 Designing algorithms 29 Growth of Functions 43 3.1 Asymptotic notation 43 3.2 Standard notations and common functions…

    • 387199 Words
    • 1549 Pages
    Satisfactory Essays