Data structure is a way to store and organize data in a computer system, so that we can use the data easily. That is, the data is stored and organized in such a way that it can be easily accessed later at any time.
Data Structure is not a programming language like C, C++, Java, but it is a set of algorithms that we use to structure data in programming languages.
Lets check it out some important Data structure one line questions which are based on liner and non-linear data structures.
|
Q 31.
______ is very useful in situation where data have to stored and then retrieved in reverse order ?
Ans.
Stack
|
|
Q 32.
______ is a strcuture in which items are added it one end and deleted from the other ?
Ans.
Queue
|
|
Q 33.
_______ level is where the model become competible with executable code ?
Ans.
Implementation level
|
|
Q 34.
A binary search tree, whose left subtree and right subtree is differ in height by at most 1 unit is called ?
Ans.
AVL tree
|
|
Q 35.
What is the Acyclic graph ?
Ans.
A simple diagram which does not have any cycles is called Acyclic graph.
|
|
Q 36.
Which traversal stratgies are used in traversing a Graph ?
Ans.
Depth first and Breadth first search
|
|
Q 37.
Which two algorithm is used to find Minimum spanning tree ?
Ans.
Krushal and Prism algorithm
|
|
Q 38.
What is the meaning of Graph Travesal ?
Ans.
Traversing a graph is an efficient way to visit each vertex and edge exactly once.
|
|
Q 39.
What do you mean by Articulation point in Graph ?
Ans.
If a graph is not connected, the vertics whose removal would disconnect the graph are known as artickulation point.
|
|
Q 40.
What is Deque (Double Ended Queue) ?
Ans.
In this queue insertion and deletion are made at both the front and rear end of the queue
|
|
Q 41.
What is the Infix to Prefix converion rule ?
Ans.
Move operator one by one to the Left
|
|
Q 42.
What is the Infix to Postfix conversion rule ?
Ans.
Move operator one by one to the Right
|
|
Q 43.
What are the basic operation perfomed on Stack ?
Ans.
Push, Pop, Peek and Empty
|
|
Q 44.
What are the two types of Linked list ?
Ans.
Double linked list and Circuler linked list
|
|
Q 45.
List some Dynamic data strcutures ?
Ans.
Linked list, Stack, Queue and Tree
|
|
Q 46.
List some static data structure in C ?
Ans.
Array, Pointer, Stcuture etc.
|
|
Q 47.
How many different tree are possible with 3 nodes ?
Ans.
5
|
|
Q 48.
When can you tell that a memory leak will occur ?
Ans.
A memory leak occurs when a program loses the ability to free a block of dynamically allocated memory.
|
|
Q 49.
What is the difference between Null and Void pointer ?
Ans.
Null can be value for pointer type variable. Void is a type identifier which has not size.
|
|
Q 50.
Is pointer is a variable ?
Ans.
Yes
|
|
Q 51.
What is the significance of '*' ?
Ans.
Declare a pointer
|
|
Q 52.
How do you assign an address to an element of a pointer array ?
Ans.
Using & operator
|
|
Q 53.
Run time memory allocation is also known as ?
Ans.
Dynamically allocating memory
|
|
Q 54.
Is empty() member function determine ?
Ans.
It will check if the stack has at least one element.
|
|
Q 55.
Which process places data at the back of the Queue ?
Ans.
Enqueue
|
|
Q 56.
What does each entry in the link list called ?
Ans.
Node
|
|
Q 57.
Which member function places a new node at the end of the Linked list ?
Ans.
append node () member function
|
|
Q 58.
Which file contains the definition of Member functions ?
Ans.
Linkedlist.cpp file
|
|
Q 59.
Which is the simplest file structure ?
Ans.
Sequential
|
|
Q 60.
Does the minimum spanning tree of a graph give the Shortest distance between any two specified nodes ?
Ans.
No
|