Data Structure Interview Questions And Answers on algorithm for viva and freshers also c data structure concepts , linked list ,queue and tree structure with recursion in data structure just need to fill the form and send us we will send all the answers to them and it for both freshers and experienced condidate
|Questions : 1||What is data structure?|
|Answers : 1||
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.
|Questions : 2||List out the areas in which data structures are applied extensively?|
|Answers : 2||
|Questions : 3||What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.|
|Answers : 3||
=>RDBMS - Array (i.e. Array of structures)
|Questions : 4||If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
|Answers : 4||
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. .
|Questions : 5||Minimum number of queues needed to implement the priority queue?|
|Answers : 5||
Two. One queue is used for actual storing of data and another for storing priorities. .
|Questions : 6||What is the data structures used to perform recursion?|
|Answers : 6||
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.
|Questions : 7||What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?|
|Answers : 7||
Polish and Reverse Polish notations.
|Questions : 8||Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations.|
|Answers : 8||
Prefix Notation: ^ - * +ABC - DE + FG Postfix Notation: AB + C * DE - - FG + ^
|Questions : 9||Sorting is not possible by using which of the following methods?
|Answers : 9||
|Questions : 10||What are the methods available in storing sequential files ?|
|Answers : 10||
|Questions : 11||List out few of the Application of tree data-structure?|
|Answers : 11||
a>The manipulation of Arithmetic expression,
|Questions : 12||List out few of the applications that make use of Multilinked Structures?|
|Answers : 12||
a> Sparse matrix,
|Questions : 13||15. In tree construction which is the suitable efficient data structure?
(b) Linked list
|Answers : 13||
(b) Linked list
|Questions : 14||What is a spanning Tree?Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?|
|Answers : 14||
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.
No. minimum spanning tree of a graph give the shortest distance between any 2 specified node 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.
|Questions : 15||Which is the simplest file structure?
|Answers : 15||
|Questions : 16||Whether Linked List is linear or Non-linear data structure?|
|Answers : 16||
According to Access strategies Linked list is a linear one.
|Questions : 17||28. Of the following tree structure, which is, efficient considering space and time complexities?
(a) Incomplete Binary Tree
(b) Complete Binary Tree
(c) Full Binary Tree
|Answers : 17||
(b) Complete Binary Tree.
|Questions : 18||In RDBMS, what is the efficient data structure used in the internal storage representation?|
|Answers : 18||
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.
|Questions : 19||25. What are the types of Collision Resolution Techniques and the methods used in each of the type?|
|Answers : 19||
a> Open addressing (closed hashing),
The methods used include:
|Questions : 20||Classify the Hashing Functions based on the various methods by which the key value is found.|
|Answers : 20||
=> Subtraction method,
|Questions : 21||In an AVL tree, at what condition the balancing is to be done?|
|Answers : 21||
If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.