New updates

Searching for :BotanyDate:2019-03-19 18:00:09Done by:Anonymous user(Visitor)Searching for :protein deficiency diseases is known asDate:2019-03-19 17:46:40Done by:Anonymous user(Visitor)

Searching for :difference between western & eastern ghatsDate:2019-03-19 17:45:55Done by:Anonymous user(Visitor)

Never Miss an Update

##### Subscribe to eduladder news letter Today

##### Like to work with us?

### 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

**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

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

1 Answer

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

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

**Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. -gate-cse-2015**

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-cse-2012**

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**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2004 download**

## View question

## Q.62) Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists a Turning machine M which given an input x in A*, always halts with f(x) on its tape. Let Lf denotes the language {x#f(x)|x∈A*}. Which of the following statements is true? -gate computer science 2017

A) f if computable if and only if Lf is recursive.B) f if computable if and only if Lf is recursive enumerable.C) if f is computable then Lf is recursive, but not conversely.D) if f is computable then Lf is recursively enumerable, but not conversely.Asked by:satyashiromani

Taged users:

Msshikhilsatyashiromanipankajvaishnavi-DeshpandeUmangiamknownharshshah822ThreeRedbatsam22Oshal-BorkardeepuckrajManisha12Syedazaibunissaazher-khanpallaviaithalnAmoghleobeboMukil-lovanshi-tarun10113priyaOsho-meditation-center-banglore-nisargaOSHO-bookssameekshyathegdxrathinlz04milanyoyoyogmailcommilan-ransinghJessika-K

Likes:

deepuckraj

Dislikes:

Be first to dislike this question

## Comments

## Type your comment here