1. In a graph if e=(u,v) means ___________
SHOW ANSWER
Correct Ans:e begins at u and ends at v
Explanation:
2. A _________ is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
SHOW ANSWER
Correct Ans:Directed tree
Explanation:
3. A graph is said to be ___________ if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
SHOW ANSWER
Correct Ans:Bipartite
Explanation:
4. In the _________ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
SHOW ANSWER
Correct Ans:Depth First
Explanation:
5. A directed graph is ___________ if there is a path from each vertex to every other vertex in the digraph.
SHOW ANSWER
Correct Ans:Strongly Connected
Explanation:
6. An adjacency matrix representation of a graph cannot contain information of :
SHOW ANSWER
Correct Ans:parallel edges
Explanation:
7. A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are
SHOW ANSWER
Correct Ans:more than n(n-1)/2
Explanation:
8. A digraph is strongly connected under what condition?
SHOW ANSWER
Correct Ans:A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa.
Explanation:
SHOW ANSWER
Correct Ans:(u, v) where v is a proper descendent of u in the tree.
Explanation:
SHOW ANSWER
Correct Ans:(u, v) where u and v are not ancestor or descendent of one another
Explanation:
11. What is generally true of Adjacency List and Adjacency Matrix representations of graphs?
SHOW ANSWER
Correct Ans:Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2)
Explanation:
12. The relationship between number of back edges and number of cycles in DFS is,
SHOW ANSWER
Correct Ans:There is no relationship between no. of edges and cycles
Explanation:
13. Which is true statement in the following?
SHOW ANSWER
Correct Ans:Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges )
Explanation:
14. What algorithm technique is used in the implementation of Kruskal solution for the MST?
SHOW ANSWER
Correct Ans:Greedy Technique
Explanation:
15. Dijkstra's algorithm :
SHOW ANSWER
Correct Ans:Has greedy approach to compute single source shortest paths to all other vertices
Explanation:
16. The number of edges in a simple, n-vertex, complete graph is
SHOW ANSWER
Correct Ans:n*(n-1)/2
Explanation:
17. A graph 'G' with 'n' nodes is bipartite if it contains
SHOW ANSWER
Correct Ans:no cycle of odd length
Explanation:
18. The spanning tree of connected graph with 10 vertices contains
SHOW ANSWER
Correct Ans:9 edges
Explanation:
19. Graphs are represented using
SHOW ANSWER
Correct Ans:Adjacency linked list
Explanation:
20. Let A be an adjacency matrix of a graph G, the ijth entry in the matrix A power k gives expected number of collections involving a particular key x is
SHOW ANSWER
Correct Ans:shortest path of k edges from vertex vi to vertex vj
Explanation:
Are you seeking for good platform for practicing Data Structure questions in online. This is the right place. The time you spent in Fresherslive will be the most beneficial one for you.
Online Test on Data Structure @ Fresherslive
This page provides important questions on Data Structure along with correct answers and clear explanation, which will be very useful for various Interviews, Competitive examinations and Entrance tests. Here, Most of the Data Structure questions are framed with Latest concepts, so that you may get updated through these Data Structure Online tests. Data Structure Online Test questions are granted from basic level to complex level.
Why To Practice Data Structure Test questions Online @ Fresherslive?
Data Structure questions are delivered with accurate answer. For solving each and every question, very lucid explanations are provided with diagrams wherever necessary.
Practice in advance of similar questions on Data Structure may improve your performance in the real Exams and Interview.
Time Management for answering the Data Structure questions quickly is foremost important for success in Competitive Exams and Placement Interviews.
Through Fresherslive Data Structure questions and answers, you can acquire all the essential idea to solve any difficult questions on Data Structure in short time and also in short cut method.
Winners are those who can use the simplest method for solving a question. So that they have enough time for solving all the questions in examination, correctly without any tense. Fresherslive provides most simplest methods to answer any tough questions. Practise through Fresherslive test series to ensure success in all competitive exams, entrance exams and placement tests.
Why Fresherslive For Data Structure Online Test Preparation?
Most of the job seekers finding it hard to clear Data Structure test or get stuck on any particular question, our Data Structure test sections will help you to success in Exams as well as Interviews. To acquire clear understanding of Data Structure, exercise these advanced Data Structure questions with answers.
You're Welcome to use the Fresherslive Online Test at any time you want. Start your beginning, of anything you want by using our sample Data Structure Online Test and create yourself a successful one. Fresherslive provides you a new opportunity to improve yourself. Take it and make use of it to the fullest. GOODLUCK for Your Bright Future.