CurrentGK Papers GAT(Graduate Aptitude Test In Engineering)

Gate Electronics & Communication3
Gate Electronics & Communication3 1 The drain of an n-channel MOSFET is shorted to the gate so that VGS = VDS. The threshold voltage (VT) of MOSFET is 1 V. If the drain current (ID) is 1 mA for VGS = 2V, then for VGS = 3V, ID is
A) 2 mA
B) 3 mA
C) 9 mA
D) 4 mA
Instrumentation Engineering Sample Questions 3
Instrumentation Engineering Sample Questions 3 Questions And Answers No. Question 1 A surface height profile is given by, y = a + b sin  2p x l  (0x l) where a, b, l are constants and x is the horizontal ....
Gate Electronics & Communication4
Gate Electronics & Communication4 Q-1 A circuit has a resistance of 11 W, a coil of inductive reactance 120 W, and a capacitor with a 120-W reactance, all connected in series with a 110-V, 60-Hz power source. What is the potential difference across each circuit element?

A) (a) ....
Gate Information Technology
Gate Information Technology 1 A subnet has been assigned a subnet mask of What is the maximum number of hosts that can belong to this subnet?
A) 14
B) 30
C) 62
D) 126
Answer : (C)

2 Which one of the following is NOT shared by the ....
GATE Exam Papers - (Computer Science ) - Part 1
GATE Exam Papers - (computer science ) - Part 1 Que. 1 Context-free languages are closed under:
A Union , intersection
B Union , Kleene closure
C Intersection, complement
D Complement, Kleene Closure

Que. 2 Let L p be the set of all languages accepted by a ....
THEORY OF COMPUTATION 6 Q101. Let L0={<G,G’,0>|G,G’ are the encodings of cfgs that generate infinte languages}

And L1={<G,G’,1>|G,G’ are the encodings of cfgs that either one or both do not generate infinite sets}.Let L=L0UL1. Let L’ be ....
THEORY OF COMPUTATION 4 Q81. Let L be a language accepted by some nondeterministic multitape turing machine and L1 its complement also accepted by a two pushdown tape machine then choose the correct statement

a) L is recursively enumerable but not necessarily recursive

THEORY OF COMPUTATION 4 Q61. Consider two languages L1 and L2 each on the alphabet S . Let f: S ->S be a polynomial time computable bijection such that (Ñ x)[xe L2]. Further, let f^-1 be also polynomial time computable.

Which of the following CANNOT be true?

THEORY OF COMPUTATION 3 Q41. If the strings of a language L ={<M>| M is an encoding of turing machines that have more than 34567890 states}, can be effectively enumerated in lexicographic (i.e. alphabetic) order, which of the following statements is true?

a) L is ....
THEORY OF COMPUTATION 2 Q21. Nobody knows at present if P=NP.

Consider the definition of L below

L=(a^ib^jc^k|i>j>k} if the sum of subsets problem is in P

L=(a^ib^jc^k|i,j,k all unequal} if P is not the same as NP

a. L is regular and ....

1 2 3 4

Current Affairs
♦ PRAGATI प्‍लेटफार्म एक _____________ स्तरीय प्रणाली है। » 3
♦ अंतर्राष्ट्रीय शिक्षा दिवस कब मनाया गया? » 24 जनवरी
♦ अंतर्राष्ट्रीय शिक्षा दिवस कब घोषित किया गया था? » 3 दिसंबर, 2018
♦ भारत-पाकिस्तान युद्ध कब स्थापित किया गया था? » 1965
♦ शिक्षा का अधिकार भारतीय संविधान के ____________ में डाला गया था » अनुच्छेद 21-ए
♦ ऑपरेशन शरद हवा कब खत्म हुआ? » 27 जनवरी, 2021
♦ शिक्षा का अधिकार ____________ आयु वर्ग के बच्चों के लिए एक बुनियादी अधिकार है। » 6 से 14
♦ मानव अधिकारों की सार्वभौमिक घोषणा के ____________ में शिक्षा का अधिकार शामिल है। » अनुच्छेद 26
♦ पेरियार टाइगर रिजर्व कहाँ स्थित है? » केरला
♦ नवंबर 2020 तक, भारत की स्थापित सौर ऊर्जा क्षमता ____________ है » 36.9 GW