Call Support +91-85588-96644
TCYonline

Login

Sign Up

Please enter a Username or Email ID
Please enter a password
Keep me logged in
Please enter your name
Please enter your mobile number
You can't leave Captcha Code empty
By submitting this form, you agree to the Terms & Privacy Policy.
OR

Sign Up via Facebook

Sign Up via Google

Sign Up via Twitter

Download Software
Tests given

Download TCY App

App Image

General GATE Discussion

(60 Posts)

This thread is dedicated to discuss general GATE queries

Question should not exceed 100 characters.Use add options for multiple choice questions and "Uploadimage/Add related data" for passage text papers.
Question should be at least 10 characters long.
+
Add Options | Community Guidelines
Cancel
Rudra Prasad
Shared from GATE-2013 (EE) on Sep 16, 2025 12:35 PM

The following arrangement consists of an ideal transformer and an attenuator which attenuates by a factor of 0.8. An ac voltage VWX1 = 100 V is applied across WX to get an open circuit voltage across YZ. Next, an ac voltage VYZ2 = 100 V is applied across YZ to get an open circuit voltage VWX2 across WX. Then, are respectively

 
125/100 and 80/100
100/100 and 80/100
100/100 and 100/100
80/100 and 80/100
Please type your answer before submitting.

Your given answer is incorrect

Sumit Lahiri
Shared from GATE-2012 (CS) on Jan 11, 2019 12:50 PM

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root.
int height (treeptr n)

The appropriate expressions for the two boxes B1 and B2 are

 
B1: (1 + height (nright))
B2: (1 - max (h1, h2))
B1: (height (nright))
B2: (1 - max (h1, h2))
B1: height (nright)
B2: max (h1, h2)
B1: (1 + height (nright))
B2: max (h1, h2)
Please type your answer before submitting.

Yes, 1 needs to be added, But Option A is anyways wrong since it says 1 - max(h1, h2). Why SUBSTRACTION IN OPTION 1?????

Sumit Lahiri
Shared from GATE-2012 (CS) on Jan 11, 2019 12:46 PM

Let G be a weighted graph with edge weights greater than one and G` be the graph constructed by squaring the weights of edges in G. Let T and T` be the minimum spanning trees of G and G` respectively, with total weights t and t`. Which of the following statements is TRUE?

 
T` = T with total weight t` = t2
T` = T with total weight t` < t2
T` T but total weight t` = t2
None of these
Please type your answer before submitting.

Answer is wrong. It is B.

Revanth
Shared from Probability - 4 on Jan 08, 2019 11:34 PM

The probability of having 53 Mondays in a non-leap year is

 
2 7
3 7
1 7
None of these
Please type your answer before submitting.

Year can be normal or leap. So the answer should be 5/28

Gourab Chakraborty
Shared from Probability - 3 (Level: Easy) on Sep 30, 2018 8:52 PM

A person draws a card from a pack of 52 playing cards, replaces it and shuffles the pack. He continues doing this until he draws a spade. The chance that he will fail in the first two draw is

 
9 64
1 64
1 16
9 16
Please type your answer before submitting.

Probability of success is S = 1/4 probability of failure is Q= 3/4 from binomial theorem with n=2 r=0 we have ncr(P)^r(Q)^(n-r)= 2c0(1/4)^0(3/4)^2 = 9/16 ans