See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

New updates

Searching for :Name the resistant organic material present in pollen grainsDate:2019-05-27 02:20:58Done by:Anonymous user(Visitor)Searching for :Name the resistant organic material present in pollen grainsDate:2019-05-27 02:20:43Done by:Anonymous user(Visitor)

Searching for :Name the resistant organic material present in pollen grainsDate:2019-05-27 02:20:20Done by:Anonymous user(Visitor)

### Similar Questions

**Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements: -gate computer science 2017**

1 Answer

**Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest pat**

1 Answer

**The graph shown below 8 edges with distinct integer edge weights. -gate-cse-2015**

1 Answer

**Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. Which of the following is FALSE?-computer science-gate-2007**

1 Answer

**Let G be a weighted graph with edge weights greater than one and Gbe the graph constructed by squaring the weights of edges in G. Let T and T be the minimum spanning trees of G and G, respectively, with total weights t and t. Which of the following i**

1 Answer

**Let G be an undirected connected graph with distinct edge weight. GATE CSE 2000**

1 Answer

**Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to A -gate-cse-2012**

1 Answer

**how to find the number of bounded faces in an undirected graph?**

1 Answer

**Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ____. Gate-cs-2016**

1 Answer

**Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree GATE CSE 2000**

1 Answer

**Let G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to -gate-computer science-2012**

1 Answer

**L et G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to TD. (A cross edge in G is between two nodes neither of which is an ancestor of the other in TD.) (II) For every edge (u,v) of G, if u is at depth i and v is at depth j in TB, then |𝑖 − 𝑗| = 1. Which of the statements above must necessarily be true?**

1 Answer

**L et G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1,2, … , 100. There is an edge between vertices 𝑢 and 𝑣 if and only if the label of 𝑢 can be obtained by swapping two adjacent numbers in the label of 𝑣. Let 𝑦 denote the degree of a vertex in G, and 𝑧 denote the number of connected components in G. Then, 𝑦 + 10𝑧 = _____.**

1 Answer

**Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-computer science-2012**

1 Answer

**Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? -gate-computer science-2012**

1 Answer

**Which of the following statements are TRUE? -gate-computer science-2013**

1 Answer

**Let G be the non-planar graph with the minimum possible number of edges. Then G has -computer science-gate-2007**

1 Answer

**In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by -computer science-gate-2007**

1 Answer

**Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______________.-gate-cse-2015**

1 Answer

**A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flipflop as follows. -gate-cse-2015**

1 Answer

### Notes

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-6**

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-10**

**GATE-Computer-Science-Engineering-2017**

**Page Ranking Techniques In Search Engines**

**Operating Systems [10CS53] unit-4**

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-7**

**GATE-Biotechnology-2017**

**gate 2017 biotech**

**gate 2017 biotech**

**Data structure with C 10CS35 unit-6**

Loading More post

## Which of the following statements is correct?

a. Static analysis tools produce statistics during program executionb. Configuration management systems allow us to provide accurate defect statistics of

different configurations

c. Stress testing tools examine the behaviour of the test object at or beyond full lo ad

d. Performance measurement tools can be used in all phases of software life-cycle

Asked by:softwareTester

Taged users:

Likes:

Be first to like this question

Dislikes:

Be first to dislike this question

Talk about this Delete Like Dislike

AnswersStress testingis a software testing activity that determines the robustness of software by testing beyond the limits of normal operation. Stress testing is particularly important for "mission critical" software, but is used for all types of software.Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this Delete Like Dislike

## Can you help us to add better answer here? Please see this

Below are some of the videos from our collection.Check out our video platform here.

Lets together make the web is a better placeWe made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams"with these.Answer a question:You can answer the questions not yet answered in eduladder.How to answer a questionCareer:Work or do your internship with us.Work with usCreate a video:You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder