logo

CuriousTab

CuriousTab

Discussion


Home Interview Technology Comments

  • Question
  • What do you know about the big-O notation and can you give some examples with respect to different data structures ?


  • Correct Answer
  • The Big-O notation simply describes how well an algorithm scales or performs in the worst case scenario as the number of elements in a data structure increases The Big-O notation can also be used to describe other behavior such as memory consumption Since the collection classes are actually data structures, we usually use the Big-O notation to chose the best implementation to use, based on time, memory and performance Big-O notation can give a good indication about performance for large amounts of data 


  • Technology problems


    Search Results


    • 1. What are the basic interfaces of Java Collections Framework ?
    • Discuss
    • 2. What is the difference between processes and threads ?
    • Discuss
    • 3. Explain different ways of creating a thread. Which one would you prefer and why ?
    • Discuss
    • 4. What are pass by reference and pass by value ?
    • Discuss
    • 5. What is dynamic method dispatch?
    • Discuss
    • 6. What?s the difference between Enumeration and Iterator interfaces ?
    • Discuss
    • 7. What is the output of this program ? class main_arguments { public static void main(String [ ] args) { String [][] argument = new String[2][2]; int x; argument[0] = args; x = argument[0].length; for (int y = 0; y < x; y++) System.out.print(" " + argument[0][y]); } }

    • Options
    • A. 1 1
    • B. 1 0
    • C. 1 0 3
    • D. 1 2 3
    • Discuss
    • 8. What is autoboxing and unboxing ?
    • Discuss
    • 9. Can you access non static variable in static context ?
    • Discuss
    • 10. What is the difference between an Interface and an Abstract class ?
    • Discuss


    Comments

    There are no comments.

Enter a new Comment