Exams Net
Unrestricted Exams Practice
Home
Exams
Banking Entrance Exams
CUET Exam Papers
Defence Exams
Engineering Exams
Finance Entrance Exams
GATE Exam Practice
Insurance Exams
International Exams
JEE Exams
LAW Entrance Exams
MBA Entrance Exams
MCA Entrance Exams
Medical Entrance Exams
Other Entrance Exams
Police Exams
Public Service Commission (PSC)
RRB Entrance Exams
SSC Exams
State Govt Exams
Subjectwise Practice
Teacher Exams
SET Exams(State Eligibility Test)
UPSC Entrance Exams
Aptitude
Algebra and Higher Mathematics
Arithmetic
Commercial Mathematics
Data Based Mathematics
Geometry and Mensuration
Number System and Numeracy
Problem Solving
Board Exams
Andhra
Bihar
CBSE
Gujarat
Haryana
ICSE
Jammu and Kashmir
Karnataka
Kerala
Madhya Pradesh
Maharashtra
Odisha
Tamil Nadu
Telangana
Uttar Pradesh
English
Competitive English
CBSE
CBSE Question Papers
NCERT Books
NCERT Exemplar Books
NCERT Study Notes
CBSE Study Concepts
CBSE Class 10 Solutions
CBSE Class 12 Solutions
NCERT Text Book Class 11 Solutions
NCERT Text Book Class 12 Solutions
ICSE Class 10 Papers
Certifications
Technical
Cloud Tech Certifications
Security Tech Certifications
Management
IT Infrastructure
More
About
Contact Us
Our Apps
Privacy
+
-
Test Index
UPSC ESE 2026 Electronics and Telecommunications Paper
Show Para
Hide Para
Share question:
© examsnet.com
Question : 16 of 150
Marks:
+1
,
-0
Consider the following statements regarding Mason's gain formula
∑
k
=
1
k
P
k
Δ
k
δ
\sum\limits_{k=1}^{k} \;\frac{P_k \Delta k}{\delta}
k
=
1
∑
k
δ
P
k
Δ
k
1.
P
k
\;\; P_k
P
k
is the forward path transmittance of
k
t
h
k_{th}
k
t
h
path from a specified input node to an output node.
2.
Δ
\Delta
Δ
is the graph determinant which involves closed-loop transmittances and mutual interactions between non-touching loops.
3. The path factor
Δ
k
\Delta_{k}
Δ
k
for the kth path is equal to the value of the graph determinant of a now graph which exists aner erasing the
k
th
k_{\;\text{th }\;}
k
th
path from the graph.
Which of the above statements are correct?
1 and 2 only
1 and 3 only
2 and 3 only
1, 2 and 3
Validate
Go to Question:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
Prev Question
Next Question