Question 1
For showing your current location
For finding path
For finding shortest path
none of them
Good Job!
Oops!
For finding the shortest path. Explanation: Yes, Google Maps uses graphs to identify the shortest, but may be some improved t path. They are definitely not using Dijkstra\'s algorithm to find the shortest path, but may be some improved version of dijkstra’s combined with other shortest path algorithms like A*. Dijkstra’s is just a starting point, and hence is not the most efficient algorithm. Different algorithms work differently in different use cases . hence algorithms need to be chosen intelligently based on the situation. I think that’s what Google Maps does.
Please login to submit your explanation
You can check your performance of this question after Login/Signup
Start
Question 2
A. Google Map
B. Zomato
C. Ola App
D. All of above
Answer :: (D) EXPLANATION : All the Application which uses maps for their application uses graph data structure.
Question 3
Stack
Queue
Trees
Graph theory
All the information of the friends that are add in your friends list and the suggestion you got so they are the friend of your friends in facebook so these all information are saved in the node and they are connected to each other via edges.
Question 4
List
String
Graph
It arranges the data in a sorted order and there exists a relationship between the data elements. So it’s a property of non linear data structure.
Question 5
Tightly connected
Loosely connected
Strongly connected
Weakly connected.
Graph is strongly connected if there is a path between any two pairs of vertices. For example following graph is strongly connected
Question 6
Adjacency list
Adjacency matrix
Adjacency list and adjacency matrix
None of them
These are the two methods to represent the graph.
Question 7
O(n*m) and O(n+m)
O(n^m) and O(n+m)
O(n+m) and O(n*m)
O(m*n) and O(n^m)
Answer :: (C) EXPLANATION : Complexity for adjacency list = O(n+m) Complexity for adjacency matrix = O(n*m) Reason : In a adjacency list for every vertex there is a linked list which have the values of the edges to which it is connected.
Question 8
O(V)
O(E)
O(V+E)
O(V*E)
because here we need to check every vertices and edges.
Question 9
6
5
4
7
If, b is starting node Stack will be like: b/0/15 c/1/10 e/2/9 d/3/8 f/4/5 g/6/7 a/11/14 h/12/13 So node f take 5 time to visit
Question 10
bachedgf
bcaedfgh
both A and B
Neither A nor B
Method 1 start - {b} {b,c,a} {b,c,a,e} {b,c,a,e,d} {b,c,a,e,d,f,g} or {b,c,a,e,d,g,f} Method 2 start - {b} {b,a,c} {b,a,c,h} {b,a,c,h,e} {b,a,c,h,e,d} {b,a,c,h,e,d,f,g} or {b,a,c,h,e,d,g,f}
Please login to report
Buy TCS NQT Paid Materials
Join TCS NQT Online Classes
Login/Signup
Personalized Analytics only Availble for Logged in users
Analytics below shows your performance in various Mocks on PrepInsta
Your average Analytics for this Quiz
Rank
-
Percentile
0%
Completed
0/0
Accuracy
July 14, 2019
Login/Signup to comment
Login/Signup to comment