Most Important Questions for UGC NET Paper

1. A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possible along with some other inputs) is decidable

B. The language of codes for TM's M that when started with blank tape, eventually write a 1 somewhere on the tape is undecidable

C. The language accepted by a TM M is L (M) is always recursive

D. Post's correspondence problem is undecidable

Choose the correct answer from the options given below:

1. A, B and C only

2. B. C and D only

3. A and C only

4. B and D only

Solution - (4) B and D Only

2. In the standard Ethernet with transmission rate of 10 Mbps, asssume that the length of the medium is 2500m and size of a frame is 512 bytes. The propagation speed of a signal in a cable is normally 2x 10 m/s. The transmission delay and propogation delay are

1. 25.25 μs and 51.2 μs

2. 51.2 μs and 12.5 μs

3. 10.24 μs and 50.12 μs

4. 12.5 µs and 51.2 μs

Solution - (2) 51.2 μs and 12.5 μs

3. Given below are two statements:

Statement I: Fuzzifier is a part of a fuzzy system

Statement II: Inference engine is a part of fuzzy system

In the light of the above statements, choose the most appropriate answer from the options given below.

1. Both Statement I and Statement II are correct

2. Both Statement I and Statement II are incorrect

3. Statement I is correct but Statement II is incorrect

4. Statement I is incorrect but Statement II is correct

Solution - (1)  Both Statement I and Statement II are correct

4. How will you free the memory allocated by the following program?

#include

#include

#define MAXROW 3

#define MAXCOL 4

int main ()

{

int** p. i. J.

p= (int**)malloc (MAXROW* size of (int*));

return 0:

}

1. memfree (int p);

2. dealloc (p):

3. malloc (p.0):

4. free (p):

Solution - (4)  free (p):

5. Let G= \(\dfrac{R}{\{0\}}\) and H= {-1.1} be groups under the multiplication. Then, the map ϕ: G → H defined by ϕ(x)= \(\dfrac x{|x|}\) is

1. Not a homomorphism

2. A one-one homomorphism, which is not onto

3. An onto homomorphism, which is not one to one

4. An homomorphism

Solution - (3)  An onto homomorphism, which is not one to one

6. How many integral solutions are there to x + y + z + w = 29, where x ≥ 1, y ≥ 2, z ≥ 3 and w ≥ 0?

1.2400

2.2600

3.2800

4.3000

Solution - (2)  2600

7. Which of the following is not a mutation operator in a genetic algorithm?

A. Random resetting

B. Scramble

C. Inversion

D. Difference

Choose the correct answer from the options given below:

1. A and B only

2. B and D only

3. C and D only

4. D only

Solution - (4)  D only

8. A B-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then maximum number of nodes that could be newly created in the process is

1.5

2.4

3.3

4.2

Solution - (1) 5

9. Let R (A.B. C.D.F) be a relational schema with following functional dependencies:

C → F, E → A, EC → D, A → B. Which of the following is a key for R?

1. CD

2. EC

3. AE

4. AC

Solution - (2)  EC

10. A TCP server application is programmed to listen on port P on host S. A TCP client is connected to the TCP server over the network. Consider that while TCP connection is active the server is crashed and rebooted. Assume that the client does not use TCP keepalive timer. Which of the following behaviour's is/are possible?

Statement I: The TCP application server on S can listen on P after reboot.

Statement II: If client sends a packet after the server reboot, it will receive the RST segment.

In the light of the above statements, choose the correct answer from the options given below.

1. Both Statement I and Statement II are true

2. Both Statement I and Statement II are false

3. Statement I is true but Statement II is false

4. Statement I is false but Statement II is true

Solution - (1) Both Statement I and Statement II are true