Data Structure Interview Questions Answers
Interview is the main part of every selection process, so those candidates who are going to attend the technical interview they can check Data Structure Interview Questions Answers through this page. Freshers/ Experienced job hunters can take the advantage from these questions in their preparations by downloading the free pdf format through online process.
Data Structure Interview Questions Answers
Ques:1 List out the areas in which data structures are applied extensively?
- Compiler Design,
- Operating System,
- Database Management System,
- Statistical analysis package,
- Numerical Analysis,
- Artificial Intelligence,
Ques:2 Minimum number of queues needed to implement the priority queue?
Ans: Two. One queue is used for actual storing of data and other for storing priorities.
Ques:3 What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
Ans: Polish and Reverse Polish notations
Ques:4 List out few of the applications that make use of Multilinked Structures?
Ans: Sparse matrix and Index generation
Ques:5 In an AVL tree, at what condition the balancing is to be done?
Ans: If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than -1 then the balancing can be done.
Ques:6 In RDBMS, what is the efficient data structure used in the internal storage representation?
Ans: B+ tree. For the reason that in B+ tree, all the data is stored only in leaf nodes, that formulates searching easier. This corresponds to the records that shall be stored in leaf nodes.
Ques:7 What is the bucket size, when the overlapping and collision occur at same time?
Ans: The Bucket size is one. If there is only one entry feasible in the bucket, when the collision occurs, there is no method to contain the colliding value. This results in the overlapping of values.
Ques:8 What are the types of Collision Resolution Techniques and the methods used in each of the type?
Ans: There are two types of Collision Resolution Techniques:
- Open addressing (closed hashing), the methods used comprise: Overflow block.
- Closed addressing (open hashing), the methods used comprise: Linked list, Binary tree.
Ques:9 Whether Linked List is linear or Non-linear data structure?
Ans: The Linked lists can be both linear and Non-linear data structure in different manner:
- According to Access strategies Linked list is a linear data structure.
- According to Storage Linked List is a Non-linear data structure.
Ques:10 What do you mean by free pool?
Ans: Pool is a list containing of vacant memory cells which has its own pointer.
Ques:11 What is difference between Stack and Queue data structure?
Ans: The main difference is that Stack is LIFO (Last In First Out) data structure while Queue is a FIFO (First In First Out) data structure.
Ques:12 What is a linked list?
Ans: A linked list is a series of nodes in which every node is connected to the node subsequent it. This makes a chain-like link of data storage.
Ques:13 What is the difference between a PUSH and a POP?
Ans: Pushing and popping relate to the way data is stored and retrieved in a stack. A push indicates data being inserted to it, meaning data is being “pushed” into the stack. On the other hand, a pop indicates data retrieval, and in particular refers to the uppermost data being accessed.
Ques:14 What are the major data structures used in the following areas : RDBMS, Network data model and Hierarchical data model.
Ans: RDBMS = Array (i.e. Array of structures)
Network data model = Graph
Hierarchical data model = Trees
Ques:15 If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
Ans: The heterogeneous linked list includes different data types in its nodes and we require a link, pointer to join them. It is not possible to utilize ordinary pointers for this. So we use void pointer. Void pointer is competent of storing pointer to any type as it is a generic pointer type.
Ques:16 What is the type of the algorithm used in solving the 8 Queens problem?
Ques:17 Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Ans: No. The Minimal spanning tree guarantees that the whole weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes implicated in the minimum-spanning tree is minimum.
Ques:18 Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations.
Ans: Prefix Notation: – * +ABC ^ – DE + FG
Postfix Notation: AB + C * DE – FG + ^ –
Ques:19 What are the methods available in storing sequential files?
- Straight merging,
- Natural merging,
- Polyphase sort,
- Distribution of Initial runs
Ques:20 What is the data structures used to perform recursion?
Ans: Stack. Because of its LIFO (Last In First Out) property it memorizes its ‘caller’ so knows whom to respond 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 corresponding iterative (non-recursive) function. Even when such equivalent iterative processes are written, explicit stack is to be used.
Something That You Should Put An Eye On
|How to Write a Good Resume||Personality Improvement Tips|
|Interview Questions and Answers||Group Discussion: Dos and Don’ts|
|Common Interview Mistakes||Phone Interview Tips|
|How To Dress For An Interview||Why Should We Hire You?|