Advanced Data Structures And Algorithm Test! Trivia Quiz

25 Questions | Total Attempts: 501

SettingsSettingsSettings
Advanced Data Structures And Algorithm Test! Trivia Quiz - Quiz

We all know the importance of having access to your data when you need it. It is therefore important to ensure that data is collected and organized accurately; this is achieved in various ways. Test your knowledge of data structure and algorithm by taking the quiz below. Best of luck!


Questions and Answers
  • 1. 
    What is reference variable in C++
    • A. 

      Behaves like a pointer variable

    • B. 

      Holds address while declaring itself

    • C. 

      Can be used for call by reference

    • D. 

      All

  • 2. 
    A recursive function will be infinite recursive if the following were left out
    • A. 

      Base criteria

    • B. 

      Recursive call

    • C. 

      Loop

    • D. 

      Variable delcaration

  • 3. 
    Time taken to insert an element in a queue is
    • A. 

      O(log n)

    • B. 

      1

    • C. 

      O(n)

    • D. 

      None

  • 4. 
    What are the 3 imp features of OOPS
    • A. 

      Encapsulation,inheritance,polymorphism

    • B. 

      Datahiding,exception handling,templates

    • C. 

      Inheritance,operator overloading

    • D. 

      None

  • 5. 
    Time taken to insert in to a linked queue
    • A. 

      O(log2n)

    • B. 

      O(n)

    • C. 

      O(nlog2n)

    • D. 

      O(1)

  • 6. 
    An application uses encapsulation to achive
    • A. 

      Information or data hiding

    • B. 

      Minimize independence among modules

    • C. 

      Make implementation independent

    • D. 

      All

  • 7. 
    OOP allow extension of object function  or class of function.This ability with in OOP is called
    • A. 

      Extendability

    • B. 

      Extension capacity

    • C. 

      Virtual extension

    • D. 

      Scalabilty

  • 8. 
    In single linked list we can traverse from back to front
    • A. 

      True

    • B. 

      False

  • 9. 
    Using Double linked lists we can implement deque
    • A. 

      True

    • B. 

      False

  • 10. 
    Application of satack is
    • A. 

      BFS

    • B. 

      Railway reservation

    • C. 

      Recursion

    • D. 

      None

  • 11. 
    In a Binary tree we can insert___________ nodes as its children
    • A. 

      1

    • B. 

      2

    • C. 

      3

    • D. 

      >=4

  • 12. 
    Friend function is
    • A. 

      An inline function

    • B. 

      Violates class property

    • C. 

      Always preferable

    • D. 

      None

  • 13. 
    Abstract class
    • A. 

      Can be instantiated

    • B. 

      Can be inherited

    • C. 

      Have only virtual functions

    • D. 

      None

  • 14. 
    Can we use friend function for overlaoding= operator
    • A. 

      We can

    • B. 

      We can n't

    • C. 

      By writing outside definition

    • D. 

      None

  • 15. 
    Virtual base class is
    • A. 

      Usefull to avoid ambiguity in hybrid inheritance in accessing grand parent by grand child

    • B. 

      A virtual function

    • C. 

      Can not exist any where

    • D. 

      Having only pure virtual functions

  • 16. 
    Sparse matrix is
    • A. 

      With more no of 1's

    • B. 

      Mostly with 0s

    • C. 

      Non singular matrix

    • D. 

      Have diagnal elements as zeros

  • 17. 
    A multiply list is
    • A. 

      A list in which each node is multiplied with other nodes

    • B. 

      A list in which each node has muliple fields

    • C. 

      Used as representation of sparse matrix

    • D. 

      B&c

  • 18. 
    Hashing is
    • A. 

      A statement as header file inclusion

    • B. 

      Address finding in sequential file organition

    • C. 

      Address finding in random file organition

    • D. 

      None

  • 19. 
    In fold and  method of hashing we can
    • A. 

      Fold only digits

    • B. 

      Fold from both sides

    • C. 

      We can fold either from left or right or both sides

    • D. 

      Is not a method of hashing

  • 20. 
    We can overload ___ operators
    • A. 

      Sizeof

    • B. 

      ::

    • C. 

      ->

    • D. 

      =

    • E. 

      None

  • 21. 
    If we use protected as access specifier in accessing base class ,the private member in base class becomes________ in derived class
    • A. 

      Public

    • B. 

      Private

    • C. 

      Protected

    • D. 

      Not accessible

  • 22. 
    Containership in c++ refers to
    • A. 

      Declaring objects of a class as memebers in another class

    • B. 

      Contains data in private only

    • C. 

      Contains constant member functions

    • D. 

      None

  • 23. 
    C++ was developed by
    • A. 

      Dennis ritch

    • B. 

      Mark yordan

    • C. 

      Alen rux

    • D. 

      Stroustrup

    • E. 

      CoadYarden

  • 24. 
    All search trees will have traversing techniques
    • A. 

      True

    • B. 

      False

    • C. 

      True or false

    • D. 

      None

  • 25. 
    The tree traversals are
    • A. 

      Dfs,bfs

    • B. 

      Inorder,preorder,postorder

    • C. 

      MSP,DSP,TSP

    • D. 

      None

Back to Top Back to top
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.