371 views

Uploaded by Prasad C M

- Graph Theory & Combinatorics June 2012
- Graph Theory & Combinatorics July 2011
- The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type
- Graph Theory & Combinatorics July 2008
- Graceful Graphs-Final Edition-89!12!15 (1)
- Graph Theory & Combinatories Jan 2014
- One Modulo n Gracefulness Of
- Graph Theory & Combinatorics Jan 2010
- Graph Theory & Combinatorics Dec 2010
- Coherent Groups and PMU
- Graph Theory & Combinatorics Dec 2012 NEW
- Ch11 Trees
- daa
- Graph Theory & Combinatorics Jan 2009 Old
- cdcSunum_V5
- Bounds on Szeged and PI Indexes in terms of Second Zagreb Inde
- GATE_CS-16_-SET-1b
- Course Outline
- Ramsey Numbers
- Trees

You are on page 1of 2

com

USN

l I I I I I I I I I I

Fourth Semester B.E. Degree Examination, May/June 2010 Graph Theory and Combinatorics

06CS42

Time: 3 hrs.

1

a.

Let G = (V, E) be the undirected graph in the Fig.l(a). How many paths are there in G from a to h? How many of these paths have a length 5? (07 Marks)

~

e______

Fig. I (a).

c.

(06 Marks) (07 Marks)

connected, can we identifY the graph G? Find an Euler circuit for the graph shown in the Fig. I (c). a.._ b c

Fig. l(c).

J

2

k.

a. b.

c.

Show that when any edge is removed from K 5 , the resulting subgraph is planar. Is this true for the graph K 3,3? (07 Marks) Nineteen students in a nursery school, play a game each day, where, they hold hands to form a circle. For how many days can they do this, w ith no student holding hands with the same (07 Marks) playmate twice? Define chromatic number. What is chromatic polynomial? State the decomposition theorem for chromatic polynomials. (06 Marks) A classroom contains 25 microcomputers, that must be connected to a wall socket that has four outlets. Connections are made by using extension cords, that have four outlets each. What is the least number cords needed to get these computers set up for class use?

(07 Marks)

a.

b. Explain the steps in the merge sort algorithm. (06 Marks) c. Using the weights 2, 3, 5, 10, 10, show that the height of the Huffman tree for a given set of weights is not unique. (07 Marks)

z ...

c: : t

0 0.

a. Apply Dijkstra algorithm to the weighted graph G = (V, E) shown in Fig.4(a) and determine the shortest distance from vertex a to each of the other vertices in the graph. (07 Marks)

b

't

Fig.4(a)

,

L

06CS42

b. Use Prim's algorithm to generate an optimal tree for the graph, shown in Fig.4(b). (06 Marks)

a.;

hS'

Fig.4(b). c. Let fbe a flow in a network N = (V, E). IfC = (P, P) is any cut inN, then prove that val (f) (07 Marks) cannot exceed C (P, P ).

5

In a certain implementation of the programming language Pascal, an identifier consists of a single letter or a letter followed by upto seven symbols, which may be letters or digits. (26 letters, 10 digits). There are 36 reserved words. How many distinct identifiers are (07 Marks) possible in this version of Pascal? b. How many bytes contain i) Exactly two 1's ; ii) Exactly four l 's ; iii) Exactly six 1's and iv) At least six 1's? (07 Marks) c. In how many ways can 10 (identical) dimes be distributed among five children i) If there are no restrictions ; ii) Each child gets at least one dime ; iii) The oldest child gets at least 2 dimes. (06 Marks) Determine the number of positive integers n where I s n s 100 and n is not divisible by 2, 3, 5. (07 Marks) b. In how many ways can one arrange the letters in CORRESPONDENTS so that i) There is no pair of consecutive identical letters ; ii) There are exactly two pairs of consecutive identical letters. (07 Marks) c. For the positive integers 1, 2, 3, 4, there are n derangements. Define derangements. What is the value of n? (06 Marks) a. a. Give the generating function for : i) 1, 1, 1, 1, ........ 1, 1, 1. .. . all terms are 1 ii) 1, 1, 1, 1, ........ 1,0,0,0 .. ... firsttetmsare l , othersareO iii) 0, 1, 2, 3...... .. (06 Marks) b. Find the generating function for Pd(n), the number of partitions of a positive integer n into (07 Marks) distinct summands. What is Pd(6) =? c. In each of the following, the function f(x) is the exponential generating function for the sequence li{), a1 , a2 ... . ... , whereas the function g(x) is the exponential generating function for the sequence b0 , b~, b2 ....... Express g(x) in terms off(x) if i) b3 = 3 and bn == an, n E N, n =~:- 3. ii) bt = 2, b2 =4, and bn = 2a0 , n EN, n l , 2. (07 Marks)

a.

Solve the following recurrence relation : an= 5an-l + 6an-2 n ~ 2 ao = 1, a1 = 3. (10 Marks) b. Solve the following recurrence relation: an+!- 2an = 2n , n ~ 0 <i<> = 1. (10 Marks) c. Solve the following recurrence relation using the method of generating functions : an+2- 5an+t + 6an = 2, n ~ 0, <i<> = 3, a 1 = 7.

a.

*****

- Graph Theory & Combinatorics June 2012Uploaded byPrasad C M
- Graph Theory & Combinatorics July 2011Uploaded byPrasad C M
- The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-TypeUploaded byRyanElias
- Graph Theory & Combinatorics July 2008Uploaded byPrasad C M
- Graceful Graphs-Final Edition-89!12!15 (1)Uploaded byrimalar
- Graph Theory & Combinatories Jan 2014Uploaded byPrasad C M
- One Modulo n Gracefulness OfUploaded byMegan Bell
- Graph Theory & Combinatorics Jan 2010Uploaded byPrasad C M
- Graph Theory & Combinatorics Dec 2010Uploaded byPrasad C M
- Coherent Groups and PMUUploaded byOscar Gómez
- Graph Theory & Combinatorics Dec 2012 NEWUploaded byPrasad C M
- Ch11 TreesUploaded byFaiza Shah
- daaUploaded byapi-279049687
- Graph Theory & Combinatorics Jan 2009 OldUploaded byPrasad C M
- cdcSunum_V5Uploaded byyiğit_Öksüz
- Bounds on Szeged and PI Indexes in terms of Second Zagreb IndeUploaded byDon Hass
- GATE_CS-16_-SET-1bUploaded byShivansh Tomar
- Course OutlineUploaded bySurapich Chairgulprasert
- Ramsey NumbersUploaded bysior_giggles
- TreesUploaded byjbond07
- Combinatorics Through Guided DiscoveryUploaded byStewart Stewart
- Redes de Petri S4PRUploaded byCarlos Panameño
- RAssign2-2013Uploaded byInzemamul Haque
- lambeth megan mt1finalUploaded byapi-406889630
- A Tradeoff Between Information and Communication in Braodcast.psUploaded byΟλυμπίδης Ιωάννης
- Pingserver and Client AppUploaded byKiran Kumar
- Design and AnalysisUploaded byflame1406
- TSL 5345 M&M Graph Lesson PlanUploaded byddougl18
- chopraUploaded byanon_405174746
- Branch_and_Bound.docUploaded bymansha99

- 2nd PUC PhysicsJan 2016.pdfUploaded byPrasad C M
- 2nd Sem DIP Applied Maths 2 - Dec 2015.pdfUploaded byPrasad C M
- 2nd PUC Biology Mid Term Nov 2015.pdfUploaded byPrasad C M
- 2nd PUC English Mid Term Nov 2015.pdfUploaded byPrasad C M
- 2nd PUC Kannada Jan 2016.pdfUploaded byPrasad C M
- 2nd PUC Chemistry Mid Term Nov 2015.pdfUploaded byPrasad C M
- 2nd PUC Mathematics Mid Term Nov 2015.pdfUploaded byPrasad C M
- 2nd PUC Chemistry Jan 2016.pdfUploaded byPrasad C M
- 2nd PUC English Jan 2016.pdfUploaded byPrasad C M
- 2nd Sem DIP Appied Mathematics 2 - May 2015.pdfUploaded byPrasad C M
- 2nd PUC Physics Mid Term Nov 2015.pdfUploaded byPrasad C M
- 2nd PUC Mathematics Test Sep 2015.pdfUploaded byPrasad C M
- 2nd PUC Kannada Mide Term Nov 2015.pdfUploaded byPrasad C M
- 2nd PUC Mathematics Jan 2016.pdfUploaded byPrasad C M
- 2nd PUC Biology Jan 2016.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - May 2010.pdfUploaded byPrasad C M
- 2nd SEM Electronics 1 - Nov 2011.pdfUploaded byPrasad C M
- 2nd SEM Electronics 1 - May 2011.pdfUploaded byPrasad C M
- 1st year DIP Communication Skills in English - Dec 2015.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - Dec 2013.pdfUploaded byPrasad C M
- 2nd SEM Electronics 1 - Nov 2010.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - Dec 2015.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - May 2013.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - May 2011.pdfUploaded byPrasad C M
- 2nd SEM Electronics 1 - Dec 2013.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - Dec 2012.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - May 2015.pdfUploaded byPrasad C M
- 2nd SEM Electronics 1 - Dec 2014.pdfUploaded byPrasad C M
- 2nd Sem DIP Electrical Circuits - Dec 2014.pdfUploaded byPrasad C M
- 2nd SEM Electronics 1 - May 2012.pdfUploaded byPrasad C M

- Some One Minute Science ExperimentsUploaded bythengodeet
- S05 Separata Método de MohrUploaded byLuz Urquiza Sanchez
- VJT6000 User Guide V1.3 (Re-saved)Uploaded byFernando Andree Salazar Alcantara
- Work and EnergyUploaded byEva
- SEISMIC ANALYSIS OF STEEL LIQUID STORAGE TANKS BY API-650Uploaded byhaschere
- Yuga Theory of Sri Yukteswar in the Holy ScienceUploaded byNagesh Kumar C S
- Ekt230 - Chap 1Uploaded byWan Mohd Nazmin
- chapter6.pptUploaded byAmit Rautela
- SYMC Eu IV DTC Description V1 070307[1]Uploaded bySooziet Regmi
- Effect of Heating and Cooling on Rheological Parameters of Edible Vegetable OilsUploaded byeuploide
- Yuri Taran_99_Native Gold in Mineral Precipitates Colima VolcanoeUploaded byHolisterf05LP
- Weather Station InstrumentsUploaded byElass Abdelkader
- EEE I & II.pdfUploaded byRaja Prabhu
- week_9.pdfUploaded byAnonymous k24jaL
- CHMA10H3F Lab Quiz Questions-4Uploaded byDennedy Yrvin Corcega
- Extraction of Malabar SpinachUploaded byMar Macaranas
- presentationUploaded bypwincess leiyka
- Case Study in SpainUploaded byCasovi Gitare
- God and the AstronomersUploaded byxal22950
- Rollarc R400Uploaded bycatalincc
- SCI ExpandedUploaded byVishnu Kumar Nadar
- OH LoggingUploaded byKarar AL-Dahlki
- Retaining walls_Failure modesUploaded byAbukalam Mulla
- Intro RobotUploaded byManivannan Jeeva
- 2nd [ASM International, ASM International] Istfa 2008 (B-ok.org)Uploaded byyang
- An Introduction to API 579 2006Uploaded byapi-3855165
- Fracture_anderson.pdfUploaded byIndranil Bhattacharyya
- Cohesion and Adhesion in Liquids.docxUploaded byjmlagumbay
- CWI-1Uploaded byDeepak Negi
- a129z4p117Uploaded byJhon Peñalva Sanchez