View Full Version : Data Structures
- What is data structure
- List out the areas in which data structures are applied extensively
- What are the major data structures used in the following areas : RDBMS, Network data
- If you are using C language to implement the heterogeneous linked list, what pointer
- Minimum number of queues needed to implement the priority queue
- What is the data structures used to perform recursion
- What are the notations used in Evaluation of Arithmetic Expressions using prefix
- Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and
- What are the methods available in storing sequential files
- How many different trees are possible with 10 nodes
- List out few of the Application of tree data-structure
- List out few of the applications that make use of Multi linked Structures
- What is the type of the algorithm used in solving the 8 Queens problem
- In an AVL tree, at what condition the balancing is to be done
- What is the bucket size, when the overlapping and collision occur at same time
- There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could
- Whether Linked List is linear or Non-linear data structure
- Does the minimum spanning tree of a graph give the shortest distance between any 2
- What is a spanning Tree
- In RDBMS, what is the efficient data structure used in the internal storage represent
- What are the types of Collision Resolution Techniques and the methods used in each
- Classify the Hashing Functions based on the various methods by which the key value
- What data structures you will use if you want to go to first record from the last
- Sorting is not possible by using which of the following methods
- In tree construction which is the suitable efficient data structure
- Sort the given values using Quick Sort
- Of the following tree structure, which is, efficient considering space and time
- Which is the simplest file structure
- Given a height balanced tree. If we add one more node , how many nodes gets unbalance
- Given a arbitrary pointer to an element in a singly linked list
- What is the time complexity for its deletion
- Comparison between hash table and binary tree
- A choc late of size nXn is given and is to be made into pices of size 1x1. At a time
- In associated memory for fast accessing Which one is used
- In sorted table contains elements , which of the searching is false
- Which of the following is efficient in terms of space
- For a binary tree with n nodes, How many nodes are there which has got both a parent
- What data structures you should use for dictionary searching and it should be capable
- Which is the best scheduling alga
- The complexity of bubble sort is0(a),then k equals
- Recursive procedures are implemented by
- Which data structure is needed to convert infix notations to post fix Notations
- To sorting array of 10 elements which sorting is best
- To saving space point of view which sort is best
- Two sorted lists of n elements will take at least the order of complexity of
- A search procedure which associates an address with a key value and Provides
- A linear list in which elements can be added or removed at either end but not in the
- Which of the following sorting procedure is slowest
- A linear list of elements in which deletion can be done from one end (front) and
- Find the order of complexity of the programme
- Max and avg. height of sorted binary tree
- Average and worst time complexity in a sorted binary tree is
- In binary search tree which traversal is used for getting ascending Order values
- Preorder of A*(B+C)/D-G (*+ABC/-DG) is
- Precedence order from high to low in (( ) ++ /)
- How many null pointer are there in N number binary tree
- If heap sort contains n elements, no of comparisons required are
- The approximate ratio for no of internal nodes to total no is