Arrays

Ordered array Searching Linear search Binary search Advantages of ordered array Storing...
View Complete Description
×

Topic Summary

Ordered array Searching Linear search Binary search Advantages of ordered array Storing objects Logarithms The Equation Big O Notation Big O of insertion in an unordered array Big O of Linear Search Big O of Binary Search
19
Questions
Question Type Legends

Easy

Medium

Difficult

Multiple Choice Questions for Arrays

  • 1 Binary search takes _____ running time in Big O notation.
    1. O(log N)
    2. O(1)
    3. O(N)
    4. None of the above

  • 2 Linear search takes ____ running time in Big O notation
    1. O(Log N)
    2. O(N)
    3. O(1)
    4. None of the above

  • 3 Insertion in ordered array takes _____ running time in Big O notation
    1. O(N)
    2. O(1)
    3. O(log N)
    4. None of the above

  • 4 Insertion in unordered array takes _____ running time in Big O notation.
    1. O(N)
    2. O(1)
    3. Olog(N)
    4. None of the above

  • 5 private Person[] a; is an
    1. integer array
    2. incorrect syntax
    3. array of objects of Person class
    4. not an array

  • 6 The disadvantage of ordered array is that
    1. searching is fast
    2. searching is slow
    3. insertion is fast
    4. insertion is slow

Contact Us

support@subexpert.com
Write to Us View Help
Subject Expert Logo

Subject Expert

Learn and Evaluate

Follow Us
© 2020 - Subject Expert