UGC NET JUNE 2013
SYLLABUS, MODEL PAPER/ PREVIOUS YEARS SOLVED QUESTION PAPERS.
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
NOTE: Move mouse over your answer to see your answer is right or wrong.
1. If x and y are independent Gaussian random variables with average value 0 and with
same variance, their joint probability density function is given by :
(A) p(x, y)5p(x).p(y)
(B) p(x, y)5p(x)1p(y)
(C) p(x, y)5p(x1y)
(D) p(x, y)5p(x).p(y)1p(x)
ANS TELL ME.
2. In order that a code is ‘t’ error correcting, the minimum Hamming distance should be :
(A) t
(B) 2t21
(C) 2t
(D) 2t11
(A) x
(B) y
(C) z
(D) x1y1z
(B) Qn115J. Q n1 K .Qn
(C) Qn115Qn J.K
(D) Qn115(J1k)Qn
5. In order to implement a n variable switching function, a MUX must have :
(A) 2**n inputs
(B) 2**n+1 inputs
(C) 2**(n-1) inputs
(D) 2**n-1 inputs
6. The throughput of pure ALOHA is given by :
(A) S=G
(B) S=e**2G
(C) S=Ge**2G
(D) S=Ge**-2G
7. The Fiber Distributed Data Interface uses :
(A) single mode fibers and LEDs
(B) multimode fibers and LEDs
(C) single mode fibers and ILDs
(D) multimode fibers and ILDs
8. To employ multi-access in GSM, users are given different :
(A) time slots
(B) bandpass filters
(C) handsets
(D) frequency bands
9. With a four programs in memory and with 80% average I/O wait, the CPU utilization
is ?
(A) 60%
(B) 70%
(C) 90%
(D) 100%
10. Assume N segments in memory and a page size of P bytes. The wastage on account of
internal fragmentation is :
(A) NP/2 bytes
(B) P/2 bytes
(C) N/2 bytes
(D) NP bytes
11. Assertion (A) : Bit maps are not often used in memory management.
Reason (R) : Searching a bit map for a run of given length is a slow operation.
(A) Both (A) and (R) are true and (R) is correct explanation for (A)
(B) Both (A) and (R) are true but (R) is not correct explanation for (A)
(C) (A) is true (R) is false
(D) (A) is false (R) is true
12. The complete graph with four vertices has k edges where k is :
(A) 3
(B) 4
(C) 5
(D) 6
13. The octal equivalent of hexadecimal (A.B)16 is :
(A) 47.21
(B) 12.74
(C) 12.71
(D) 17.21
14. A reduced state table has 18 rows. The minimum number of Flips flops needed to
implement the sequential machine is :
(A) 18
(B) 9
(C) 5
(D) 4
15. What is the value of ‘b’ after the execution of the following code statements :
c=10;
b=+ +c+ + +c;
(A) 20
(B) 22
(C) 23
(D) None
16. Which of the following does not represent a valid storage class in ‘c’ ?
(A) automatic
(B) static
(C) union
(D) extern
17. The friend functions are used in situations where :
(A) We want to have access to unrelated classes
(B) Dynamic binding is required
(C) Exchange of data between classes to take place
(D) None of the above
18. (i) DML includes a query language based on both relation algebra and tuple calculus
(ii) DML includes a query language based on tuple calculus
(iii) DML includes a query language based on relational algebra
(iv) DML includes a query language based on none of the relational algebra and tuple calculus
Which one is correct ?
(A) (i) only
(B) (ii) only
(C) (iii) only
(D) (iv) only
19. Suppose it takes 100 ns to access a page table and 20 ns to access associative memory with a 90% hit rate, the average access time equals :
(A) 20 ns
(B) 28 ns
(C) 90 ns
(D) 100 ns
20. There exists a construct which returns a value ‘true’ if the argument subquery is :
(A) empty
(B) non-empty
(C) in error
(D) none of the above
21. Which construct in SQL is used to test whether a subquery has any tuples in its result ?
(A) UNIQUE
(B) EXISTS
(C) GROUP BY
(D) EXCEPT
22. ORACLE supports :
(A) inner join and outer join only
(B) outer join and semi join only
(C) inner join, outer join, semi join only
(D) inner join, outer join, semi join and anti join
ANS TELL ME.
23. Which two of the following are equivalent for an undirected graph G ?
(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n21) edges
(iv) G has n edges
(A) (i) and (ii)
(B) (i) and (iii)
(C) (i) and (iv)
(D) (ii) and (iii)
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
NOTE: Move mouse over your answer to see your answer is right or wrong.
1. If x and y are independent Gaussian random variables with average value 0 and with
same variance, their joint probability density function is given by :
(A) p(x, y)5p(x).p(y)
(B) p(x, y)5p(x)1p(y)
(C) p(x, y)5p(x1y)
(D) p(x, y)5p(x).p(y)1p(x)
ANS TELL ME.
2. In order that a code is ‘t’ error correcting, the minimum Hamming distance should be :
(A) t
(B) 2t21
(C) 2t
(D) 2t11
(A) x
(B) y
(C) z
(D) x1y1z
(B) Qn115J. Q n1 K .Qn(C) Qn115Qn J.K
(D) Qn115(J1k)Qn
5. In order to implement a n variable switching function, a MUX must have :
(A) 2**n inputs
(B) 2**n+1 inputs
(C) 2**(n-1) inputs
(D) 2**n-1 inputs
6. The throughput of pure ALOHA is given by :
(A) S=G
(B) S=e**2G
(C) S=Ge**2G
(D) S=Ge**-2G
7. The Fiber Distributed Data Interface uses :
(A) single mode fibers and LEDs
(B) multimode fibers and LEDs
(C) single mode fibers and ILDs
(D) multimode fibers and ILDs
8. To employ multi-access in GSM, users are given different :
(A) time slots
(B) bandpass filters
(C) handsets
(D) frequency bands
9. With a four programs in memory and with 80% average I/O wait, the CPU utilization
is ?
(A) 60%
(B) 70%
(C) 90%
(D) 100%
10. Assume N segments in memory and a page size of P bytes. The wastage on account of
internal fragmentation is :
(A) NP/2 bytes
(B) P/2 bytes
(C) N/2 bytes
(D) NP bytes
11. Assertion (A) : Bit maps are not often used in memory management.
Reason (R) : Searching a bit map for a run of given length is a slow operation.
(A) Both (A) and (R) are true and (R) is correct explanation for (A)
(B) Both (A) and (R) are true but (R) is not correct explanation for (A)
(C) (A) is true (R) is false
(D) (A) is false (R) is true
12. The complete graph with four vertices has k edges where k is :
(A) 3
(B) 4
(C) 5
(D) 6
13. The octal equivalent of hexadecimal (A.B)16 is :
(A) 47.21
(B) 12.74
(C) 12.71
(D) 17.21
14. A reduced state table has 18 rows. The minimum number of Flips flops needed to
implement the sequential machine is :
(A) 18
(B) 9
(C) 5
(D) 4
15. What is the value of ‘b’ after the execution of the following code statements :
c=10;
b=+ +c+ + +c;
(A) 20
(B) 22
(C) 23
(D) None
16. Which of the following does not represent a valid storage class in ‘c’ ?
(A) automatic
(B) static
(C) union
(D) extern
17. The friend functions are used in situations where :
(A) We want to have access to unrelated classes
(B) Dynamic binding is required
(C) Exchange of data between classes to take place
(D) None of the above
18. (i) DML includes a query language based on both relation algebra and tuple calculus
(ii) DML includes a query language based on tuple calculus
(iii) DML includes a query language based on relational algebra
(iv) DML includes a query language based on none of the relational algebra and tuple calculus
Which one is correct ?
(A) (i) only
(B) (ii) only
(C) (iii) only
(D) (iv) only
19. Suppose it takes 100 ns to access a page table and 20 ns to access associative memory with a 90% hit rate, the average access time equals :
(A) 20 ns
(B) 28 ns
(C) 90 ns
(D) 100 ns
20. There exists a construct which returns a value ‘true’ if the argument subquery is :
(A) empty
(B) non-empty
(C) in error
(D) none of the above
21. Which construct in SQL is used to test whether a subquery has any tuples in its result ?
(A) UNIQUE
(B) EXISTS
(C) GROUP BY
(D) EXCEPT
22. ORACLE supports :
(A) inner join and outer join only
(B) outer join and semi join only
(C) inner join, outer join, semi join only
(D) inner join, outer join, semi join and anti join
ANS TELL ME.
23. Which two of the following are equivalent for an undirected graph G ?
(i) G is a tree
(ii) There is at least one path between any two distinct vertices of G
(iii) G contains no cycles and has (n21) edges
(iv) G has n edges
(A) (i) and (ii)
(B) (i) and (iii)
(C) (i) and (iv)
(D) (ii) and (iii)
IF YOU FIND ANY ANSWER WRONG,COMMENT ME, SO THAT I RIGHT THAT ANSWER
THANKS
THANKS
0 comments:
Post a Comment