Data Structure & Algorithyms

15 Questions

Settings
Please wait...
Data Structure Quizzes & Trivia

Lets Check Yourself. . . . . .


Questions and Answers
  • 1. 
    The situation when in a linked list START=NULL is
    • A. 

      Underflow

    • B. 

      Overflow

    • C. 

      Housefull

    • D. 

      saturated

  • 2. 
    On which prinicple does stack work?
    • A. 

      FILO

    • B. 

      FIFO

    • C. 

      LILO

    • D. 

      Both a and c above

  • 3. 
     Which data structure allows deleting data elements from front and inserting at rear?
    • A. 

      Stacks

    • B. 

      Queues

    • C. 

      Deques

    • D. 

      Binary search tree

  • 4. 
     Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
    • A. 

      Input-restricted deque

    • B. 

      Output-restricted deque

    • C. 

      Priority queues

    • D. 

      None of above

  • 5. 
     Which of the following data structure is non-linear type?
    • A. 

      Strings

    • B. 

      Lists

    • C. 

      Stacks

    • D. 

      None of above

  • 6. 
    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 elements can be calculated

    • B. 

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

    • C. 

      Both of above

    • D. 

      none of above

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

      Floor address

    • B. 

      Foundation address

    • C. 

      First address

    • D. 

      Base address

  • 8. 
    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 above

  • 9. 
    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. 

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

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

      tables arrays

    • B. 

      Matrix arrays

    • C. 

      Both of above

    • D. 

      None of above

  • 11. 
     A variable P is called pointer if
    • A. 

      P contains the address of an element in DATA.

    • B. 

      P points to the address of first element in DATA

    • C. 

      P can store only memory addresses

    • D. 

      P contain the DATA and the address of DATA

  • 12. 
    Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
    • A. 

      Elementary items

    • B. 

      Atoms

    • C. 

      Scalars

    • D. 

      All of above

  • 13. 
    • A. 

      Arrays are dense lists and static data structure

    • B. 

      Data elements in linked list need not be stored in adjecent space in memory

    • C. 

      pointers store the next data element of a list

    • D. 

      Linked lists are collection of the nodes that contain information part and next pointer

  • 14. 
    The depth of a complete binary tree is given by
    • A. 

      Dn = n log2n

    • B. 

      Dn = n log2n+1

    • C. 

      Dn = log2n

    • D. 

      Dn = log2n+1

  • 15. 
    An algorithm that calls itself directly or indirectly is known as
    • A. 

      Sub algorithm

    • B. 

      Recursion

    • C. 

      Polish notation

    • D. 

      Traversal algorithm