UGC NET MODEL SOLVED PAPER FOR DECEMBER 2014

UGC NET MODEL SOLVED PAPER FOR DECEMBER 2014

1. Every time attribute P appears, it is matched with the same value of attribute Q, but not the same

value of attribute R. Therefore, it is true that:

(A) P ®Q

(B) P ®R

(C) P ® (Q,R).

(D) (Q,R)® P

Ans.: A.

Reason: Value of P matches only with value of Q

2. A 3NF removes

A. Repeating groups

B. Partial functional dependency

C. Transisitive functional dependency

D. Other higher functional dependency

Ans.: C.

Reason: Transitive functional dependency exists when a non key attribute value is functionally dependent on another non key attribute

3. The following are the set of processes with their respective CPU burst time (in

milliseconds).

Processes     CPU Burst time

P1                                10

P2                                5

P3                               5

What will be the average waiting time if the process arrived in the order: P1, P2 &

P3?

(A) 6.82 unit

(B) 7.56 unit

(C) 8.33 unit

(D) 9.97 unit

Ans.: C.

Very simple question. Often asked question in exam.

Reason:

Burst time is the time required by a process in CPU to complete its task.

So we have to find out waiting time.

For process 1, Waiting time is 0 as it is the first task to be processed,

For process 2, waiting time is 10 as process 2 has to wait till process 1 is over.

For process 3, waiting time is 15 as it has to wait till process 1 and process 2 is over.

That is wait time of process 1 and 2 is 10+5=15

Finally Average waiting time will be (0+10+15)/3=25/3

Thus 25/3=8.33 Unit time

4. Error detection at the data link level is achieved by:-

(A) Bit stuffing

(B) Cyclic redundancy check.

(C) Hamming codes

(D) Equalization

Ans.: B.

Tip:There are three techniques of error detection at DL Level

 (1) Parity check

(2) Check summing method

(3) Cyclic redundancy check.

5. How many characters per second (7 bits + 1 parity) can be transmitted over a 2400

bps line if the transfer is synchronous (1 start and 1 stop bit)?

(A) 300

(B) 240

(C) 250

(D) 275

Ans.: A

Evergreen question.

Start and stop bits are not needed in synchronous transfer of data,

So, 

2400/ 8 =300.

6. The abstraction process of introducing new characters to an existing class

of objects to create one or more new classes of objects is called as

(A) Specialization

(B) Generalization

(C) Abstraction

(D) Aggregation

Ans.: A.

7. The Breadth - first search Tree are used in

(A) Banking

(B) Defense

(C) Law

(D) All of these

Ans.: D

8. Which of the following parser is more powerful and expensive?

(A) Simple LR

(B) Look ahead LR

(C) Canonical LR

(D) None of these

Ans.: C

9. _________protocol is typically used for error reposing.

(A) DNS

(B) ICMP

(C) POP-3

(D) IMCP

Ans.: B.

10. Consider following grammar

S ® gA

A ® aA/eB/g

B ® gA

Equivalent left linear grammar will be

(A.)

S  ® Ag

A ®  Aa /Bg/ g

B  ® Ag

(B.)

S® gA

A ®aA / gB / g

B® gA

(C.)

S® AB

A® aA / gB / g

B® gA

 (D) None of above

Ans.: A.)

Rule: A grammar is called left most grammar if and only if all steps involved in derivation have leftmost variable replacement only.