6 views

Uploaded by Parameshwar Reddy Kottapalli

testing

- Design and Analysis
- OR_SW_0
- A Novel Approach
- MIT6_042JF10_assn05.pdf
- Linkage learning using the maximum spanning tree of the dependency graph
- Reinhard Diestel, Saharon Shelah and Juris Steprans- Characterizing Dominating Graphs
- A Randomized Linear-time Algorithm to Find Minimum Spanning Trees (KARGER, David R.; KLEIN, Philip N.; TARJAN, Robert E., 1995)
- MA241 - Combinatorics
- Minimum Spanning Trees
- Test
- Easy Mod Probs-sol
- Greedy 3
- Genus Distribution for a Graph
- CSEGATE
- Minimum Spanning Trees
- Advanced Data Structures and Algorithms
- Jan A. Kneissler- On Spaces of connected Graphs II: Relations in the algebra Lamda
- Proj8 Delivery Service (1)
- S S D P P Labelling of Snake Graphs Sunoj
- Barbara Hammer et al- Recursive self-organizing network models

You are on page 1of 9

2 Marks Incorrect

false

true

2 Marks Incorrect

tree

branch

edge

leaf

3. Trees are simple graphs and they contain at least one ___________.

2 Marks Correct

Loop

Parallel edges

Vertex

Pendent vertex

2 Marks Incorrect

length

vertex

hight

branch

2 Marks Correct

closed

uniform

open

identical

2 Marks Correct

n-1

n-2

n+1

2 Marks Correct

Point

branch

edge

cut vertex

8. Let T be a graph on p vertices and q edges. If T is tree then T has no circuit and q = p-1.

2 Marks Correct

true

false

2 Marks Correct

false

true

10. Different spanning trees in connected graph G will have same weights.

2 Marks Incorrect

true

false

11. A tree in which exactly one vertex is distinguishable form all their vertices is called ______ tree.

2 Marks Correct

spanning

rooted

shortest spanning

longest spanning

2 Marks Correct

spanning tree

rooted tree

binary tree

13. A tree in which exactly one vertex is of degree 2, and remaining vertices are of degree 3 or 1 is called

as_______.

2 Marks Correct

spanning tree

rooted tree

2 Marks Correct

2 Marks Correct

false

true

2 Marks Correct

true

false

17. _________ is an uninformed search method that aims to expand and examine all nodes of a graph or

combination of sequences by systematically searching through every solution.

2 Marks Correct

BFS

DFS

Binary search

2 Marks Correct

false

true

19. A rooted binary tree is a tree with a root node in which every node has at most _______ children.

2 Marks Correct

20. Kruskals algorithm is an algorithm in graph theory that nds a minimum spanning tree for a connected

weighted graph.

2 Marks Correct

true

false

21. A spanning tree with weight less than or equal to the weight of every other spanning tree is called a

__________.

2 Marks Incorrect

binary tree

weighted tree

subgraph

2 Marks Correct

path

cycle

walk

trial

2 Marks Correct

true

false

2 Marks Incorrect

false

true

2 Marks Correct

path

cycle

walk

trial

26. The walk in which no vertex is repeated more than once is called a ______.

2 Marks Correct

path

cycle

walk

trial

2 Marks Incorrect

- Design and AnalysisUploaded byflame1406
- OR_SW_0Uploaded bynoah
- A Novel ApproachUploaded bychettyravi
- MIT6_042JF10_assn05.pdfUploaded byMuhammad Naffah Amin
- Linkage learning using the maximum spanning tree of the dependency graphUploaded byMartin Pelikan
- Reinhard Diestel, Saharon Shelah and Juris Steprans- Characterizing Dominating GraphsUploaded byJtyhmf
- A Randomized Linear-time Algorithm to Find Minimum Spanning Trees (KARGER, David R.; KLEIN, Philip N.; TARJAN, Robert E., 1995)Uploaded byGaKeGui
- MA241 - CombinatoricsUploaded byRebecca Rumsey
- Minimum Spanning TreesUploaded byWaseem Khan
- TestUploaded byArun
- Easy Mod Probs-solUploaded byYonatan Ysrael Zurita
- Greedy 3Uploaded byAditya D R
- Genus Distribution for a GraphUploaded byDon Hass
- CSEGATEUploaded bySaritha Ceela
- Minimum Spanning TreesUploaded byAkila Rajasekaran
- Advanced Data Structures and AlgorithmsUploaded byToaster97
- Jan A. Kneissler- On Spaces of connected Graphs II: Relations in the algebra LamdaUploaded byGmonicon
- Proj8 Delivery Service (1)Uploaded byDavid Song
- S S D P P Labelling of Snake Graphs SunojUploaded byInternational Journal of Advanced and Innovative Research
- Barbara Hammer et al- Recursive self-organizing network modelsUploaded byGrettsz
- D1 2008-01Uploaded bymizmell
- Evaluation of a Topological Distance Algorithm for Construction of a P2P Multicast Hybrid Overlay TreeUploaded byAIRCC - IJCNC
- Determination of the shortest balanced cycles in QC-LDPC codes MatrixUploaded byCyberJournals Multidisciplinary
- Elective 4 the Mathematics of GraphsUploaded byGwen Fedilus Fabrero
- Greedy (1).pdfUploaded byAdit Bhardwaj
- Complex HemiolasUploaded byasketh
- Apps_Ch13 (1).pdfUploaded bySanthosh Kumar Kodhandapani
- AlgorithmsUploaded byJorge Louro
- Ada Lab 2009Uploaded byMonk Dhariwal
- AlamgirLuxburg2010_[0]Uploaded byAnirban Chakraborty

