## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

I Semester Supplementary Examination November, 2003

1

APPLIED SYSTEMS ENGINEERING (Computer Science and Systems Engineering) Time: 3 hours Max. Marks:80 Answer any Five questions All question carry equal marks --1.a) Draw all simple graphs of one, two, three and four vertices. b) Prove that the maximum number of edges in a simple graph with n vertices is n(n-1)/2. 2.a) b) 3.a) b) 4.a) b) What are isomorphic graphs? Describe the properties of isomorphic graphs with the help of suitable illustrations. Prove that any connected graph with n vertices and n-1 edges is a tree. What is a binary tree? Describe the properties of binary trees with suitable illustrations. What is the edge connectivity of the complete graph of n vertices? What is a planner graph ? Describe the properties of planar graph. Prove that the number of spanning trees in a connected labeled graph with nullity µ cannot exceed the number. 1 2µ − 2 o 2 µ − 21 2 µ − 2 2 .................. 2 µ − 2 µ −1 . µ! 5.a) What is an incidence matrix ? Find the incidence matrix for the following graph.

(

)(

)(

)

(

)

b)

What is a circuit matrix? Describe its properties with suitable illustration. contd…2.

Code No. NR-211502 6.a)

-2-

Set No.1

Prove that an n-vertex digraph is strongly connected if and only if the matrix M, defined by M = x + x2 + x3 …….. xn , has no zero entry. X is the adjacency matrix. Sketch and explain all different (nonisomorphic) simple diagraphs with 1, 2, 3 and 4 verticals. Prove that the capacitor of the following figure is a time-invariant, casual system.

b) 7.a)

Fig. b) The following figure illustrates a birdged – T network Write the differential equation relating the output voltage e2(t) and the input voltage e1 (t).

Fig. 8. Write short notes on the following: a) b) c) Systems with multiterminal components Linear graph models Non – linear systems. -x-

Set No. Code No. NR-211502 II B.Tech. I Semester Supplementary Examination November, 2003

2

APPLIED SYSTEMS ENGINEERING (Computer Science and Systems Engineering) Time: 3 hours Max. Marks:80 Answer any Five questions All question carry equal marks --1.a) Prove that an infinite graph with a finite number of edges (i.e. a graph with a finite number of edges and an infinite number of vertices ) must have an infinite number of isolated vertices. b) What are “ isolated vertex” and “ pendant vertex”? With the help of suitable illustrations, explain them in detail. 2.a) b) 3.a) b) What are “ Halmiltonian circuits”? Prove that a Halmiltonian circuit in a graph of n vertices consists of exactly n edges. What is a tree? Describe the differences between trees and graphs. Prove that a path is its own spanning tree. Pick an arbitrary spanning tree in the graph as given in fig. List all seven fundamental cut-sets with respect to this tree.

Fig. 4.a) b) 5.a) b) Describe the properties of “Cut-sets”. Prove that in a tree, every vertex of degree greater than one is a cut-vertex. Show that the usual operation of substraction does not satisfy the associative axiom. Sketch all distinct (nonisomorphic) orientations of a complete graph of four vertices. Characterize each of the resulting digraphs in terms of binary relations. Prove that every Euler digraph (without isolated vertices) is strongly connected. Also show, by constructing a counter example, that the converse is not true. Contd…2.

Code No. NR-211502 6.a) b)

-2-

Set No.2

What is a cut-set matrix? Describe its properties with a suitable illustrative situation. What is an adjacency matrix ? Draw adjacency matrix for the following fig.

fig. 7.a) b) 8. What are discrete-time systems? Write the applications of discrete-time systems. What are signal flow graphs? Explain the signal flow-graph terminology with suitable illustrations. Write short notes on the following: a) System modeling b) Linear graphs models c) Formulation of system equations.

-x-

Set No. Code No. NR-211502 II B.Tech. I Semester Supplementary Examination November, 2003

3

APPLIED SYSTEMS ENGINEERING (Computer Science and Systems Engineering) Time: 3 hours Max. Marks:80 Answer any Five questions All question carry equal marks --1.a) Define “ finite” and infinite” graphs. Describe their differences with necessary illustrations. b) Draw graphs representing problems of i) two houses and three utilities ii) four houses and four utilities viz : water, gas, electricity and telephone. 2.a) b) 3.a) b) 4.a) What are “ Connected graphs” and “ disconnected graphs” ? Describe their differences with suitable example illustrations. What is a spanning tree? Describe the properties of spanning trees. Describe the properties of trees. Prove that a tree with n vertices has n-1 edges. Prove that every connected graph with three or more vertices has at least two vertices which are not cut-vertices. If every region of a simple planar graph (with n vertices and e edges) embedded k (n − 2) in a plane is bounded by k edges, show that e = . k −2 Prove that in any vector space the null vector 0 is orthogonal to every vector in the space. What is a circuit matrix? Describe its properties. Draw circuit matrix for the following graph.

b) 5.a)

Fig. b) Characterize simple, self-dual graphs in terms of their circuit and cut-set matrices. Contd..2.

Code No. NR-211502 6.a)

-2-

Set No.3

What is a digraph ? Describe its properties. Draw adjacency matrix for the following digraph.

Fig. b) 7.a) b) 8. Sketch all different (non isomorphic) simple digraphs with 1,2 and 3 vertices. What is a system? Describe the basic concepts of systems with a suitable case situation. Describe the topological models of systems . Write short notes on the following. a) Formulation of system equations. b) Discrete-time systems c) Linear lumped models.

