Computer Data Structure And Algorithms 1(tta)

25 Questions

Settings
Please wait...
Computer Data Structure And Algorithms 1(tta)

INSTRUCTIONS1. NUMBER OF QUESTIONS 252. HAS A TIME LIMIT OF 15 MINUTES3. HAS A PASS MARKS OF 30%4. QUESTIONS PER PAGE 15. EACH QUESTIONS HAS 1 MARKS6. NEGATIVE MARKING FOR EACH QUESTIONS 0. 257. WILL ALLOW TO YOU GO BACK ,SKIP AND CHANGE YOUR ANSWERS8. WILL ALLOW TO YOU PRINT OUT YOUR RESULT AND CERTIFICATE9. WILL ALLOW TO YOU PRINT OUT YOURS RESPONSE SHEET WITH CORRECT ANSWER KEY AND EXPLANATION10. WE WILL PROVIDE YOURS RESULT,CERTIFICATE AND YOUR RESPONSE SHEET TO YOURS EMAIL ID AT END OF ONLINE TEST. . . .


Questions and Answers
  • 1. 
    Two main measures for the efficiency of an algorithm are
    • A. 

      Processor and memory

    • B. 

      Complexity and capacity

    • C. 

      Time and space

    • D. 

      Data and space

  • 2. 
    The time factor when determining the efficiency of algorithm is measured by
    • A. 

      Counting micro seconds

    • B. 

      Counting the number of Key operations

    • C. 

      Counting the number of statements

    • D. 

      Counting the kilobytes of algorithm

  • 3. 
    The space factor when determining the efficiency of algorithm is measured by
    • A. 

      Counting the maximum memory needed by the algorithm

    • B. 

      Counting the minimum memory needed by the algorithm

    • C. 

      Counting the average memory needed by the algorithm

    • D. 

      Counting the maximum disk space needed by the algorithm

  • 4. 
    Which of the following case does not exist in complexity theory
    • A. 

      Best case

    • B. 

      Worst case

    • C. 

      Average case

    • D. 

      Null case

  • 5. 
    The worst case occur in linear search algorithm when
    • A. 

      Item is some where in the middle of the array

    • B. 

      Item is not in the array at all

    • C. 

      Item is the last element in the array

    • D. 

      Item is the last element in the array or is not there at all

  • 6. 
    The Average case occur in linear search algorithm when
    • A. 

      When item is somewhere in the middle of the array

    • B. 

      When item is not in the array at all

    • C. 

      When items is the last element in the array

    • D. 

      When item is the last element in the array or is not there at all

  • 7. 
    The complexity of the average case of an algorithm is
    • A. 

      Much more complicated to analyze than that of worst case

    • B. 

      Much more simpler to analyze than that of worst case

    • C. 

      Sometimes more complicated and some other times simpler than that of worst case

    • D. 

      None of these

  • 8. 
    The complexity of linear search algorithm is
    • A. 

      O(n)

    • B. 

      O(log n)

    • C. 

      O(n2)

    • D. 

      O(n log n)

  • 9. 
    The complexity of Binary search algorithm is
    • A. 

      O(n)

    • B. 

      O(log n)

    • C. 

      O(n2)

    • D. 

      O(n log n)

  • 10. 
    The complexity of Bubble sort algorithm is
    • A. 

      O(n)

    • B. 

      O(log n)

    • C. 

      O(n2)

    • D. 

      O(n log n)

  • 11. 
    The complexity of merge sort algorithm is
    • A. 

      O(n)

    • B. 

      O(log n)

    • C. 

      O(n2)

    • D. 

      O(n log n)

  • 12. 
    The indirect change of the values of a variable in one module by another module is called
    • A. 

      internal change

    • B. 

      inter-module change

    • C. 

      side effect

    • D. 

      Side-module update

  • 13. 
    Which of the following data structure is not linear data structure?
    • A. 

      Arrays

    • B. 

      Linked lists

    • C. 

      Both of these

    • D. 

      None of these

  • 14. 
    Which of the following data structure is linear data structure?
    • A. 

      Trees

    • B. 

      Graphs

    • C. 

      Arrays

    • D. 

      None of these

  • 15. 
    The operation of processing each element in the list is known as
    • A. 

      Sorting

    • B. 

      Merging

    • C. 

      Inserting

    • D. 

      Traversal

  • 16. 
    Finding the location of the element with a given value is:
    • A. 

      Traversal

    • B. 

      Search

    • C. 

      Sort

    • D. 

      None of the above

  • 17. 
    Arrays are best data structures
    • A. 

      for relatively permanent collections of data

    • B. 

      For the size of the structure and the data in the structure are constantly changing

    • C. 

      both of these situation

    • D. 

      None these situation

  • 18. 
    Linked lists are best suited
    • A. 

      for relatively permanent collections of data

    • B. 

      For the size of the structure and the data in the structure are constantly changing

    • C. 

      for both of these situation

    • D. 

      None of these situation

  • 19. 
    Each array declaration need not give, implicitly or explicitly, the information about
    • A. 

      the name of array

    • B. 

      the data type of array

    • C. 

      the first data from the set to be stored

    • D. 

      the index set of the array

  • 20. 
    The elements of an array are stored successively in memory cells because
    • A. 

      By this way computer can keep track only the address of the first element and the addresses of other

    • B. 

      the architecture of computer memory does not allow arrays to store other than serially

    • C. 

      Both of these

    • D. 

      Non of these

  • 21. 
    The memory address of the first element of an array is called
    • A. 

      floor address

    • B. 

      foundation address

    • C. 

      First address

    • D. 

      Base address

  • 22. 
    . Which of the following data structures are indexed structure?
    • A. 

      linear arrays

    • B. 

      linked lists

    • C. 

      Both

    • D. 

      None

  • 23. 
    Which of the following is not the required condition for binary search algorithm?
    • A. 

      The list must be sorted

    • B. 

      there should be the direct access to the middle element in any sublist

    • C. 

      There must be mechanism to delete and/or insert elements in list

    • D. 

      None of these

  • 24. 
    Which of the following is not a limitation of binary search algorithm?
    • A. 

      Must use a sorted array

    • B. 

      requirement of sorted array is expensive when a lot of insertion and deletions are needed

    • C. 

      there must be a mechanism to access middle element directly

    • D. 

      D) binary search algorithm is not efficient when the data elements are more than 1000.

  • 25. 
    Two dimensional arrays are also called
    • A. 

      tables arrays

    • B. 

      matrix arrays

    • C. 

      Both

    • D. 

      None