- SAP FioriUploaded byParameshwar Reddy Kottapalli
- Flasshcards1Uploaded byParameshwar Reddy Kottapalli
- Ora Interview Questions1Uploaded byParameshwar Reddy Kottapalli
- Chapter 1Uploaded byAryan
- Marketing Lesson 1Uploaded byParameshwar Reddy Kottapalli
- Marketing Text bookUploaded bySandeep Dinesh
- SAP BCDBORADBA Database Administration SAPDBAUploaded byTaeko Carroll
- SAP BCDBORADBA Database Administration SAPDBAUploaded byTaeko Carroll
- GA1700075 MK640E DQ 1_01Uploaded byParameshwar Reddy Kottapalli
- Orientation Lesson2Uploaded byParameshwar Reddy Kottapalli
- Orientation Lesson3Uploaded byParameshwar Reddy Kottapalli
- Chapter2 AdaptingUploaded byParameshwar Reddy Kottapalli
- Chapter2 AdaptingUploaded byParameshwar Reddy Kottapalli
- How to Transport SAP Role Simply 20090806Uploaded byRajagopalan Muthukrishnan
- Marketing , Macro1Uploaded byParameshwar Reddy Kottapalli
- moriarty_app9_inppt_02.pptxUploaded byParameshwar Reddy Kottapalli
- rwcon60& f60genUploaded byParameshwar Reddy Kottapalli
- MK640E DQ 3-2Uploaded byParameshwar Reddy Kottapalli
- Create ASM on WindowsUploaded byParameshwar Reddy Kottapalli
- Create ASM.txtUploaded byParameshwar Reddy Kottapalli
- Oracle Apps Concurrent ManagerUploaded bychanchal chachan
- 2 Marketing Lesson 3Uploaded byParameshwar Reddy Kottapalli
- 2-Principles of marketing.pptUploaded byaqeelkhan7942
- 2-Principles of marketing.pptUploaded byaqeelkhan7942
- Ethics or MoralityUploaded byParameshwar Reddy Kottapalli
- What Are the Basic Components of AutoConfigUploaded byParameshwar Reddy Kottapalli
- Index 2Uploaded byrajapps
- Multi Org SetupUploaded byParameshwar Reddy Kottapalli
- Chapter2 AdaptingUploaded byParameshwar Reddy Kottapalli

- Reference Guide EnuUploaded byLiudas Vasaris
- MINI_PROJECT_HARUploaded byHarsha Vardhan Reddy
- AP Statistics on the Casio PrizmUploaded byrothstem
- QuickStart-TSwinNetUploaded byclaudir_calazans1092
- Suggested Stocktaking Procedure OverviewUploaded byayyazm
- Wireless Detection SystemUploaded bymaazio
- opm in chemical industryUploaded byconnecttoamit
- DIR-905L_B2_QIG_v3.10Uploaded byVicente
- Neural TuringUploaded byIamIN
- Graphics Lab Anna UniversityUploaded bydattatrayin2002
- Doc and Over InfinityUploaded byjohnspaterson
- SPM_Maintworld MVS120613Uploaded byWidodo Muis
- League of Minnesota Cities - Data Practices - Analyze Classify RespondUploaded byghostgrip
- Nutanix NPP Exam Study GuideUploaded byIvan Aliaga
- ScoringUploaded byOrlando Hernandez
- PC Magazine - Windows XP Digital.media Solutions - Wiley 2005Uploaded byJe
- BS EXP 4Uploaded bySunny Kumar
- Midterm Exam Summer SolutionUploaded byali
- Simulate ONTAP 8.2 Installation and Setup GuideUploaded byabdulbasit985
- Sg 247575Uploaded byQuant_Geek
- Exceptional c 47 Engineering Puzzles Programming Problems and Solutions PDFUploaded byTraci
- JavaScript Quiz Guide V3Uploaded byDavid Bumphis
- 5100 12. Post Inspection Sampling Mandatory sampling and inspection after 100% visual inspection. Sampling plan as per ANSI/ASQ Z1.4 – 2008 (or ISO 2859-1): General Inspection Level – II, Single sampling plans for Normal inspection with an AQL of 0.65%. Batch releasing criteria: NMT the specified number of units contains visible particulates. Special level sampling (reduced sample quantity) for destructive inspections (for powder filled, lyophilized products, coloured containers, etc.). AQL Failure Is the test Destructive ? Investigation Re-inspection of 100% units Batch Rejection Yes No PerformAQLinspection Slide No. 12 13. Particle Separation, Identification and Characterization Manufacturers should have knowledge on their particulate matter rejections. Type of particles. Source of each particle type. Routine trend / capability of particulate rejections. Morphology of each type of particle. Chemistry of each particle type. Manufacturers should have comprehensiveUploaded byschumon
- Mtc 3600 Theory of Operations 3Uploaded byOgi Handeka
- 7060 Risk Evaluation Matrix.xlsUploaded bysandeep_parameshwar
- 3_smtpUploaded byIJRAER
- Notification MPKV DEO PostsUploaded byHarishKasar
- Uninformed v8a2Uploaded bymynameisnothing
- 1Uploaded byMayure
- PDF Contrato Banca Electronic AUploaded byFranciscoJavierCira