-x-

Set No. Code No. NR-211502 II B.Tech. I Semester Supplementary Examination November, 2003 APPLIED SYSTEMS ENGINEERING (Computer Science and Systems Engineering) Time: 3 hours Max. Marks:80 Answer any Five questions All question carry equal marks --1.a) Describe the applications of graphs. b) Prove that the number of vertices of odd degree in a graph is always even. 2.a) b) What are Euler graphs? Describe their properties and explain with suitable illustrations. What is a spanning tree? Sketch all Spanning trees of the graph in fig. 1.

4

3.a) b) 4.a)

Fig. 1 Prove that a Halmiltonian Path is a spanning tree . Prove that any circuit in a graph G must have at least one edge in common with a chord set. Draw the geometric dual of the following graph.

Fig. 2 Contd..2.

Code No. NR-211502 b) 5.a)

-2-

Set No.4

Give a set { x,y,z} of three elements, prove that there is only one group possible with this set. What is an adjacency matrix? What are its properties? Draw adjacency matrix for the following figure.3

Fig. b) What is a circuit matrix ? Describe its properties. Draw the circuit matrix for the following figure 4.

Fig. 6.a) b) Prove that in any digraph the sum of the in-degrees of all vertices is equal to the sum of their out-degrees; and this sum is equal to the number of edges in the digraph. Prove that every edge in a digraph belongs to th directed circuit or a directed cutset.

Contd..3.

Code No. NR-211502 7.a)

-3-

Set No.4

Prove that the system of fig. 5 is linear

fig. 5 b) 8. Give a classification scheme of systems. Explain about deterministic and stochastic systems. Write short notes on the following a) Systems optimization b) Discrete-time systems c) Linear graph terminology. -x-

- Sap Hana Graph Reference en (Hana2.0 Sps 02)uploaded byИгорь Катричек
- metcalfeuploaded bySwetha Yatham
- Beyond the XML Reporting Basics - XML Graphs and Chartsuploaded bySoumyajeet Banerjee
- partitioning for Complex Objectivesuploaded bycowboy47
- Lyon Multi 1uploaded byJanLeida
- Modern Graph Theory (1)uploaded byLêNhậtHoàng
- Casarottouploaded byEpic Win
- 10.1.1.52uploaded byKevin Skout
- Hamiltonian path reccurent formulauploaded byAkso Vaxo
- Data structures mcqsuploaded byYatin Relhan
- Men Into Miceuploaded byviveksahu87
- Greedy Techniquesuploaded bySiddhant Singh
- mgvuploaded byanalysis23
- Louis H. Kauffman- Wang Algebra and the Spanning Trees of a Graphuploaded byOkomm
- Introduction of Graph Thoryuploaded byPity Parker
- Choice Structuresuploaded byLavanya Heroine
- Backtracking Dfs Bfsuploaded bykatzumato
- IIT Madras Written and Interview Questions 2013uploaded byAarif Shaikh
- QM Ch12 Network Models_Zaferuploaded byHusukic Alen
- Linear Index Coding via Graph Homomorphismuploaded byRoozbeh Bassirian
- 50 Ideas Startersuploaded by3alliumcourt
- Cp7201 Tfoc Model Qp 2 Theoretical Foundations of Computer Scienceuploaded byappasami
- cseyr1uploaded byAnonymous WAIDC7m3kx
- Approximation Algorithmic Performance for CEDS in Wireless Networkuploaded byRahul Sharma
- MTH202 Final Term 2009 Paperuploaded bymajidva.com
- Outcomes Satgyre 3uploaded bydunbogan
- module 1 parent letteruploaded byapi-291222441
- DAA_UNIT2uploaded byVasantha Kumari
- msms2uploaded byttungl
- Conspiracy To Murder Joshua Israeluploaded byJoshua J. Israel

- 41 Mca or Software Engineeringuploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- 42 Mca Nr Programming in Javauploaded bySrinivasa Rao G
- r6 42 Mca Advanced Java Programming Set1uploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- r05320403 Microwave Engineeringuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- Rr322305 Immunologyuploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r05320205 Switchgear and Protectionuploaded bySrinivasa Rao G
- r05320305 Design of Machine Members IIuploaded bySrinivasa Rao G
- r5 402 Mba Management of Technology Set1uploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- Nr-35-Mca-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r6 47 Mca Distributed Operating Systems Set1uploaded bySrinivasa Rao G
- Or 32 Mcacomputer Communication Networksuploaded bySrinivasa Rao G
- r5 304 Mba Enterprise Resource Planninguploaded bySrinivasa Rao G
- r5 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G
- r6 33 Mca Unix Networks Programming Set1uploaded bySrinivasa Rao G
- r6 48 Mca Mobile Computing Set1uploaded bySrinivasa Rao G
- r6 34 Mca Management Information Systems Set1uploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- Nr 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G
- r5 408 Mba Decision Support Systems Set1uploaded bySrinivasa Rao G
- Or 34 Mca Management Information Systemsuploaded bySrinivasa Rao G
- Nr 31 Mca Database Management Systemsuploaded bySrinivasa Rao G
- Nr 302 Mba Cost and Management Accounting Set1uploaded bySrinivasa Rao G
- r5 410 Mba Management of Change Set1uploaded bySrinivasa Rao G

Read Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading