Sample Questions Best site for GRE, LSAT, SAT, GMAT, TOEFL, CCNA, CCSA and interview sample questions  

Technical Sample Questions : C |  C++ |  Oracle |  Java | Unix |  Operating Systems |  Data Structure

Technical Sample Questions

Data Structure Sample Questions

  1. For the given graph, draw the DFS and BFS?


    • BFS: A X G H P E M Y J
    • DFS: A X H P E Y M J G

  2. Classify the Hashing Functions based on the various methods by which the key value is found.

    Answer: The list of Hashing functions is as follows:

    • Direct method
    • Subtraction method
    • Modulo-Division method
    • Digit-Extraction method
    • Mid-Square method
    • Folding method
    • Pseudo-random method

  3. What are the types of Collision Resolution Techniques and the methods used in each of the type?

    Answer: The types of Collision Resolution Techniques are:

    • Open addressing (closed hashing)
      The methods used include:
      • Overflow block
    • Closed addressing (open hashing)
      The methods used include:
      • Linked list
      • Binary tree

  4. In RDBMS, what is the efficient data structure used in the internal storage representation?

    Answer: B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.

  5. Draw the B-tree of order 3 created by inserting the following data arriving in sequence - 92 24 6 7 11 8 22 4 5 16 19 20 78


  6. What is a spanning Tree?

    Answer: A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

  7. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

    Answer: No. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

  8. Convert the given graph with weighted edges to minimal spanning tree.

    Answer: the equivalent minimal spanning tree is:

« Previous || Next »

Data structure Sample Question Number : 1-7| 8-15| 16-21| 22-29| 30-32
Sample Test Questions
GRE Sample Questions
CAT Sample Questions
GMAT Sample Questions
TOEFL Sample Questions
ACT Sample Questions
SAT Sample Questions
LSAT Sample Questions
PSAT Sample Questions
MCAT Sample Questions
PMP Sample Questions
GED Sample Questions
ECDL Sample Questions
DMV Sample Questions
CCNA Sample Questions
MCSE Sample Questions
Network+ Sample Questions
A+ Sample Questions
Technical Sample Questions
WASL Sample Questions
CISA Sample Questions

Other Sample Questions
Sample Interview Questions
Sample Teacher Interview Questions
Sample Citizenship Questions
Accuplacer Sample Questions
Science Bowl sample Questions
Driving Test Sample Questions
Sample Survey Questions Sample Essay Questions
Sample Behavioral Interview Questions

Copyright © 2004-2013, Best BSQ. All Rights Reserved.