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

A data structure is a way of storing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications.

Following are some Data Structure Sample questions:

  1. What is data structure?

    Answer: A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.

  2. List out the areas in which data structures are applied extensively?

    Answer: The name of areas are:

    • Compiler Design,
    • Operating System,
    • Database Management System,
    • Statistical analysis package,
    • Numerical Analysis,
    • Graphics,
    • Artificial Intelligence,
    • Simulation

  3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.

    Answer: The major data structures used are as follows:

    • RDBMS - Array (i.e. Array of structures)
    • Network data model - Graph
    • Hierarchical data model - Trees

  4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

    Answer: The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.

  5. Minimum number of queues needed to implement the priority queue?

    Answer: Two. One queue is used for actual storing of data and another for storing priorities.

  6. What is the data structures used to perform recursion?

    Answer: Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls.

    Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

  7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?

    Answer: Polish and Reverse Polish notations.

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.