testing

© All Rights Reserved

6 views

testing

© All Rights Reserved

- Graphviz and Dynagraph - Static and Synamic Graph Drawing Tools
- CS502 Fundamentals of Algorithms 2013 Final Term Mcqs Solved With References by Moaaz
- solu5
- Bfs
- 2010 Summer Camp - Alexander Remorov - Miscellaneous Problems
- Mining the Inner Structure of the Web Graph
- Graph Web
- Lecture 1
- Significance of Virtual Backbone in Wireless Ad Hoc Network
- Further results on Antimagic Digraphs
- Graphs
- Section
- Sokkalingam Inverse Mst
- Perfect Domination Excellent Trees
- absolute value my review2010 11
- Energy-Efficient Cooperative Video Distribution With Statistical QoS Provisions Over Wireless Networks
- Backtracking Programs
- Prefer Opposite
- RaoLect21
- Joint-Tree Model and the Maximum Genus of Graphs

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

- Graphviz and Dynagraph - Static and Synamic Graph Drawing ToolsUploaded byJeff Pratt
- CS502 Fundamentals of Algorithms 2013 Final Term Mcqs Solved With References by MoaazUploaded byShahrukh Usman
- solu5Uploaded byDevin Boyd
- BfsUploaded bysfernando
- 2010 Summer Camp - Alexander Remorov - Miscellaneous ProblemsUploaded byuthso roy
- Mining the Inner Structure of the Web GraphUploaded byapi-26490800
- Graph WebUploaded bymuhammad danish butt
- Lecture 1Uploaded bymcjack181
- Significance of Virtual Backbone in Wireless Ad Hoc NetworkUploaded byIJSTR Research Publication
- Further results on Antimagic DigraphsUploaded byIOSRjournal
- GraphsUploaded bySaharsh Deep Singh
- SectionUploaded bysujinisha
- Sokkalingam Inverse MstUploaded byVipul Mehta
- Perfect Domination Excellent TreesUploaded byDon Hass
- absolute value my review2010 11Uploaded byapi-90211937
- Energy-Efficient Cooperative Video Distribution With Statistical QoS Provisions Over Wireless NetworksUploaded byieeexploreprojects
- Backtracking ProgramsUploaded bySudhakar Singh
- Prefer OppositeUploaded byCamilo Ernesto Pardo Beainy
- RaoLect21Uploaded bySakura2709
- Joint-Tree Model and the Maximum Genus of GraphsUploaded byMia Amalia
- Graph Colouring (colorare graf)Uploaded byBicyy
- p716_yuchenglow_vldb2012Uploaded bymumusan1
- 5.isomorphism,subgraphUploaded byJeena Mathew
- Csci2100 09 FinalUploaded byenergy0124
- Colouring Graph PDFUploaded byNathan
- final.pdfUploaded byManoj Nanduri
- 2010 - Analyzing Social Media Networks With NodeXL - Figures as Slides 2socisl mediaSUploaded byLeyla Popova Zhuhadar
- Improved similarity measure in neutrosophic environment and its application in finding minimum spanning treeUploaded byMia Amalia
- Kenneth a. Ross, Charles R. Wright - Discrete Mathematics (2002, Prentice Hall)Uploaded byamy1gray-1
- 300+ algorithms mcq.pdfUploaded byGulshan Singh

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

- Binary Expression TreesUploaded byNandaShivani
- Optimal Binary Search TreeUploaded byTahaRazvi
- ADVANCED DATA STRUCTURESUploaded byvenkatesh
- hw06-solution.pdfUploaded bysiddharth1k
- solu9Uploaded byOpaque Cheshire
- Data Structures and Algorithms Binary Search TreeUploaded byShah Zeb Yousafzai
- C Program Day-19Uploaded byeshamu
- L19.Kd TreesUploaded byNageswara Rao Gottipati
- 18569_TREES [Read-Only] [Compatibility Mode].pdfUploaded byRickyJohn
- Quiz2Uploaded byPramod Srinivasan
- CS9215-SET I.pdfUploaded bysharmila
- Binary Search Tree(Insert,Deleting)Uploaded byrcpasc
- Data Structures Interview QuestionsUploaded bySahil Parmar
- Huffman-Java-Parte IUploaded byLULU CONTRERAS
- MinimumSpanningTrees MSTUploaded byikx00
- Tree Travers Al 06Uploaded byRohit Ramesh
- solutions-clrsUploaded byDrAmit Kumar Chandanan
- chapter5-2.pptUploaded byAnonymous igVRM2mA6k
- MIT6_006F11_lec06Uploaded byximbica
- CSCI 211 Test 2 ReviewUploaded byjaxakroiter
- Prims Algorithm on MSTUploaded bypremsk_09
- Red Black TreesUploaded bymahesh
- CFG-pumpingUploaded bySonaiya Mahesh
- Depth.docxUploaded byArockiaruby Ruby
- mY obstUploaded byBhavesh Rohida
- 14 3 DP Optimal Binary Search Trees 4upUploaded bycute_guddy
- Efficient Binary TreesUploaded byVishal Kumar
- 05 AVL Trees DeleteUploaded byMean Median
- Treap_reportUploaded byitzmanohar_bhat
- Solution Manual to Chapter 05Uploaded byVimox S Shah

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.