DATA STRUCTURES INTERVIEW QUESTIONS
1. What is meant by Data structure?
Answer:
The data structure is the way of organizing, storing the data and retrieving the data. It is an organization of mathematical and logical concepts of data.
2. What are the types of Data structure?
Answer:
There seven types of data structure available.
1. One dimensional 2. Two Dimensional
3. Queue 4. Static data structure
5. Dynamic 6. Pointers
7. Null pointer
3. What is the classification of Data structure?
Answer:
1. Base data structure
2. Linear data structure
3. Non-linear data structure
4. Comparison
4. What is meant by Datatype?
Answer:
The datatype is a collection of data with similar characteristic and behavior.
5. What is meant by Primitive Data structure?
Answer:
The primitive data structures are the basic data structures which are atomic in nature.In programming world integer, float, real are called primitive data structure
6. What is meant by an Array?
Answer:
An array is a collection of similar data types.An array may contain any number of elements.
7. What are operations on Array?
Answer:
1. Searching
2. Sorting
3. Traversing
4. Inserting
8. What is meant by Stack?
Answer:
Stacks are followed the First Out(LIFO) lists where insertions and deletions take place only at one end.
9. What is meant by Bubble Sort?
Answer:
In this two consecutive elements are compared and are interchanged immediately.The large element in the array moves to the end of the array.
10. What is meant by Insertion In Data Structure?
Answer:
Insertion is the process for adding a new element in an array at a particular place.The element can be added in an array is a subject of space availability.
11. What is meant by Heterogeneous Data Structure?
Answer:
A Heterogeneous Structure contains data of different type.
12. What is meant by Homogeneous Data Structure?
Answer:
The data items are of the same type is called homogenous data structure.
13. What is meant by Linear Data Structure?
Answer:
A single level data Structure whose elements are stored in a sequence is called Linear Data Structure.
14. What is meant by Merging Sort in Data Structure?
Answer:
Merging sort is defined as the operation in the which the two or more array are combined to form a single array.
15. What is meant by Searching in Data structure?
Answer:
It is the operation in which the data structure is reached to find the occurrence of a specific data item.
16. What is meant by Solving in Data structure?
Answer:
It is a technique in which the array elements are arranged in a particular order.The order of arrangement may be ascending or descending.
17. What is meant by Traversal in Data structure?
Answer:
It is the operation in which each element of the data structure is accessed for information or processing and each element of the array is processed one by one.
18. What is meant by Stack?
Answer:
The stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO).
Stacks are extensively at every level of a modern computer system.
19. What are the Two operations involved in Stack?
Answer:
1. Pop
2. Push
20. What is the application of Stack?
Answer:
1. Evaluating arithmetic expressions
2. Function calls
3. Balancing the symbols
4. Tower of Hanoi
5. 8 Queen problem
21. What are the types of Expression in Data Structures?
Answer:
1.Infix expression
2. postfix expression
3. prefix expression
22. What is meant by Pushing In Stack?
Answer:
Pushing is the process of inserting an element in a stack.
23. What is meant by Poping in Stack?
Answer:
Poping is the process of deleting the element in a stack.
24. What is meant by Overflow?
Answer:
When the stack is full and no element can be accommodated in the stack this is called Overflow.
25. What is meant by Underflow?
Answer:
When a stack is empty and an element is tried to be deleted is called Underflow.
26. What is meant by Queue?
Answer:
A queue is a collection of data items in which the data insertions and retrieval can take place in two opposite directions.
27. What is the operation on Queues?
Answer:
1. Creating an empty queue
2. Find if the queue is empty
3. Insertion int a queue
4. Deletion from a queue
28. In Data, structure Queue is worked based on which principle?
Answer:
A queue is working with the principle of FIFO(First In First Out
29. What is meant by Enqueue?
Answer:
First new elements can be added to the rear of the queue.This operation is called Enqueue.
30. What is meant by Dequeue?
Answer:
Deque is an abstract data type having data items to which items may be added or deleted from both ends.
31. What is meant by Circular Queue?
Answer:
Circular queue elements are arranged in a circle form, in which rear and joins the first end, and it becomes circular queue.
32. What is meant by Tree in A Data Structure?
Answer:
A Tree is a widely used data structure that emulates a hierarichal tree structure with a set of linked nodes.
33. What is meant by Parent Node in a Tree?
Answer:
A node Whic is have a child is called a Parent node.
34. What is meant by Root node?
Answer:
The top most node in a tree is called the Root node.
35. What is meant by Leaf nod in Data Structure?
Answer:
Nodes at the bottom most of the tree are called Leaf Nodes.
36. What are the Application of the Trees?
Answer:
1.Manipulate Hierarichal Data
2. Make information easy to search
3. Manipulated sorted list of data
37. What is meant by Binary Tree in Data Structure?
Answer:
Binarty Tree is a finite set of nodes that is either empty or consists of a root and two disjoins binary trees called left and right subtrees.
38. What are th eproperties of the Binary Tree?
Answer:
1. A Binary Tree with N internal nodes has maximum of (N+1) nodes.
2. The external path length of any binary tree with N internal nodes is 2N greater than the internal path length.
3. The height of a full binary tree with N internal nodes is about Log2N
39. What is meant by Threading?
Answer:
Threading is a clever method that simplifies binary tree traversal.
40. What are the advantages of the Threaded Tree?
Answer:
1. Faster Traversal
2. Less memory storage
3. Great generality
41. What is meant by Expression Tree in Data Structure?
Answer:
Expression tree is a binary tree in which the leaf nodes are operands and the interior nodes are operators.
42. What is meant by Pre-order Walk?
Answer:
A walk in which each parent node is traversed before its children are called a Pre-order Walk.
43. What is meant by Post-order?
Answer:
A walk in which the children are traversed is called a post-order walk.
44. What is meant by Tree Traversal?
Answer:
Traversal is visiting every node of the tree exactly only once. A traversal produces a linear order for the information in a tree.
45. What is meant by AVL Tree?
Answer:
A balanced binary search treee where the height of the two subtrees of a node differs by at most one.
46. What is meant by GRAPH?
Answer:
A GRAPH is an abstract datype that consists of a set of nodes and a set of edges that establish relationships between the nodes.
47. What are the types of the Graphs?
Answer:
1.Directed graph
2. Undirected graph
48. What is meant by Hash Functions?
Answer:
Hash Functions is a function for summarizing or probabilistically identifying data.
49. What is meant by Depth First Search?(DFS)
Answer:
A Depth First Search is a technique for traversing a finite undirected graph.DFS visits the child nodes before visiting the sibling nodes.
50. What is meant by Breadth-First Search(BFS)
Answer:
A Breadth-First Search is a technique for traversing a finite undirectsd graph.It's first visit the sibling nodes before visiting child nodes.
51. What is meant by Kruskel's Algorithm?
Answer:
It is an algorithm in graph teroy that finds a minimum spanning tree for a connected weighted graph.
52. What is meant by Dijkstra's Algorithm?
Answer:
It solves th eproblem of finding the shortest path from a point in a graph to a destination.
1. What is meant by Data structure?
Answer:
The data structure is the way of organizing, storing the data and retrieving the data. It is an organization of mathematical and logical concepts of data.
2. What are the types of Data structure?
Answer:
There seven types of data structure available.
1. One dimensional 2. Two Dimensional
3. Queue 4. Static data structure
5. Dynamic 6. Pointers
7. Null pointer
3. What is the classification of Data structure?
Answer:
1. Base data structure
2. Linear data structure
3. Non-linear data structure
4. Comparison
4. What is meant by Datatype?
Answer:
The datatype is a collection of data with similar characteristic and behavior.
5. What is meant by Primitive Data structure?
Answer:
The primitive data structures are the basic data structures which are atomic in nature.In programming world integer, float, real are called primitive data structure
6. What is meant by an Array?
Answer:
An array is a collection of similar data types.An array may contain any number of elements.
7. What are operations on Array?
Answer:
1. Searching
2. Sorting
3. Traversing
4. Inserting
8. What is meant by Stack?
Answer:
Stacks are followed the First Out(LIFO) lists where insertions and deletions take place only at one end.
9. What is meant by Bubble Sort?
Answer:
In this two consecutive elements are compared and are interchanged immediately.The large element in the array moves to the end of the array.
10. What is meant by Insertion In Data Structure?
Answer:
Insertion is the process for adding a new element in an array at a particular place.The element can be added in an array is a subject of space availability.
11. What is meant by Heterogeneous Data Structure?
Answer:
A Heterogeneous Structure contains data of different type.
12. What is meant by Homogeneous Data Structure?
Answer:
The data items are of the same type is called homogenous data structure.
13. What is meant by Linear Data Structure?
Answer:
A single level data Structure whose elements are stored in a sequence is called Linear Data Structure.
14. What is meant by Merging Sort in Data Structure?
Answer:
Merging sort is defined as the operation in the which the two or more array are combined to form a single array.
15. What is meant by Searching in Data structure?
Answer:
It is the operation in which the data structure is reached to find the occurrence of a specific data item.
16. What is meant by Solving in Data structure?
Answer:
It is a technique in which the array elements are arranged in a particular order.The order of arrangement may be ascending or descending.
17. What is meant by Traversal in Data structure?
Answer:
It is the operation in which each element of the data structure is accessed for information or processing and each element of the array is processed one by one.
18. What is meant by Stack?
Answer:
The stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO).
Stacks are extensively at every level of a modern computer system.
19. What are the Two operations involved in Stack?
Answer:
1. Pop
2. Push
20. What is the application of Stack?
Answer:
1. Evaluating arithmetic expressions
2. Function calls
3. Balancing the symbols
4. Tower of Hanoi
5. 8 Queen problem
21. What are the types of Expression in Data Structures?
Answer:
1.Infix expression
2. postfix expression
3. prefix expression
22. What is meant by Pushing In Stack?
Answer:
Pushing is the process of inserting an element in a stack.
23. What is meant by Poping in Stack?
Answer:
Poping is the process of deleting the element in a stack.
24. What is meant by Overflow?
Answer:
When the stack is full and no element can be accommodated in the stack this is called Overflow.
25. What is meant by Underflow?
Answer:
When a stack is empty and an element is tried to be deleted is called Underflow.
26. What is meant by Queue?
Answer:
A queue is a collection of data items in which the data insertions and retrieval can take place in two opposite directions.
27. What is the operation on Queues?
Answer:
1. Creating an empty queue
2. Find if the queue is empty
3. Insertion int a queue
4. Deletion from a queue
28. In Data, structure Queue is worked based on which principle?
Answer:
A queue is working with the principle of FIFO(First In First Out
29. What is meant by Enqueue?
Answer:
30. What is meant by Dequeue?
Answer:
Deque is an abstract data type having data items to which items may be added or deleted from both ends.
31. What is meant by Circular Queue?
Answer:
32. What is meant by Tree in A Data Structure?
Answer:
A Tree is a widely used data structure that emulates a hierarichal tree structure with a set of linked nodes.
33. What is meant by Parent Node in a Tree?
Answer:
A node Whic is have a child is called a Parent node.
34. What is meant by Root node?
Answer:
The top most node in a tree is called the Root node.
35. What is meant by Leaf nod in Data Structure?
Answer:
Nodes at the bottom most of the tree are called Leaf Nodes.
36. What are the Application of the Trees?
Answer:
1.Manipulate Hierarichal Data
2. Make information easy to search
3. Manipulated sorted list of data
37. What is meant by Binary Tree in Data Structure?
Answer:
Binarty Tree is a finite set of nodes that is either empty or consists of a root and two disjoins binary trees called left and right subtrees.
38. What are th eproperties of the Binary Tree?
Answer:
1. A Binary Tree with N internal nodes has maximum of (N+1) nodes.
2. The external path length of any binary tree with N internal nodes is 2N greater than the internal path length.
3. The height of a full binary tree with N internal nodes is about Log2N
39. What is meant by Threading?
Answer:
Threading is a clever method that simplifies binary tree traversal.
40. What are the advantages of the Threaded Tree?
Answer:
1. Faster Traversal
2. Less memory storage
3. Great generality
41. What is meant by Expression Tree in Data Structure?
Answer:
Expression tree is a binary tree in which the leaf nodes are operands and the interior nodes are operators.
42. What is meant by Pre-order Walk?
Answer:
A walk in which each parent node is traversed before its children are called a Pre-order Walk.
43. What is meant by Post-order?
Answer:
A walk in which the children are traversed is called a post-order walk.
44. What is meant by Tree Traversal?
Answer:
Traversal is visiting every node of the tree exactly only once. A traversal produces a linear order for the information in a tree.
45. What is meant by AVL Tree?
Answer:
A balanced binary search treee where the height of the two subtrees of a node differs by at most one.
46. What is meant by GRAPH?
Answer:
A GRAPH is an abstract datype that consists of a set of nodes and a set of edges that establish relationships between the nodes.
47. What are the types of the Graphs?
Answer:
1.Directed graph
2. Undirected graph
48. What is meant by Hash Functions?
Answer:
Hash Functions is a function for summarizing or probabilistically identifying data.
49. What is meant by Depth First Search?(DFS)
Answer:
A Depth First Search is a technique for traversing a finite undirected graph.DFS visits the child nodes before visiting the sibling nodes.
50. What is meant by Breadth-First Search(BFS)
Answer:
A Breadth-First Search is a technique for traversing a finite undirectsd graph.It's first visit the sibling nodes before visiting child nodes.
51. What is meant by Kruskel's Algorithm?
Answer:
It is an algorithm in graph teroy that finds a minimum spanning tree for a connected weighted graph.
52. What is meant by Dijkstra's Algorithm?
Answer:
It solves th eproblem of finding the shortest path from a point in a graph to a destination.
No comments:
Post a Comment